./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU --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 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:23,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:23,470 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:57:23,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:23,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:23,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:23,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:23,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:23,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:23,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:23,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:23,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:23,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:23,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:23,518 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:23,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:23,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:23,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:23,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:57:23,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:23,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:23,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:23,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:23,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:23,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:23,524 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:23,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:23,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:23,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:23,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:23,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:23,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:23,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:23,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:23,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:23,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:23,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:57:23,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:57:23,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:23,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:23,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:23,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:23,533 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 [2024-10-31 21:57:23,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:23,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:23,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:23,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:23,976 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:23,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i Unable to find full path for "g++" [2024-10-31 21:57:26,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:26,483 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:26,483 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2024-10-31 21:57:26,499 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/data/a32a5650e/ea07725f42714cf2a2cefee4261e6303/FLAG9558d2775 [2024-10-31 21:57:26,524 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/data/a32a5650e/ea07725f42714cf2a2cefee4261e6303 [2024-10-31 21:57:26,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:26,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:26,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:26,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:26,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:26,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:26" (1/1) ... [2024-10-31 21:57:26,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7b8f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:26, skipping insertion in model container [2024-10-31 21:57:26,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:26" (1/1) ... [2024-10-31 21:57:26,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:26,850 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2024-10-31 21:57:26,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:26,978 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:26,992 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2024-10-31 21:57:27,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:27,097 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:27,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27 WrapperNode [2024-10-31 21:57:27,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:27,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:27,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:27,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:27,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,210 INFO L138 Inliner]: procedures = 29, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580 [2024-10-31 21:57:27,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:27,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:27,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:27,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:27,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,267 INFO L175 MemorySlicer]: Split 152 memory accesses to 4 slices as follows [2, 37, 70, 43]. 46 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 20 writes are split as follows [0, 7, 5, 8]. [2024-10-31 21:57:27,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:27,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:27,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:27,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:27,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (1/1) ... [2024-10-31 21:57:27,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:27,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:27,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:27,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:57:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:57:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 21:57:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 21:57:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 21:57:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 21:57:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 21:57:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 21:57:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 21:57:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 21:57:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 21:57:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 21:57:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 21:57:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 21:57:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 21:57:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 21:57:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 21:57:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 21:57:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 21:57:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 21:57:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:27,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:57:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 21:57:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 21:57:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 21:57:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:27,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:27,621 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:27,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:28,420 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:28,421 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:28,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:28,444 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:57:28,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:28 BoogieIcfgContainer [2024-10-31 21:57:28,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:28,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:28,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:28,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:28,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:26" (1/3) ... [2024-10-31 21:57:28,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52224aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:28, skipping insertion in model container [2024-10-31 21:57:28,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:27" (2/3) ... [2024-10-31 21:57:28,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52224aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:28, skipping insertion in model container [2024-10-31 21:57:28,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:28" (3/3) ... [2024-10-31 21:57:28,461 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-74.i [2024-10-31 21:57:28,484 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:28,484 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:28,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:28,569 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;@40d8469c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:28,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.438095238095238) internal successors, (151), 106 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 21:57:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:57:28,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:28,594 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:28,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:28,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1858374721, now seen corresponding path program 1 times [2024-10-31 21:57:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:28,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755271686] [2024-10-31 21:57:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 21:57:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 21:57:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 21:57:29,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:29,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755271686] [2024-10-31 21:57:29,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755271686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:29,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:29,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961629663] [2024-10-31 21:57:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:29,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:29,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:29,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:29,337 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.438095238095238) internal successors, (151), 106 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:29,392 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2024-10-31 21:57:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:29,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-10-31 21:57:29,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:29,407 INFO L225 Difference]: With dead ends: 243 [2024-10-31 21:57:29,407 INFO L226 Difference]: Without dead ends: 121 [2024-10-31 21:57:29,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10-31 21:57:29,416 INFO L432 NwaCegarLoop]: 178 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, 178 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-10-31 21:57:29,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-31 21:57:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-31 21:57:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 21:57:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2024-10-31 21:57:29,492 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 150 [2024-10-31 21:57:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:29,492 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2024-10-31 21:57:29,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2024-10-31 21:57:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:57:29,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:29,497 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:29,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:57:29,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:29,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1041807627, now seen corresponding path program 1 times [2024-10-31 21:57:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:29,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147381897] [2024-10-31 21:57:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:29,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 21:57:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 21:57:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 21:57:30,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:30,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147381897] [2024-10-31 21:57:30,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147381897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:30,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:30,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:30,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776608888] [2024-10-31 21:57:30,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:30,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:30,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:30,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:30,091 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:30,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:30,163 INFO L93 Difference]: Finished difference Result 241 states and 356 transitions. [2024-10-31 21:57:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:30,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-10-31 21:57:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:30,166 INFO L225 Difference]: With dead ends: 241 [2024-10-31 21:57:30,170 INFO L226 Difference]: Without dead ends: 123 [2024-10-31 21:57:30,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-31 21:57:30,173 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:30,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-31 21:57:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-31 21:57:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 21:57:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-10-31 21:57:30,204 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 150 [2024-10-31 21:57:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:30,206 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-10-31 21:57:30,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-10-31 21:57:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:57:30,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:30,213 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:30,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:57:30,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:30,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash 991586419, now seen corresponding path program 1 times [2024-10-31 21:57:30,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:30,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706334839] [2024-10-31 21:57:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 21:57:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 21:57:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 21:57:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:31,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706334839] [2024-10-31 21:57:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706334839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:31,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:31,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008112262] [2024-10-31 21:57:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:31,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:31,190 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 21:57:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:31,451 INFO L93 Difference]: Finished difference Result 321 states and 475 transitions. [2024-10-31 21:57:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:31,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-31 21:57:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:31,455 INFO L225 Difference]: With dead ends: 321 [2024-10-31 21:57:31,456 INFO L226 Difference]: Without dead ends: 201 [2024-10-31 21:57:31,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-10-31 21:57:31,458 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 79 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:31,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 485 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-31 21:57:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 124. [2024-10-31 21:57:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 21:57:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-10-31 21:57:31,487 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 150 [2024-10-31 21:57:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:31,491 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-10-31 21:57:31,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 21:57:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-10-31 21:57:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:57:31,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:31,499 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:31,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:57:31,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:31,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:31,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1132135029, now seen corresponding path program 1 times [2024-10-31 21:57:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:31,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582182722] [2024-10-31 21:57:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:31,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 21:57:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 21:57:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 21:57:33,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582182722] [2024-10-31 21:57:33,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582182722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:33,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:33,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:57:33,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443506560] [2024-10-31 21:57:33,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:33,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:57:33,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:33,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:57:33,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:33,403 INFO L87 Difference]: Start difference. First operand 124 states and 181 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:33,972 INFO L93 Difference]: Finished difference Result 344 states and 502 transitions. [2024-10-31 21:57:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:57:33,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-10-31 21:57:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:33,977 INFO L225 Difference]: With dead ends: 344 [2024-10-31 21:57:33,979 INFO L226 Difference]: Without dead ends: 223 [2024-10-31 21:57:33,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:57:33,985 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 131 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:33,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1550 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 21:57:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-31 21:57:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2024-10-31 21:57:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 186 states have internal predecessors, (257), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-31 21:57:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 321 transitions. [2024-10-31 21:57:34,021 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 321 transitions. Word has length 150 [2024-10-31 21:57:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:34,024 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 321 transitions. [2024-10-31 21:57:34,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 321 transitions. [2024-10-31 21:57:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:57:34,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:34,028 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:34,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:57:34,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:34,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash 739108019, now seen corresponding path program 1 times [2024-10-31 21:57:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:34,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137411277] [2024-10-31 21:57:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:34,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:57:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:34,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:57:34,418 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:57:34,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 21:57:34,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:57:34,427 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-31 21:57:34,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:57:34,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:57:34 BoogieIcfgContainer [2024-10-31 21:57:34,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:57:34,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:57:34,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:57:34,597 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:57:34,597 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:28" (3/4) ... [2024-10-31 21:57:34,601 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:57:34,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:57:34,603 INFO L158 Benchmark]: Toolchain (without parser) took 8074.19ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 124.1MB in the beginning and 143.1MB in the end (delta: -18.9MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2024-10-31 21:57:34,604 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 161.5MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:34,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.75ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 106.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 21:57:34,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.46ms. Allocated memory is still 161.5MB. Free memory was 106.7MB in the beginning and 102.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:57:34,609 INFO L158 Benchmark]: Boogie Preprocessor took 101.75ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 96.9MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:57:34,610 INFO L158 Benchmark]: RCFGBuilder took 1132.75ms. Allocated memory was 161.5MB in the beginning and 207.6MB in the end (delta: 46.1MB). Free memory was 96.9MB in the beginning and 163.9MB in the end (delta: -67.1MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2024-10-31 21:57:34,610 INFO L158 Benchmark]: TraceAbstraction took 6145.33ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 162.9MB in the beginning and 144.1MB in the end (delta: 18.8MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-10-31 21:57:34,611 INFO L158 Benchmark]: Witness Printer took 6.27ms. Allocated memory is still 249.6MB. Free memory was 144.1MB in the beginning and 143.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:57:34,613 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.40ms. Allocated memory is still 161.5MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.75ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 106.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.46ms. Allocated memory is still 161.5MB. Free memory was 106.7MB in the beginning and 102.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.75ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 96.9MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1132.75ms. Allocated memory was 161.5MB in the beginning and 207.6MB in the end (delta: 46.1MB). Free memory was 96.9MB in the beginning and 163.9MB in the end (delta: -67.1MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6145.33ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 162.9MB in the beginning and 144.1MB in the end (delta: 18.8MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Witness Printer took 6.27ms. Allocated memory is still 249.6MB. Free memory was 144.1MB in the beginning and 143.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {1, 1} }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L25-L27] double double_Array_0[5] = { 9.3, 100.5, 31.6, 3.779, 63.25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 1, 128, 3150951169, 64, 25 }; [L31] unsigned char last_1_BOOL_unsigned_char_Array_0_1__0_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L96] EXPR BOOL_unsigned_char_Array_0[1][0] [L96] last_1_BOOL_unsigned_char_Array_0_1__0_ = BOOL_unsigned_char_Array_0[1][0] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L66] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L67] EXPR 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] EXPR 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L69] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L72] double_Array_0[0] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[0] [L73] 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L73] EXPR double_Array_0[0] [L73] 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L73] 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L74] double_Array_0[1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L76] double_Array_0[2] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[2] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F [L77] EXPR double_Array_0[2] [L77] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L78] double_Array_0[3] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR (double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR (double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L79] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854776000e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854776000e+12F && double_Array_0[3] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L80] double_Array_0[4] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[4] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F [L81] EXPR double_Array_0[4] [L81] EXPR double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR (double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] EXPR (double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not((double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not((double_Array_0[4] >= -922337.2036854776000e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854776000e+12F && double_Array_0[4] >= 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L82] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] EXPR unsigned_long_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L85] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] EXPR unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L88] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 2147483647) 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 4294967294) 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L91] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L92] EXPR unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L92] RET assume_abort_if_not(unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] EXPR unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L107] RET updateVariables() [L108] CALL step() [L35] unsigned char stepLocal_0 = last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_; [L36] EXPR double_Array_0[1] [L36] 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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L36] COND TRUE (double_Array_0[1] > double_Array_0[0]) || stepLocal_0 [L37] EXPR BOOL_unsigned_char_Array_0[0][1] [L37] BOOL_unsigned_char_Array_0[0][0] = BOOL_unsigned_char_Array_0[0][1] [L41] EXPR BOOL_unsigned_char_Array_0[0][0] [L41] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[0][0]; [L42] stepLocal_1 && BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L42] stepLocal_1 && BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L42] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0][0]) [L49] EXPR BOOL_unsigned_char_Array_0[1][1] [L49] BOOL_unsigned_char_Array_0[1][0] = BOOL_unsigned_char_Array_0[1][1] [L51] EXPR double_Array_0[4] [L51] EXPR double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) [L51] EXPR double_Array_0[4] [L51] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) [L51] EXPR double_Array_0[2] [L51] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] EXPR double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L51] COND FALSE !(((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) [L54] EXPR double_Array_0[4] [L54] EXPR double_Array_0[3] [L54] EXPR double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L54] COND FALSE !(double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) [L61] EXPR unsigned_long_int_Array_0[3] [L61] unsigned_long_int_Array_0[4] = unsigned_long_int_Array_0[3] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR double_Array_0[4] [L99] EXPR double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3]) [L99] EXPR double_Array_0[4] [L99] EXPR ((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]) [L99] EXPR double_Array_0[2] [L99] EXPR ((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR double_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) [L99] EXPR unsigned_long_int_Array_0[4] [L99] EXPR unsigned_long_int_Array_0[3] [L99] EXPR unsigned_long_int_Array_0[2] [L99] EXPR unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])) [L99] EXPR unsigned_long_int_Array_0[2] [L99] EXPR unsigned_long_int_Array_0[1] [L99] EXPR ((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_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_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR ((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99] EXPR (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__0_=1, unsigned_long_int_Array_0={6:0}] [L99-L100] return (((((((((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) < (double_Array_0[2])) ? (((((double_Array_0[4]) > (double_Array_0[3])) ? (double_Array_0[4]) : (double_Array_0[3])))) : (double_Array_0[2]))) < double_Array_0[1]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) ((((unsigned_long_int_Array_0[3]) > ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1]))) ? (unsigned_long_int_Array_0[3]) : ((unsigned_long_int_Array_0[2] - unsigned_long_int_Array_0[1])))))) : ((double_Array_0[4] >= (double_Array_0[3] + double_Array_0[1])) ? ((double_Array_0[2] > (- double_Array_0[1])) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[0]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3])))) && (((double_Array_0[1] > double_Array_0[0]) || (last_1_BOOL_unsigned_char_Array_0_1__0_ && last_1_BOOL_unsigned_char_Array_0_1__0_)) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && (! BOOL_unsigned_char_Array_0[1][1])))))) && ((BOOL_unsigned_char_Array_0[0][0] && BOOL_unsigned_char_Array_0[0][0]) ? ((double_Array_0[2] < (- double_Array_0[1])) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1])) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) ; [L109] RET, EXPR property() [L109] 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_1__0_=1, unsigned_long_int_Array_0={6: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_1__0_=1, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 2730 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1937 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 793 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=4, InterpolantAutomatonStates: 18, 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, 4 MinimizatonAttempts, 80 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2176/2176 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-10-31 21:57:34,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU --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 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:37,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:37,529 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 21:57:37,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:37,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:37,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:37,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:37,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:37,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:37,563 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:37,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:37,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:37,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:37,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:37,566 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:37,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:37,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:37,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:37,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:37,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:37,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:37,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:37,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:37,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:57:37,570 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 21:57:37,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:37,571 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 21:57:37,572 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:37,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:37,573 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:37,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:37,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:37,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:37,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:37,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:37,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:37,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:37,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:37,576 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 21:57:37,576 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 21:57:37,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:37,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:37,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:37,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:37,582 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 21:57:37,582 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 86c6ed269b3d899978c3173e5263b88b1f8330576859919cd0c5761f3ad77759 [2024-10-31 21:57:38,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:38,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:38,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:38,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:38,257 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:38,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i Unable to find full path for "g++" [2024-10-31 21:57:40,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:40,854 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:40,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i [2024-10-31 21:57:40,872 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/data/6845965f6/e3f2ec1bc9ce42b6a5770a645ba248b6/FLAG022d945c4 [2024-10-31 21:57:41,161 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/data/6845965f6/e3f2ec1bc9ce42b6a5770a645ba248b6 [2024-10-31 21:57:41,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:41,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:41,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:41,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:41,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:41,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da86c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41, skipping insertion in model container [2024-10-31 21:57:41,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:41,439 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2024-10-31 21:57:41,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:41,540 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:41,571 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-74.i[916,929] [2024-10-31 21:57:41,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:41,679 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:41,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41 WrapperNode [2024-10-31 21:57:41,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:41,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:41,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:41,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:41,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,753 INFO L138 Inliner]: procedures = 33, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580 [2024-10-31 21:57:41,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:41,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:41,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:41,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:41,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,799 INFO L175 MemorySlicer]: Split 152 memory accesses to 4 slices as follows [2, 37, 70, 43]. 46 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 20 writes are split as follows [0, 7, 5, 8]. [2024-10-31 21:57:41,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:41,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:41,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:41,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:41,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (1/1) ... [2024-10-31 21:57:41,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:41,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:41,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:41,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-31 21:57:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-31 21:57:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-31 21:57:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-31 21:57:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-31 21:57:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-31 21:57:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-31 21:57:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-31 21:57:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-31 21:57:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-31 21:57:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-31 21:57:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-31 21:57:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 21:57:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 21:57:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-31 21:57:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-31 21:57:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-31 21:57:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-31 21:57:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-31 21:57:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-31 21:57:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-31 21:57:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-31 21:57:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-31 21:57:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-31 21:57:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-31 21:57:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-31 21:57:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-31 21:57:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-31 21:57:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-31 21:57:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-31 21:57:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-31 21:57:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-31 21:57:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-31 21:57:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-31 21:57:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-31 21:57:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-31 21:57:42,157 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:42,160 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:44,117 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:44,117 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:44,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:44,140 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:57:44,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:44 BoogieIcfgContainer [2024-10-31 21:57:44,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:44,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:44,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:44,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:44,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:41" (1/3) ... [2024-10-31 21:57:44,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e7f3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:44, skipping insertion in model container [2024-10-31 21:57:44,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:41" (2/3) ... [2024-10-31 21:57:44,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e7f3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:44, skipping insertion in model container [2024-10-31 21:57:44,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:44" (3/3) ... [2024-10-31 21:57:44,163 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-74.i [2024-10-31 21:57:44,182 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:44,183 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:44,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:44,275 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;@3c5beb29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:44,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 105 states have (on average 1.438095238095238) internal successors, (151), 106 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 21:57:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:57:44,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:44,304 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:44,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:44,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1858374721, now seen corresponding path program 1 times [2024-10-31 21:57:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:57:44,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074893169] [2024-10-31 21:57:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:44,324 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-10-31 21:57:44,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:57:44,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:44,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 21:57:44,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-31 21:57:44,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:57:44,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 21:57:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074893169] [2024-10-31 21:57:44,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074893169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:44,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715335948] [2024-10-31 21:57:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 21:57:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:45,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:45,034 INFO L87 Difference]: Start difference. First operand has 125 states, 105 states have (on average 1.438095238095238) internal successors, (151), 106 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:45,072 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2024-10-31 21:57:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:45,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-10-31 21:57:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:45,082 INFO L225 Difference]: With dead ends: 243 [2024-10-31 21:57:45,082 INFO L226 Difference]: Without dead ends: 121 [2024-10-31 21:57:45,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-10-31 21:57:45,093 INFO L432 NwaCegarLoop]: 178 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, 178 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-10-31 21:57:45,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-31 21:57:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-31 21:57:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 21:57:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2024-10-31 21:57:45,152 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 150 [2024-10-31 21:57:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:45,153 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2024-10-31 21:57:45,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2024-10-31 21:57:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:57:45,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:45,157 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:45,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:45,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:45,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:45,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1041807627, now seen corresponding path program 1 times [2024-10-31 21:57:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:57:45,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462922574] [2024-10-31 21:57:45,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:45,361 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-10-31 21:57:45,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:57:45,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:45,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 21:57:45,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-31 21:57:45,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:57:45,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 21:57:45,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462922574] [2024-10-31 21:57:45,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462922574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:45,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:45,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:45,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760445131] [2024-10-31 21:57:45,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:45,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:45,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 21:57:45,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:45,968 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:46,071 INFO L93 Difference]: Finished difference Result 241 states and 356 transitions. [2024-10-31 21:57:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:46,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-10-31 21:57:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:46,075 INFO L225 Difference]: With dead ends: 241 [2024-10-31 21:57:46,075 INFO L226 Difference]: Without dead ends: 123 [2024-10-31 21:57:46,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 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-10-31 21:57:46,077 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:46,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-31 21:57:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-31 21:57:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 21:57:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-10-31 21:57:46,105 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 150 [2024-10-31 21:57:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:46,109 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-10-31 21:57:46,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 21:57:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-10-31 21:57:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:57:46,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:46,114 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:46,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:46,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:46,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:46,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 991586419, now seen corresponding path program 1 times [2024-10-31 21:57:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:57:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336975515] [2024-10-31 21:57:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:46,317 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-10-31 21:57:46,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:57:46,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:46,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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 (4)] Waiting until timeout for monitored process [2024-10-31 21:57:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 21:57:46,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 21:57:46,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:57:46,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 21:57:46,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336975515] [2024-10-31 21:57:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336975515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119230810] [2024-10-31 21:57:46,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 21:57:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:46,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:46,980 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 21:57:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:47,200 INFO L93 Difference]: Finished difference Result 244 states and 359 transitions. [2024-10-31 21:57:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:47,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-31 21:57:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:47,214 INFO L225 Difference]: With dead ends: 244 [2024-10-31 21:57:47,216 INFO L226 Difference]: Without dead ends: 124 [2024-10-31 21:57:47,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 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-10-31 21:57:47,221 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:47,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-31 21:57:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-31 21:57:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 21:57:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-10-31 21:57:47,246 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 150 [2024-10-31 21:57:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:47,251 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-10-31 21:57:47,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 21:57:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-10-31 21:57:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:57:47,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:47,256 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:57:47,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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 (4)] Ended with exit code 0 [2024-10-31 21:57:47,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:47,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:47,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1132135029, now seen corresponding path program 1 times [2024-10-31 21:57:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:57:47,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579696931] [2024-10-31 21:57:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:47,460 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-10-31 21:57:47,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:57:47,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:47,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79b2b4fa-378b-40ed-85b2-286faf65af63/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 21:57:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-31 21:57:48,080 INFO L278 TraceCheckSpWp]: Computing forward predicates...