./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:35:39,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:35:39,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:35:39,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:35:39,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:35:39,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:35:39,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:35:39,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:35:39,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:35:39,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:35:39,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:35:39,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:35:39,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:35:39,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:35:39,398 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:35:39,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:35:39,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:35:39,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:35:39,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:35:39,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:35:39,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:35:39,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:35:39,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:35:39,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:35:39,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:35:39,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:35:39,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:35:39,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:35:39,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:35:39,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:35:39,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:35:39,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:35:39,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:39,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:35:39,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:35:39,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:35:39,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:35:39,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:35:39,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:35:39,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:35:39,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:35:39,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:35:39,407 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2024-11-19 00:35:39,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:35:39,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:35:39,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:35:39,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:35:39,621 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:35:39,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-11-19 00:35:40,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:35:40,983 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:35:40,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-11-19 00:35:40,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96d13912/fc921589de81496991047d89a898059e/FLAGd17bb8783 [2024-11-19 00:35:41,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96d13912/fc921589de81496991047d89a898059e [2024-11-19 00:35:41,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:35:41,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:35:41,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:41,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:35:41,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:35:41,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac47d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41, skipping insertion in model container [2024-11-19 00:35:41,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:35:41,549 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i[916,929] [2024-11-19 00:35:41,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:41,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:35:41,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i[916,929] [2024-11-19 00:35:41,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:41,684 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:35:41,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41 WrapperNode [2024-11-19 00:35:41,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:41,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:41,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:35:41,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:35:41,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,731 INFO L138 Inliner]: procedures = 29, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 402 [2024-11-19 00:35:41,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:41,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:35:41,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:35:41,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:35:41,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,765 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-11-19 00:35:41,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:35:41,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:35:41,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:35:41,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:35:41,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (1/1) ... [2024-11-19 00:35:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:41,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:41,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:35:41,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:35:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:35:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:35:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:35:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:35:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:35:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:35:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:35:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:35:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:35:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:35:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:35:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:35:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:35:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:35:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:35:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:35:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:35:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:35:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:35:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:35:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:35:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:35:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:35:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:35:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:35:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:35:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:35:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:35:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:35:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:35:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:35:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:35:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:35:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:35:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:35:41,974 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:35:41,975 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:35:42,305 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-19 00:35:42,305 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:35:42,318 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:35:42,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:35:42,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:42 BoogieIcfgContainer [2024-11-19 00:35:42,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:35:42,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:35:42,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:35:42,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:35:42,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:41" (1/3) ... [2024-11-19 00:35:42,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1e8b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:42, skipping insertion in model container [2024-11-19 00:35:42,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:41" (2/3) ... [2024-11-19 00:35:42,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1e8b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:42, skipping insertion in model container [2024-11-19 00:35:42,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:42" (3/3) ... [2024-11-19 00:35:42,328 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2024-11-19 00:35:42,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:35:42,340 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:35:42,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:35:42,391 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64ca5eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:35:42,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:35:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:35:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:35:42,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:42,405 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:42,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:42,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1009715545, now seen corresponding path program 1 times [2024-11-19 00:35:42,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:42,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821950861] [2024-11-19 00:35:42,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:42,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 00:35:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821950861] [2024-11-19 00:35:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821950861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:42,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827848226] [2024-11-19 00:35:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:42,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:42,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:42,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:35:42,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:35:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:42,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:35:42,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 00:35:42,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827848226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:42,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:35:42,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:35:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746550875] [2024-11-19 00:35:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:42,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:35:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:35:42,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:42,974 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:35:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:42,999 INFO L93 Difference]: Finished difference Result 195 states and 302 transitions. [2024-11-19 00:35:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:35:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-19 00:35:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:43,006 INFO L225 Difference]: With dead ends: 195 [2024-11-19 00:35:43,006 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 00:35:43,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:43,013 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:43,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 00:35:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 00:35:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:35:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-19 00:35:43,044 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 116 [2024-11-19 00:35:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:43,045 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-19 00:35:43,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:35:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-19 00:35:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:35:43,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:43,048 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:43,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:35:43,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:35:43,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:43,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash -675339485, now seen corresponding path program 1 times [2024-11-19 00:35:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:43,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813037280] [2024-11-19 00:35:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:43,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:35:44,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:44,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813037280] [2024-11-19 00:35:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813037280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:44,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:44,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:35:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605355315] [2024-11-19 00:35:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:44,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:35:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:44,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:35:44,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:35:44,032 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:35:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:44,413 INFO L93 Difference]: Finished difference Result 364 states and 528 transitions. [2024-11-19 00:35:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:35:44,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-19 00:35:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:44,416 INFO L225 Difference]: With dead ends: 364 [2024-11-19 00:35:44,416 INFO L226 Difference]: Without dead ends: 270 [2024-11-19 00:35:44,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:35:44,419 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 372 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:44,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 612 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:35:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-19 00:35:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 265. [2024-11-19 00:35:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 224 states have (on average 1.3973214285714286) internal successors, (313), 225 states have internal predecessors, (313), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 00:35:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 387 transitions. [2024-11-19 00:35:44,458 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 387 transitions. Word has length 116 [2024-11-19 00:35:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:44,459 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 387 transitions. [2024-11-19 00:35:44,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:35:44,460 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 387 transitions. [2024-11-19 00:35:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:35:44,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:44,462 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:44,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:35:44,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:44,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1262145499, now seen corresponding path program 1 times [2024-11-19 00:35:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:44,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736228918] [2024-11-19 00:35:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:35:44,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736228918] [2024-11-19 00:35:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736228918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:44,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:35:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786447524] [2024-11-19 00:35:44,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:44,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:35:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:35:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:35:44,744 INFO L87 Difference]: Start difference. First operand 265 states and 387 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:35:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:44,866 INFO L93 Difference]: Finished difference Result 795 states and 1164 transitions. [2024-11-19 00:35:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:35:44,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-19 00:35:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:44,872 INFO L225 Difference]: With dead ends: 795 [2024-11-19 00:35:44,872 INFO L226 Difference]: Without dead ends: 533 [2024-11-19 00:35:44,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:35:44,876 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 125 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:44,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 523 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:35:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-19 00:35:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 301. [2024-11-19 00:35:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 260 states have (on average 1.396153846153846) internal successors, (363), 261 states have internal predecessors, (363), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 00:35:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 437 transitions. [2024-11-19 00:35:44,908 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 437 transitions. Word has length 116 [2024-11-19 00:35:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:44,908 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 437 transitions. [2024-11-19 00:35:44,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:35:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 437 transitions. [2024-11-19 00:35:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:35:44,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:44,913 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:44,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:35:44,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:44,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1079912016, now seen corresponding path program 1 times [2024-11-19 00:35:44,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:44,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474060259] [2024-11-19 00:35:44,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:44,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:35:45,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675579593] [2024-11-19 00:35:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:45,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:45,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:45,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:35:45,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:35:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:45,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:35:45,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:45,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-19 00:35:45,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-19 00:35:45,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:45,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 36 [2024-11-19 00:35:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:35:45,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474060259] [2024-11-19 00:35:45,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:35:45,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675579593] [2024-11-19 00:35:45,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675579593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:45,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:45,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:35:45,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571978860] [2024-11-19 00:35:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:45,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:35:45,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:45,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:35:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=44, Unknown=5, NotChecked=0, Total=72 [2024-11-19 00:35:45,840 INFO L87 Difference]: Start difference. First operand 301 states and 437 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:35:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:46,720 INFO L93 Difference]: Finished difference Result 774 states and 1118 transitions. [2024-11-19 00:35:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:35:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 00:35:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:46,723 INFO L225 Difference]: With dead ends: 774 [2024-11-19 00:35:46,723 INFO L226 Difference]: Without dead ends: 476 [2024-11-19 00:35:46,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=56, Unknown=5, NotChecked=0, Total=90 [2024-11-19 00:35:46,724 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 192 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 1 mSolverCounterUnsat, 106 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 106 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:46,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 928 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 478 Invalid, 106 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:35:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-19 00:35:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 329. [2024-11-19 00:35:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 288 states have (on average 1.3923611111111112) internal successors, (401), 289 states have internal predecessors, (401), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 00:35:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 475 transitions. [2024-11-19 00:35:46,740 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 475 transitions. Word has length 118 [2024-11-19 00:35:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:46,741 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 475 transitions. [2024-11-19 00:35:46,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:35:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 475 transitions. [2024-11-19 00:35:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:35:46,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:46,742 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:46,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:35:46,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 00:35:46,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:46,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash -199951662, now seen corresponding path program 1 times [2024-11-19 00:35:46,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:46,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018837969] [2024-11-19 00:35:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:35:47,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:47,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018837969] [2024-11-19 00:35:47,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018837969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:47,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:47,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:35:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935158797] [2024-11-19 00:35:47,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:47,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:35:47,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:47,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:35:47,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:35:47,353 INFO L87 Difference]: Start difference. First operand 329 states and 475 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:35:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:47,667 INFO L93 Difference]: Finished difference Result 729 states and 1049 transitions. [2024-11-19 00:35:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:35:47,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 00:35:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:47,670 INFO L225 Difference]: With dead ends: 729 [2024-11-19 00:35:47,670 INFO L226 Difference]: Without dead ends: 399 [2024-11-19 00:35:47,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:35:47,673 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 258 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:47,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 646 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:35:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-19 00:35:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 329. [2024-11-19 00:35:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 288 states have (on average 1.3784722222222223) internal successors, (397), 289 states have internal predecessors, (397), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 00:35:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 471 transitions. [2024-11-19 00:35:47,701 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 471 transitions. Word has length 118 [2024-11-19 00:35:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:47,703 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 471 transitions. [2024-11-19 00:35:47,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:35:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 471 transitions. [2024-11-19 00:35:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:35:47,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:47,705 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:47,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:35:47,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:47,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash 93460718, now seen corresponding path program 1 times [2024-11-19 00:35:47,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:47,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467916547] [2024-11-19 00:35:47,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:47,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:35:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675336106] [2024-11-19 00:35:47,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:47,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:47,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:47,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:35:47,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:35:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:47,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:35:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:48,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:35:48,237 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:35:48,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:35:48,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:35:48,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:48,443 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 00:35:48,512 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:35:48,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:35:48 BoogieIcfgContainer [2024-11-19 00:35:48,518 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:35:48,518 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:35:48,518 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:35:48,518 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:35:48,519 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:42" (3/4) ... [2024-11-19 00:35:48,520 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:35:48,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:35:48,522 INFO L158 Benchmark]: Toolchain (without parser) took 7137.31ms. Allocated memory was 172.0MB in the beginning and 268.4MB in the end (delta: 96.5MB). Free memory was 114.4MB in the beginning and 176.3MB in the end (delta: -61.9MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-19 00:35:48,522 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:35:48,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.01ms. Allocated memory is still 172.0MB. Free memory was 114.4MB in the beginning and 140.3MB in the end (delta: -25.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:35:48,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.93ms. Allocated memory is still 172.0MB. Free memory was 140.3MB in the beginning and 136.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:35:48,523 INFO L158 Benchmark]: Boogie Preprocessor took 63.45ms. Allocated memory is still 172.0MB. Free memory was 136.1MB in the beginning and 131.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:35:48,523 INFO L158 Benchmark]: RCFGBuilder took 524.81ms. Allocated memory is still 172.0MB. Free memory was 131.9MB in the beginning and 100.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 00:35:48,523 INFO L158 Benchmark]: TraceAbstraction took 6194.90ms. Allocated memory was 172.0MB in the beginning and 268.4MB in the end (delta: 96.5MB). Free memory was 99.4MB in the beginning and 177.3MB in the end (delta: -77.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-19 00:35:48,523 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 268.4MB. Free memory was 177.3MB in the beginning and 176.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:35:48,524 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.01ms. Allocated memory is still 172.0MB. Free memory was 114.4MB in the beginning and 140.3MB in the end (delta: -25.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.93ms. Allocated memory is still 172.0MB. Free memory was 140.3MB in the beginning and 136.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.45ms. Allocated memory is still 172.0MB. Free memory was 136.1MB in the beginning and 131.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 524.81ms. Allocated memory is still 172.0MB. Free memory was 131.9MB in the beginning and 100.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6194.90ms. Allocated memory was 172.0MB in the beginning and 268.4MB in the end (delta: 96.5MB). Free memory was 99.4MB in the beginning and 177.3MB in the end (delta: -77.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 268.4MB. Free memory was 177.3MB in the beginning and 176.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L34] unsigned char last_1_BOOL_unsigned_char_Array_0_4_ = 1; [L35] signed short int last_1_signed_short_int_Array_0_1_ = -4; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] EXPR BOOL_unsigned_char_Array_0[4] [L97] last_1_BOOL_unsigned_char_Array_0_4_ = BOOL_unsigned_char_Array_0[4] [L98] EXPR signed_short_int_Array_0[1] [L98] last_1_signed_short_int_Array_0_1_ = signed_short_int_Array_0[1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] double_Array_0[0] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L93] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET updateVariables() [L110] CALL step() [L39] EXPR signed_short_int_Array_0[0] [L39] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L39] COND FALSE !(last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) [L44] EXPR signed_char_Array_0[2] [L44] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]) [L44] EXPR signed_char_Array_0[2] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] signed long int stepLocal_1 = (((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0])); [L45] EXPR signed_char_Array_0[0] [L45] EXPR signed_char_Array_0[2] [L45] signed long int stepLocal_0 = signed_char_Array_0[0] / signed_char_Array_0[2]; [L46] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L46] COND TRUE (- double_Array_0[0]) >= 16.75 [L47] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L47] COND TRUE stepLocal_0 >= signed_char_Array_0[0] [L48] COND TRUE stepLocal_1 > -32 [L49] BOOL_unsigned_char_Array_0[4] = 0 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L63] EXPR signed_char_Array_0[0] [L63] signed char stepLocal_2 = signed_char_Array_0[0]; [L64] EXPR signed_char_Array_0[0] [L64] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] EXPR signed_char_Array_0[0] | signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=-25] [L64] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] COND TRUE ((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < stepLocal_2 [L65] EXPR signed_short_int_Array_0[0] [L65] signed_short_int_Array_0[1] = (signed_short_int_Array_0[0] - 256) [L69] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L69] COND FALSE !(1 == signed_char_Array_0[2]) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) [L101] EXPR BOOL_unsigned_char_Array_0[4] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101-L102] return (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 106 mSolverCounterUnknown, 947 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 947 mSDsluCounter, 2849 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2134 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1179 IncrementalHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 715 mSDtfsCounter, 1179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 454 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 694 ConstructedInterpolants, 1 QuantifiedInterpolants, 3167 SizeOfPredicates, 3 NumberOfNonLiveVariables, 792 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 2158/2184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:35:48,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:35:50,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:35:50,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:35:50,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:35:50,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:35:50,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:35:50,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:35:50,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:35:50,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:35:50,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:35:50,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:35:50,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:35:50,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:35:50,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:35:50,434 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:35:50,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:35:50,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:35:50,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:35:50,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:35:50,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:35:50,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:35:50,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:35:50,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:35:50,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:35:50,437 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:35:50,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:35:50,437 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:35:50,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:35:50,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:35:50,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:35:50,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:35:50,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:35:50,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:35:50,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:35:50,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:50,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:35:50,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:35:50,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:35:50,440 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:35:50,440 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:50,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:35:50,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:35:50,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:35:50,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:35:50,441 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2024-11-19 00:35:50,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:35:50,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:35:50,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:35:50,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:35:50,716 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:35:50,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-11-19 00:35:51,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:35:52,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:35:52,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-11-19 00:35:52,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb5d7912/f6383bbd72564a5bb04ed771190d5a17/FLAG0be3c48ff [2024-11-19 00:35:52,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb5d7912/f6383bbd72564a5bb04ed771190d5a17 [2024-11-19 00:35:52,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:35:52,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:35:52,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:52,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:35:52,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:35:52,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a58d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52, skipping insertion in model container [2024-11-19 00:35:52,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:35:52,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i[916,929] [2024-11-19 00:35:52,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:52,749 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:35:52,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i[916,929] [2024-11-19 00:35:52,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:52,834 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:35:52,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52 WrapperNode [2024-11-19 00:35:52,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:52,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:52,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:35:52,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:35:52,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,902 INFO L138 Inliner]: procedures = 33, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 381 [2024-11-19 00:35:52,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:52,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:35:52,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:35:52,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:35:52,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,955 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-11-19 00:35:52,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:35:53,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:35:53,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:35:53,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:35:53,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:53,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:53,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:35:53,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:35:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:35:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:35:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:35:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:35:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:35:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:35:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:35:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:35:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:35:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:35:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:35:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:35:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:35:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:35:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:35:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:35:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:35:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:35:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:35:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:35:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:35:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:35:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:35:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:35:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:35:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:35:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:35:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:35:53,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:35:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:35:53,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:35:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:35:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:35:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:35:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:35:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:35:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:35:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:35:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:35:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:35:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:35:53,202 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:35:53,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:35:53,739 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-19 00:35:53,740 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:35:53,755 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:35:53,755 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:35:53,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:53 BoogieIcfgContainer [2024-11-19 00:35:53,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:35:53,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:35:53,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:35:53,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:35:53,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:52" (1/3) ... [2024-11-19 00:35:53,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ea993c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:53, skipping insertion in model container [2024-11-19 00:35:53,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (2/3) ... [2024-11-19 00:35:53,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ea993c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:53, skipping insertion in model container [2024-11-19 00:35:53,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:53" (3/3) ... [2024-11-19 00:35:53,763 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2024-11-19 00:35:53,776 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:35:53,776 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:35:53,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:35:53,833 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@235d84b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:35:53,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:35:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:35:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 00:35:53,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:53,849 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:53,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:53,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash -421847647, now seen corresponding path program 1 times [2024-11-19 00:35:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:53,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044019566] [2024-11-19 00:35:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:53,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:53,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:53,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:53,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:35:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:54,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:35:54,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-19 00:35:54,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:54,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:54,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044019566] [2024-11-19 00:35:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044019566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:54,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:54,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:35:54,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617188616] [2024-11-19 00:35:54,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:35:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:35:54,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:54,198 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:35:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:54,220 INFO L93 Difference]: Finished difference Result 179 states and 278 transitions. [2024-11-19 00:35:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:35:54,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-19 00:35:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:54,229 INFO L225 Difference]: With dead ends: 179 [2024-11-19 00:35:54,230 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 00:35:54,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:54,235 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:54,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 00:35:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 00:35:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:35:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-19 00:35:54,269 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2024-11-19 00:35:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:54,269 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-19 00:35:54,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:35:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-19 00:35:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 00:35:54,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:54,273 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:54,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:35:54,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:54,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:54,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash 807549213, now seen corresponding path program 1 times [2024-11-19 00:35:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175991430] [2024-11-19 00:35:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:54,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:54,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:54,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:54,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:35:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:54,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 00:35:54,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:54,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 00:35:55,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 00:35:56,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-19 00:35:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:35:56,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:57,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 00:35:58,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175991430] [2024-11-19 00:35:58,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175991430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [886690360] [2024-11-19 00:35:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:58,016 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:58,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:35:58,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:35:58,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-19 00:35:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:58,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:35:58,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:58,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:35:59,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 00:36:00,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 00:36:00,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-19 00:36:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-19 00:36:02,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:02,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 00:36:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [886690360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:02,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:36:02,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-19 00:36:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984134048] [2024-11-19 00:36:02,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:36:02,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 00:36:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:02,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 00:36:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 00:36:02,801 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 24 states, 21 states have (on average 4.714285714285714) internal successors, (99), 22 states have internal predecessors, (99), 8 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-19 00:36:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:18,564 INFO L93 Difference]: Finished difference Result 351 states and 497 transitions. [2024-11-19 00:36:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 00:36:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.714285714285714) internal successors, (99), 22 states have internal predecessors, (99), 8 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) Word has length 114 [2024-11-19 00:36:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:18,568 INFO L225 Difference]: With dead ends: 351 [2024-11-19 00:36:18,570 INFO L226 Difference]: Without dead ends: 265 [2024-11-19 00:36:18,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=645, Invalid=2325, Unknown=0, NotChecked=0, Total=2970 [2024-11-19 00:36:18,573 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 712 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:18,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1060 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2024-11-19 00:36:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-19 00:36:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2024-11-19 00:36:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 168 states have (on average 1.3273809523809523) internal successors, (223), 169 states have internal predecessors, (223), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 00:36:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 297 transitions. [2024-11-19 00:36:18,608 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 297 transitions. Word has length 114 [2024-11-19 00:36:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:18,609 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 297 transitions. [2024-11-19 00:36:18,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.714285714285714) internal successors, (99), 22 states have internal predecessors, (99), 8 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-19 00:36:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 297 transitions. [2024-11-19 00:36:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 00:36:18,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:18,611 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:18,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-19 00:36:18,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:19,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:19,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:19,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash 220743199, now seen corresponding path program 1 times [2024-11-19 00:36:19,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:19,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609143336] [2024-11-19 00:36:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:19,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:19,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:19,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:19,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:36:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:19,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:36:19,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:19,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 00:36:19,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-11-19 00:36:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:36:19,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:19,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609143336] [2024-11-19 00:36:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609143336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310697979] [2024-11-19 00:36:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:19,229 INFO L87 Difference]: Start difference. First operand 212 states and 297 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:19,509 INFO L93 Difference]: Finished difference Result 491 states and 699 transitions. [2024-11-19 00:36:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:19,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-11-19 00:36:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:19,513 INFO L225 Difference]: With dead ends: 491 [2024-11-19 00:36:19,513 INFO L226 Difference]: Without dead ends: 363 [2024-11-19 00:36:19,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:36:19,514 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 115 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:19,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 457 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:36:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-19 00:36:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 228. [2024-11-19 00:36:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 184 states have (on average 1.326086956521739) internal successors, (244), 185 states have internal predecessors, (244), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 00:36:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2024-11-19 00:36:19,537 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 114 [2024-11-19 00:36:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:19,537 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2024-11-19 00:36:19,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:19,537 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2024-11-19 00:36:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:36:19,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:19,539 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:19,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 00:36:19,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:19,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:19,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1417211638, now seen corresponding path program 1 times [2024-11-19 00:36:19,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:19,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821187841] [2024-11-19 00:36:19,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:19,743 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:19,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:36:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:19,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:36:19,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:20,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:20,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 54 [2024-11-19 00:36:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-19 00:36:20,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:20,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821187841] [2024-11-19 00:36:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821187841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:36:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691771723] [2024-11-19 00:36:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:36:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:36:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:20,805 INFO L87 Difference]: Start difference. First operand 228 states and 318 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:36:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:21,800 INFO L93 Difference]: Finished difference Result 682 states and 954 transitions. [2024-11-19 00:36:21,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:36:21,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-19 00:36:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:21,805 INFO L225 Difference]: With dead ends: 682 [2024-11-19 00:36:21,805 INFO L226 Difference]: Without dead ends: 540 [2024-11-19 00:36:21,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:21,806 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 267 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:21,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1076 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:36:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-19 00:36:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 520. [2024-11-19 00:36:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 425 states have (on average 1.331764705882353) internal successors, (566), 431 states have internal predecessors, (566), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:36:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2024-11-19 00:36:21,869 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 116 [2024-11-19 00:36:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:21,869 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2024-11-19 00:36:21,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:36:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2024-11-19 00:36:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:36:21,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:21,873 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:21,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 00:36:22,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:22,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:22,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash 407816570, now seen corresponding path program 1 times [2024-11-19 00:36:22,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:22,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333018403] [2024-11-19 00:36:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:22,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:22,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:22,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:22,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:36:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:22,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:36:22,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:22,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 00:36:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:36:22,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:22,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:22,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333018403] [2024-11-19 00:36:22,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333018403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:22,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923846991] [2024-11-19 00:36:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:22,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:22,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:22,468 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:23,699 INFO L93 Difference]: Finished difference Result 1032 states and 1450 transitions. [2024-11-19 00:36:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:23,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-19 00:36:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:23,703 INFO L225 Difference]: With dead ends: 1032 [2024-11-19 00:36:23,703 INFO L226 Difference]: Without dead ends: 688 [2024-11-19 00:36:23,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:23,705 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 80 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:23,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 408 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:36:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-19 00:36:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 520. [2024-11-19 00:36:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 425 states have (on average 1.3247058823529412) internal successors, (563), 431 states have internal predecessors, (563), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:36:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 723 transitions. [2024-11-19 00:36:23,742 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 723 transitions. Word has length 116 [2024-11-19 00:36:23,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:23,743 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 723 transitions. [2024-11-19 00:36:23,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 723 transitions. [2024-11-19 00:36:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:36:23,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:23,747 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:23,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 00:36:23,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:23,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:23,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:23,948 INFO L85 PathProgramCache]: Analyzing trace with hash 14789560, now seen corresponding path program 1 times [2024-11-19 00:36:23,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:23,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467539990] [2024-11-19 00:36:23,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:23,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:23,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:23,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:23,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:36:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:24,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:36:24,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:36:24,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:24,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:24,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467539990] [2024-11-19 00:36:24,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467539990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:24,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:24,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126584531] [2024-11-19 00:36:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:24,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:24,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:24,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:24,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:24,117 INFO L87 Difference]: Start difference. First operand 520 states and 723 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:24,172 INFO L93 Difference]: Finished difference Result 927 states and 1302 transitions. [2024-11-19 00:36:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-19 00:36:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:24,175 INFO L225 Difference]: With dead ends: 927 [2024-11-19 00:36:24,175 INFO L226 Difference]: Without dead ends: 535 [2024-11-19 00:36:24,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:24,177 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:24,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-19 00:36:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-11-19 00:36:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 440 states have (on average 1.3136363636363637) internal successors, (578), 446 states have internal predecessors, (578), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:36:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 738 transitions. [2024-11-19 00:36:24,211 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 738 transitions. Word has length 116 [2024-11-19 00:36:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:24,212 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 738 transitions. [2024-11-19 00:36:24,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 738 transitions. [2024-11-19 00:36:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:36:24,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:24,214 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:24,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 00:36:24,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:24,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:24,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash 316892812, now seen corresponding path program 1 times [2024-11-19 00:36:24,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:24,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816876672] [2024-11-19 00:36:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:24,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:24,423 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:24,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 00:36:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:24,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:36:24,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-19 00:36:24,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:24,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816876672] [2024-11-19 00:36:24,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816876672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:24,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:24,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:36:24,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909029922] [2024-11-19 00:36:24,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:24,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:36:24,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:24,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:36:24,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:36:24,577 INFO L87 Difference]: Start difference. First operand 535 states and 738 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:36:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:24,634 INFO L93 Difference]: Finished difference Result 993 states and 1375 transitions. [2024-11-19 00:36:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:36:24,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-19 00:36:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:24,637 INFO L225 Difference]: With dead ends: 993 [2024-11-19 00:36:24,637 INFO L226 Difference]: Without dead ends: 535 [2024-11-19 00:36:24,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:36:24,638 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:24,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-19 00:36:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-11-19 00:36:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 440 states have (on average 1.3068181818181819) internal successors, (575), 446 states have internal predecessors, (575), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:36:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 735 transitions. [2024-11-19 00:36:24,672 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 735 transitions. Word has length 116 [2024-11-19 00:36:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:24,673 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 735 transitions. [2024-11-19 00:36:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:36:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 735 transitions. [2024-11-19 00:36:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 00:36:24,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:24,674 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:24,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 00:36:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:24,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash 298100019, now seen corresponding path program 1 times [2024-11-19 00:36:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:24,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815866035] [2024-11-19 00:36:24,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:24,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:24,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:24,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:24,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 00:36:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:25,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:36:25,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:25,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 00:36:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:36:25,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:25,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815866035] [2024-11-19 00:36:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815866035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:25,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:25,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:36:25,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371866211] [2024-11-19 00:36:25,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:25,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:36:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:36:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:36:25,170 INFO L87 Difference]: Start difference. First operand 535 states and 735 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:25,498 INFO L93 Difference]: Finished difference Result 1593 states and 2212 transitions. [2024-11-19 00:36:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:25,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-19 00:36:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:25,503 INFO L225 Difference]: With dead ends: 1593 [2024-11-19 00:36:25,503 INFO L226 Difference]: Without dead ends: 1186 [2024-11-19 00:36:25,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:25,505 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 237 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:25,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 333 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:36:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2024-11-19 00:36:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1110. [2024-11-19 00:36:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 963 states have (on average 1.343717549325026) internal successors, (1294), 973 states have internal predecessors, (1294), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-19 00:36:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1546 transitions. [2024-11-19 00:36:25,560 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1546 transitions. Word has length 117 [2024-11-19 00:36:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:25,561 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1546 transitions. [2024-11-19 00:36:25,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1546 transitions. [2024-11-19 00:36:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 00:36:25,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:25,562 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:25,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:25,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:25,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:25,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:25,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2103538353, now seen corresponding path program 1 times [2024-11-19 00:36:25,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:25,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658889499] [2024-11-19 00:36:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:25,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:25,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:25,765 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:25,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 00:36:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:25,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 00:36:25,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:25,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:36:26,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-19 00:36:26,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:26,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2024-11-19 00:36:26,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:26,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 44 [2024-11-19 00:36:27,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:27,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 55 [2024-11-19 00:36:27,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:27,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 48 [2024-11-19 00:36:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 108 proven. 72 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-19 00:36:27,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:36:27,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:27,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658889499] [2024-11-19 00:36:27,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658889499] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:27,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:27,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 18 [2024-11-19 00:36:27,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603457151] [2024-11-19 00:36:27,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:27,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:27,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:27,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:27,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:36:27,341 INFO L87 Difference]: Start difference. First operand 1110 states and 1546 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:27,686 INFO L93 Difference]: Finished difference Result 2110 states and 2954 transitions. [2024-11-19 00:36:27,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:36:27,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-19 00:36:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:27,690 INFO L225 Difference]: With dead ends: 2110 [2024-11-19 00:36:27,690 INFO L226 Difference]: Without dead ends: 1132 [2024-11-19 00:36:27,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:36:27,692 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 43 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:27,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 694 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:36:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-19 00:36:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1100. [2024-11-19 00:36:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 953 states have (on average 1.347324239244491) internal successors, (1284), 963 states have internal predecessors, (1284), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-19 00:36:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1536 transitions. [2024-11-19 00:36:27,732 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1536 transitions. Word has length 117 [2024-11-19 00:36:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:27,733 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1536 transitions. [2024-11-19 00:36:27,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1536 transitions. [2024-11-19 00:36:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:36:27,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:27,734 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:27,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 00:36:27,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:27,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:27,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash -185295277, now seen corresponding path program 1 times [2024-11-19 00:36:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488861688] [2024-11-19 00:36:27,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:27,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:27,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:27,939 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:27,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 00:36:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:28,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 00:36:28,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:28,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 00:36:28,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 00:36:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:36:30,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:36:31,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:31,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488861688] [2024-11-19 00:36:31,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488861688] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:31,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:31,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-11-19 00:36:31,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035997180] [2024-11-19 00:36:31,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:31,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:31,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:31,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:31,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:36:31,062 INFO L87 Difference]: Start difference. First operand 1100 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:31,480 INFO L93 Difference]: Finished difference Result 2938 states and 4112 transitions. [2024-11-19 00:36:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:31,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 00:36:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:31,490 INFO L225 Difference]: With dead ends: 2938 [2024-11-19 00:36:31,490 INFO L226 Difference]: Without dead ends: 1970 [2024-11-19 00:36:31,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:36:31,492 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 132 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:31,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 404 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:36:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2024-11-19 00:36:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1486. [2024-11-19 00:36:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1339 states have (on average 1.368185212845407) internal successors, (1832), 1349 states have internal predecessors, (1832), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-19 00:36:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2084 transitions. [2024-11-19 00:36:31,555 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2084 transitions. Word has length 118 [2024-11-19 00:36:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:31,555 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 2084 transitions. [2024-11-19 00:36:31,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2084 transitions. [2024-11-19 00:36:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:36:31,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:31,557 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:31,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:31,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:31,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:31,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash -994641903, now seen corresponding path program 1 times [2024-11-19 00:36:31,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:31,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419600570] [2024-11-19 00:36:31,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:31,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:31,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:31,760 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:31,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 00:36:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:31,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:36:31,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:31,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 00:36:31,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-11-19 00:36:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:36:31,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:31,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:31,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419600570] [2024-11-19 00:36:31,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419600570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:31,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:31,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:36:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718709824] [2024-11-19 00:36:31,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:31,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:31,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:31,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:31,988 INFO L87 Difference]: Start difference. First operand 1486 states and 2084 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:32,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:32,167 INFO L93 Difference]: Finished difference Result 3189 states and 4487 transitions. [2024-11-19 00:36:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:32,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 00:36:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:32,173 INFO L225 Difference]: With dead ends: 3189 [2024-11-19 00:36:32,174 INFO L226 Difference]: Without dead ends: 1845 [2024-11-19 00:36:32,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:32,176 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 111 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:32,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 885 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2024-11-19 00:36:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1771. [2024-11-19 00:36:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1552 states have (on average 1.3421391752577319) internal successors, (2083), 1569 states have internal predecessors, (2083), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 171 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-19 00:36:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2459 transitions. [2024-11-19 00:36:32,259 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2459 transitions. Word has length 118 [2024-11-19 00:36:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:32,259 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2459 transitions. [2024-11-19 00:36:32,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2459 transitions. [2024-11-19 00:36:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:36:32,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:32,262 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:32,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 00:36:32,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:32,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:32,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash -434022304, now seen corresponding path program 1 times [2024-11-19 00:36:32,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206819577] [2024-11-19 00:36:32,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:32,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:32,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:32,466 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:32,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 00:36:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:32,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:36:32,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:32,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 00:36:32,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-11-19 00:36:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:36:32,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:32,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:32,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206819577] [2024-11-19 00:36:32,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206819577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:32,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:32,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:36:32,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56475198] [2024-11-19 00:36:32,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:32,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:36:32,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:32,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:36:32,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:36:32,745 INFO L87 Difference]: Start difference. First operand 1771 states and 2459 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:33,135 INFO L93 Difference]: Finished difference Result 3498 states and 4860 transitions. [2024-11-19 00:36:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:36:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 00:36:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:33,141 INFO L225 Difference]: With dead ends: 3498 [2024-11-19 00:36:33,141 INFO L226 Difference]: Without dead ends: 1869 [2024-11-19 00:36:33,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:36:33,144 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:33,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 680 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:36:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2024-11-19 00:36:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1835. [2024-11-19 00:36:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1616 states have (on average 1.328589108910891) internal successors, (2147), 1633 states have internal predecessors, (2147), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 171 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-19 00:36:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2523 transitions. [2024-11-19 00:36:33,221 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2523 transitions. Word has length 118 [2024-11-19 00:36:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:33,222 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2523 transitions. [2024-11-19 00:36:33,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2523 transitions. [2024-11-19 00:36:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:36:33,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:33,224 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:33,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 00:36:33,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:33,425 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:33,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:33,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1020828318, now seen corresponding path program 1 times [2024-11-19 00:36:33,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:33,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144007895] [2024-11-19 00:36:33,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:33,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:33,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:33,428 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:33,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 00:36:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:33,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:36:33,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:34,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:34,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 55 [2024-11-19 00:36:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-19 00:36:36,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:36,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144007895] [2024-11-19 00:36:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144007895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:36:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959127502] [2024-11-19 00:36:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:36,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:36:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:36:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:36,370 INFO L87 Difference]: Start difference. First operand 1835 states and 2523 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:36:37,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:36:43,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:36:50,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:36:55,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:36:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:56,072 INFO L93 Difference]: Finished difference Result 3437 states and 4714 transitions. [2024-11-19 00:36:56,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:36:56,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-19 00:36:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:56,078 INFO L225 Difference]: With dead ends: 3437 [2024-11-19 00:36:56,078 INFO L226 Difference]: Without dead ends: 1744 [2024-11-19 00:36:56,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:56,083 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 278 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:56,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 544 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 2 Unknown, 0 Unchecked, 19.6s Time] [2024-11-19 00:36:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2024-11-19 00:36:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1584. [2024-11-19 00:36:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1382 states have (on average 1.3205499276411) internal successors, (1825), 1396 states have internal predecessors, (1825), 170 states have call successors, (170), 31 states have call predecessors, (170), 31 states have return successors, (170), 156 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-19 00:36:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2165 transitions. [2024-11-19 00:36:56,152 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2165 transitions. Word has length 118 [2024-11-19 00:36:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:56,153 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2165 transitions. [2024-11-19 00:36:56,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:36:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2165 transitions. [2024-11-19 00:36:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:36:56,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:56,154 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:56,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:56,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:56,355 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:56,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:56,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1503648465, now seen corresponding path program 1 times [2024-11-19 00:36:56,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:56,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782571226] [2024-11-19 00:36:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:56,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:56,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:56,357 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:56,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 00:36:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:56,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:36:56,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:56,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:36:56,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-11-19 00:36:56,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:56,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 42 [2024-11-19 00:36:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:36:56,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:56,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:56,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782571226] [2024-11-19 00:36:56,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782571226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:56,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:56,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:36:56,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111447394] [2024-11-19 00:36:56,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:56,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:56,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:56,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:56,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:56,670 INFO L87 Difference]: Start difference. First operand 1584 states and 2165 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:56,846 INFO L93 Difference]: Finished difference Result 3088 states and 4225 transitions. [2024-11-19 00:36:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 00:36:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:56,851 INFO L225 Difference]: With dead ends: 3088 [2024-11-19 00:36:56,851 INFO L226 Difference]: Without dead ends: 1650 [2024-11-19 00:36:56,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:56,853 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 88 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:56,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 927 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-11-19 00:36:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1648. [2024-11-19 00:36:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1442 states have (on average 1.3072122052704578) internal successors, (1885), 1456 states have internal predecessors, (1885), 170 states have call successors, (170), 35 states have call predecessors, (170), 35 states have return successors, (170), 156 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-19 00:36:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2225 transitions. [2024-11-19 00:36:56,932 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2225 transitions. Word has length 118 [2024-11-19 00:36:56,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:56,932 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2225 transitions. [2024-11-19 00:36:56,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:36:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2225 transitions. [2024-11-19 00:36:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:36:56,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:56,934 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:56,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 00:36:57,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:57,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:57,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:57,135 INFO L85 PathProgramCache]: Analyzing trace with hash 694301839, now seen corresponding path program 1 times [2024-11-19 00:36:57,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:57,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231628319] [2024-11-19 00:36:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:57,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:57,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:57,137 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:57,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 00:36:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:57,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 00:36:57,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:57,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 00:36:57,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 00:37:00,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:01,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 37 [2024-11-19 00:37:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:37:02,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:37:02,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:02,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231628319] [2024-11-19 00:37:02,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231628319] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:02,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:37:02,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2024-11-19 00:37:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972781531] [2024-11-19 00:37:02,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:37:02,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:37:02,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:37:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:37:02,831 INFO L87 Difference]: Start difference. First operand 1648 states and 2225 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:37:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:03,231 INFO L93 Difference]: Finished difference Result 3152 states and 4265 transitions. [2024-11-19 00:37:03,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:37:03,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 00:37:03,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:03,238 INFO L225 Difference]: With dead ends: 3152 [2024-11-19 00:37:03,238 INFO L226 Difference]: Without dead ends: 1650 [2024-11-19 00:37:03,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:37:03,240 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 77 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:03,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 507 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:37:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-11-19 00:37:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1404. [2024-11-19 00:37:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1236 states have (on average 1.3131067961165048) internal successors, (1623), 1244 states have internal predecessors, (1623), 134 states have call successors, (134), 33 states have call predecessors, (134), 33 states have return successors, (134), 126 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-19 00:37:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1891 transitions. [2024-11-19 00:37:03,317 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1891 transitions. Word has length 118 [2024-11-19 00:37:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:03,317 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1891 transitions. [2024-11-19 00:37:03,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:37:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1891 transitions. [2024-11-19 00:37:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:37:03,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:03,318 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:03,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:03,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:37:03,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:03,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:03,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1461470510, now seen corresponding path program 1 times [2024-11-19 00:37:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:03,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666181928] [2024-11-19 00:37:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:03,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:37:03,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:03,525 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:37:03,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 00:37:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:03,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:37:03,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:03,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:03,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 67 [2024-11-19 00:37:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 196 proven. 24 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 00:37:03,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:04,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:04,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 1 [2024-11-19 00:37:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-19 00:37:04,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:04,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666181928] [2024-11-19 00:37:04,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666181928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:37:04,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:37:04,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-19 00:37:04,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058397246] [2024-11-19 00:37:04,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:37:04,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:37:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:04,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:37:04,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:37:04,114 INFO L87 Difference]: Start difference. First operand 1404 states and 1891 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-19 00:37:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:04,987 INFO L93 Difference]: Finished difference Result 2190 states and 2920 transitions. [2024-11-19 00:37:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:37:04,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 118 [2024-11-19 00:37:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:04,992 INFO L225 Difference]: With dead ends: 2190 [2024-11-19 00:37:04,992 INFO L226 Difference]: Without dead ends: 763 [2024-11-19 00:37:04,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:37:04,995 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 107 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:04,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 662 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:37:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-19 00:37:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 743. [2024-11-19 00:37:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 653 states have (on average 1.2817764165390506) internal successors, (837), 655 states have internal predecessors, (837), 70 states have call successors, (70), 19 states have call predecessors, (70), 19 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-19 00:37:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 977 transitions. [2024-11-19 00:37:05,047 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 977 transitions. Word has length 118 [2024-11-19 00:37:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:05,047 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 977 transitions. [2024-11-19 00:37:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-19 00:37:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 977 transitions. [2024-11-19 00:37:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 00:37:05,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:05,049 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:05,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 00:37:05,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:37:05,250 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:05,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash 349099979, now seen corresponding path program 1 times [2024-11-19 00:37:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912505819] [2024-11-19 00:37:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:05,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:37:05,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:05,252 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:37:05,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 00:37:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:05,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:37:05,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:05,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 00:37:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 24 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-19 00:37:05,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-19 00:37:05,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:05,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912505819] [2024-11-19 00:37:05,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912505819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:37:05,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:37:05,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-19 00:37:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424458946] [2024-11-19 00:37:05,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:37:05,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:37:05,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:37:05,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:37:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:37:05,958 INFO L87 Difference]: Start difference. First operand 743 states and 977 transitions. Second operand has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 2 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:37:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:37:06,481 INFO L93 Difference]: Finished difference Result 1301 states and 1682 transitions. [2024-11-19 00:37:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:37:06,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 2 states have call predecessors, (23), 4 states have call successors, (23) Word has length 120 [2024-11-19 00:37:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:37:06,485 INFO L225 Difference]: With dead ends: 1301 [2024-11-19 00:37:06,485 INFO L226 Difference]: Without dead ends: 639 [2024-11-19 00:37:06,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:37:06,487 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 72 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:37:06,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 392 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:37:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-19 00:37:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 609. [2024-11-19 00:37:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 514 states have (on average 1.2295719844357977) internal successors, (632), 516 states have internal predecessors, (632), 70 states have call successors, (70), 24 states have call predecessors, (70), 24 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-19 00:37:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 772 transitions. [2024-11-19 00:37:06,528 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 772 transitions. Word has length 120 [2024-11-19 00:37:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:37:06,529 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 772 transitions. [2024-11-19 00:37:06,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 2 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-19 00:37:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 772 transitions. [2024-11-19 00:37:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 00:37:06,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:37:06,530 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:37:06,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-19 00:37:06,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:37:06,731 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:37:06,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:37:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1358607819, now seen corresponding path program 1 times [2024-11-19 00:37:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:37:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956199417] [2024-11-19 00:37:06,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:06,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:37:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:37:06,733 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:37:06,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 00:37:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:06,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 00:37:06,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:06,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 00:37:07,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 00:37:11,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:11,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 42 [2024-11-19 00:37:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:37:13,107 INFO L311 TraceCheckSpWp]: Computing backward predicates...