./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB --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 fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:49:20,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:49:20,397 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 19:49:20,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:49:20,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:49:20,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:49:20,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:49:20,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:49:20,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:49:20,429 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:49:20,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:49:20,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:49:20,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:49:20,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:49:20,430 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:49:20,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:49:20,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:49:20,430 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:49:20,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:49:20,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:49:20,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:49:20,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:49:20,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:49:20,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:49:20,435 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:49:20,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:49:20,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:49:20,435 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:49:20,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:49:20,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:49:20,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:49:20,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:49:20,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:49:20,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:49:20,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:49:20,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:49:20,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:49:20,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:49:20,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:49:20,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:49:20,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:49:20,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:49:20,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:49:20,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:49:20,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:49:20,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:49:20,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:49:20,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:49:20,439 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB 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 -> fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b [2024-11-27 19:49:20,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:49:20,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:49:20,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:49:20,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:49:20,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:49:20,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-11-27 19:49:23,961 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data/302810bb4/dbb07731fb9948af81c8845a1c36c16c/FLAGd1cecc983 [2024-11-27 19:49:24,283 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:49:24,284 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-11-27 19:49:24,302 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data/302810bb4/dbb07731fb9948af81c8845a1c36c16c/FLAGd1cecc983 [2024-11-27 19:49:24,327 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data/302810bb4/dbb07731fb9948af81c8845a1c36c16c [2024-11-27 19:49:24,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:49:24,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:49:24,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:49:24,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:49:24,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:49:24,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f6ad4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24, skipping insertion in model container [2024-11-27 19:49:24,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:49:24,560 WARN L250 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_cb60547d-8843-494c-bf93-d2171a26281a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-11-27 19:49:24,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:49:24,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:49:24,719 WARN L250 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_cb60547d-8843-494c-bf93-d2171a26281a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-11-27 19:49:24,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:49:24,853 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:49:24,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24 WrapperNode [2024-11-27 19:49:24,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:49:24,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:49:24,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:49:24,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:49:24,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,948 INFO L138 Inliner]: procedures = 29, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2024-11-27 19:49:24,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:49:24,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:49:24,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:49:24,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:49:24,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:24,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:25,014 INFO L175 MemorySlicer]: Split 150 memory accesses to 7 slices as follows [2, 36, 8, 27, 3, 47, 27]. 31 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 3, 1, 4, 2]. The 20 writes are split as follows [0, 6, 1, 3, 1, 5, 4]. [2024-11-27 19:49:25,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:25,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:25,064 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:25,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:25,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:25,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:25,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:25,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:49:25,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:49:25,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:49:25,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:49:25,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (1/1) ... [2024-11-27 19:49:25,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:49:25,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:49:25,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:49:25,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:49:25,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:49:25,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-27 19:49:25,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-27 19:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-27 19:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-27 19:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-27 19:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-27 19:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-27 19:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 19:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 19:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 19:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-27 19:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-27 19:49:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-27 19:49:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-27 19:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-27 19:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-27 19:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-27 19:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-27 19:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-27 19:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-27 19:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-27 19:49:25,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 19:49:25,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-27 19:49:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 19:49:25,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-27 19:49:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:49:25,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:49:25,471 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:49:25,473 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:49:26,333 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-11-27 19:49:26,333 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:49:26,350 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:49:26,351 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 19:49:26,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:49:26 BoogieIcfgContainer [2024-11-27 19:49:26,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:49:26,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:49:26,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:49:26,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:49:26,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:49:24" (1/3) ... [2024-11-27 19:49:26,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185e9067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:49:26, skipping insertion in model container [2024-11-27 19:49:26,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:49:24" (2/3) ... [2024-11-27 19:49:26,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185e9067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:49:26, skipping insertion in model container [2024-11-27 19:49:26,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:49:26" (3/3) ... [2024-11-27 19:49:26,366 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2024-11-27 19:49:26,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:49:26,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-14.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 19:49:26,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:49:26,481 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;@574147ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:49:26,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:49:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-27 19:49:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:49:26,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:26,507 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:26,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1214119564, now seen corresponding path program 1 times [2024-11-27 19:49:26,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:26,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76409013] [2024-11-27 19:49:26,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-27 19:49:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76409013] [2024-11-27 19:49:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76409013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:49:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044098574] [2024-11-27 19:49:26,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:26,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:49:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:49:26,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:49:26,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 19:49:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:27,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 19:49:27,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:49:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-27 19:49:27,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:49:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044098574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:27,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 19:49:27,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-27 19:49:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762563994] [2024-11-27 19:49:27,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:27,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 19:49:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:27,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 19:49:27,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:49:27,571 INFO L87 Difference]: Start difference. First operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:27,615 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-27 19:49:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 19:49:27,618 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-27 19:49:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:27,630 INFO L225 Difference]: With dead ends: 249 [2024-11-27 19:49:27,630 INFO L226 Difference]: Without dead ends: 124 [2024-11-27 19:49:27,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:49:27,642 INFO L435 NwaCegarLoop]: 183 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, 183 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:27,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:49:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-27 19:49:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-27 19:49:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-27 19:49:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-27 19:49:27,687 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-27 19:49:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:27,688 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-27 19:49:27,688 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-27 19:49:27,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:49:27,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:27,693 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:27,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 19:49:27,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-27 19:49:27,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:27,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1352198634, now seen corresponding path program 1 times [2024-11-27 19:49:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:27,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539560386] [2024-11-27 19:49:27,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:27,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:28,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:28,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539560386] [2024-11-27 19:49:28,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539560386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:28,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:28,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:49:28,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310235573] [2024-11-27 19:49:28,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:28,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:49:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:28,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:49:28,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:49:28,445 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:28,519 INFO L93 Difference]: Finished difference Result 247 states and 366 transitions. [2024-11-27 19:49:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:49:28,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-27 19:49:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:28,524 INFO L225 Difference]: With dead ends: 247 [2024-11-27 19:49:28,527 INFO L226 Difference]: Without dead ends: 126 [2024-11-27 19:49:28,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:49:28,529 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 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-11-27 19:49:28,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:49:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-27 19:49:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-27 19:49:28,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-27 19:49:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-27 19:49:28,553 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 168 [2024-11-27 19:49:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:28,555 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-27 19:49:28,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-27 19:49:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:49:28,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:28,559 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:28,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:49:28,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:28,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:28,560 INFO L85 PathProgramCache]: Analyzing trace with hash -214559316, now seen corresponding path program 1 times [2024-11-27 19:49:28,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:28,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799734122] [2024-11-27 19:49:28,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:28,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:28,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799734122] [2024-11-27 19:49:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799734122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:28,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:28,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:49:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815267180] [2024-11-27 19:49:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:28,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:49:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:28,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:49:28,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:49:28,952 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:29,006 INFO L93 Difference]: Finished difference Result 252 states and 372 transitions. [2024-11-27 19:49:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:49:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:49:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:29,010 INFO L225 Difference]: With dead ends: 252 [2024-11-27 19:49:29,010 INFO L226 Difference]: Without dead ends: 129 [2024-11-27 19:49:29,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:49:29,012 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:29,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 530 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:49:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-27 19:49:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-27 19:49:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-27 19:49:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 188 transitions. [2024-11-27 19:49:29,026 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 188 transitions. Word has length 168 [2024-11-27 19:49:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:29,027 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 188 transitions. [2024-11-27 19:49:29,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 188 transitions. [2024-11-27 19:49:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:49:29,030 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:29,031 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:29,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:49:29,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:29,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash 603089134, now seen corresponding path program 1 times [2024-11-27 19:49:29,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:29,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955207035] [2024-11-27 19:49:29,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:29,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:29,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955207035] [2024-11-27 19:49:29,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955207035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:29,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:49:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416555742] [2024-11-27 19:49:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:29,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:49:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:29,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:49:29,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:49:29,586 INFO L87 Difference]: Start difference. First operand 129 states and 188 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:29,866 INFO L93 Difference]: Finished difference Result 382 states and 559 transitions. [2024-11-27 19:49:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:49:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:49:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:29,869 INFO L225 Difference]: With dead ends: 382 [2024-11-27 19:49:29,869 INFO L226 Difference]: Without dead ends: 256 [2024-11-27 19:49:29,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:49:29,874 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 180 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:29,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 496 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:49:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-27 19:49:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2024-11-27 19:49:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 183 states have (on average 1.360655737704918) internal successors, (249), 183 states have internal predecessors, (249), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:49:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 333 transitions. [2024-11-27 19:49:29,915 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 333 transitions. Word has length 168 [2024-11-27 19:49:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:29,916 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 333 transitions. [2024-11-27 19:49:29,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 333 transitions. [2024-11-27 19:49:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:49:29,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:29,919 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:29,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:49:29,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:29,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash 469075628, now seen corresponding path program 1 times [2024-11-27 19:49:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:29,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825620898] [2024-11-27 19:49:29,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825620898] [2024-11-27 19:49:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825620898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:49:31,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792695607] [2024-11-27 19:49:31,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:49:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:31,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:49:31,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:49:31,095 INFO L87 Difference]: Start difference. First operand 228 states and 333 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:31,397 INFO L93 Difference]: Finished difference Result 364 states and 533 transitions. [2024-11-27 19:49:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:49:31,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:49:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:31,402 INFO L225 Difference]: With dead ends: 364 [2024-11-27 19:49:31,404 INFO L226 Difference]: Without dead ends: 232 [2024-11-27 19:49:31,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:49:31,406 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 179 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:31,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 423 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:49:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-27 19:49:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2024-11-27 19:49:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 185 states have internal predecessors, (251), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:49:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 335 transitions. [2024-11-27 19:49:31,453 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 335 transitions. Word has length 168 [2024-11-27 19:49:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:31,453 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 335 transitions. [2024-11-27 19:49:31,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 335 transitions. [2024-11-27 19:49:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:49:31,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:31,457 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:31,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:49:31,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:31,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1480192878, now seen corresponding path program 1 times [2024-11-27 19:49:31,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102694251] [2024-11-27 19:49:31,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:32,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102694251] [2024-11-27 19:49:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102694251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:32,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:32,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:49:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066133605] [2024-11-27 19:49:32,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:32,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:49:32,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:32,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:49:32,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:49:32,142 INFO L87 Difference]: Start difference. First operand 230 states and 335 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:32,422 INFO L93 Difference]: Finished difference Result 472 states and 689 transitions. [2024-11-27 19:49:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:49:32,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:49:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:32,426 INFO L225 Difference]: With dead ends: 472 [2024-11-27 19:49:32,426 INFO L226 Difference]: Without dead ends: 345 [2024-11-27 19:49:32,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:49:32,428 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 143 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:32,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1035 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:49:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-27 19:49:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 240. [2024-11-27 19:49:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.358974358974359) internal successors, (265), 195 states have internal predecessors, (265), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:49:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 349 transitions. [2024-11-27 19:49:32,458 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 349 transitions. Word has length 168 [2024-11-27 19:49:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:32,458 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 349 transitions. [2024-11-27 19:49:32,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 349 transitions. [2024-11-27 19:49:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:49:32,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:32,461 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:32,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:49:32,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:32,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash -810788050, now seen corresponding path program 1 times [2024-11-27 19:49:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:32,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452398334] [2024-11-27 19:49:32,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:33,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452398334] [2024-11-27 19:49:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452398334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:33,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:33,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:49:33,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972633849] [2024-11-27 19:49:33,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:33,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:49:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:33,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:49:33,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:49:33,401 INFO L87 Difference]: Start difference. First operand 240 states and 349 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:33,908 INFO L93 Difference]: Finished difference Result 506 states and 737 transitions. [2024-11-27 19:49:33,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:49:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:49:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:33,911 INFO L225 Difference]: With dead ends: 506 [2024-11-27 19:49:33,911 INFO L226 Difference]: Without dead ends: 367 [2024-11-27 19:49:33,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:49:33,916 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 467 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:33,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 492 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 19:49:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-27 19:49:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 236. [2024-11-27 19:49:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 191 states have (on average 1.3350785340314135) internal successors, (255), 191 states have internal predecessors, (255), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:49:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 339 transitions. [2024-11-27 19:49:33,955 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 339 transitions. Word has length 168 [2024-11-27 19:49:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:33,955 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 339 transitions. [2024-11-27 19:49:33,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 339 transitions. [2024-11-27 19:49:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-27 19:49:33,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:33,959 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:33,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:49:33,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:33,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash -684748057, now seen corresponding path program 1 times [2024-11-27 19:49:33,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:33,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321677984] [2024-11-27 19:49:33,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:37,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:37,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321677984] [2024-11-27 19:49:37,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321677984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:37,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:37,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 19:49:37,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258825003] [2024-11-27 19:49:37,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:37,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 19:49:37,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:37,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 19:49:37,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:49:37,048 INFO L87 Difference]: Start difference. First operand 236 states and 339 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-27 19:49:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:39,261 INFO L93 Difference]: Finished difference Result 841 states and 1196 transitions. [2024-11-27 19:49:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 19:49:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 170 [2024-11-27 19:49:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:39,266 INFO L225 Difference]: With dead ends: 841 [2024-11-27 19:49:39,266 INFO L226 Difference]: Without dead ends: 711 [2024-11-27 19:49:39,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2024-11-27 19:49:39,268 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1191 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:39,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 1875 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 19:49:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-27 19:49:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 384. [2024-11-27 19:49:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 324 states have (on average 1.3487654320987654) internal successors, (437), 325 states have internal predecessors, (437), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:49:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 547 transitions. [2024-11-27 19:49:39,343 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 547 transitions. Word has length 170 [2024-11-27 19:49:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:39,343 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 547 transitions. [2024-11-27 19:49:39,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-27 19:49:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 547 transitions. [2024-11-27 19:49:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-27 19:49:39,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:39,346 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:39,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 19:49:39,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:39,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1273137001, now seen corresponding path program 1 times [2024-11-27 19:49:39,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:39,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563472710] [2024-11-27 19:49:39,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:39,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563472710] [2024-11-27 19:49:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563472710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:39,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:39,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:49:39,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580368287] [2024-11-27 19:49:39,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:39,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:49:39,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:39,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:49:39,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:49:39,852 INFO L87 Difference]: Start difference. First operand 384 states and 547 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:40,120 INFO L93 Difference]: Finished difference Result 934 states and 1327 transitions. [2024-11-27 19:49:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:49:40,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-11-27 19:49:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:40,127 INFO L225 Difference]: With dead ends: 934 [2024-11-27 19:49:40,127 INFO L226 Difference]: Without dead ends: 656 [2024-11-27 19:49:40,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:49:40,129 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 171 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:40,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 688 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:49:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-27 19:49:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 399. [2024-11-27 19:49:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 339 states have (on average 1.3185840707964602) internal successors, (447), 340 states have internal predecessors, (447), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:49:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 557 transitions. [2024-11-27 19:49:40,215 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 557 transitions. Word has length 172 [2024-11-27 19:49:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:40,215 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 557 transitions. [2024-11-27 19:49:40,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 557 transitions. [2024-11-27 19:49:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-27 19:49:40,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:40,218 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:40,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 19:49:40,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:40,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:40,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1360764777, now seen corresponding path program 1 times [2024-11-27 19:49:40,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:40,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102311499] [2024-11-27 19:49:40,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:40,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:42,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102311499] [2024-11-27 19:49:42,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102311499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:42,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:42,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:49:42,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195303465] [2024-11-27 19:49:42,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:42,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:49:42,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:42,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:49:42,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:49:42,348 INFO L87 Difference]: Start difference. First operand 399 states and 557 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:42,945 INFO L93 Difference]: Finished difference Result 672 states and 941 transitions. [2024-11-27 19:49:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:49:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2024-11-27 19:49:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:42,948 INFO L225 Difference]: With dead ends: 672 [2024-11-27 19:49:42,948 INFO L226 Difference]: Without dead ends: 405 [2024-11-27 19:49:42,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:49:42,953 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 137 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:42,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1251 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 19:49:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-27 19:49:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 361. [2024-11-27 19:49:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 301 states have (on average 1.3289036544850499) internal successors, (400), 302 states have internal predecessors, (400), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:49:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 510 transitions. [2024-11-27 19:49:43,037 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 510 transitions. Word has length 172 [2024-11-27 19:49:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:43,038 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 510 transitions. [2024-11-27 19:49:43,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 510 transitions. [2024-11-27 19:49:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-27 19:49:43,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:43,044 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:43,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 19:49:43,045 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:43,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1344773922, now seen corresponding path program 1 times [2024-11-27 19:49:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:43,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128930381] [2024-11-27 19:49:43,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:44,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128930381] [2024-11-27 19:49:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128930381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:44,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:49:44,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538379582] [2024-11-27 19:49:44,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:44,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:49:44,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:44,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:49:44,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:49:44,891 INFO L87 Difference]: Start difference. First operand 361 states and 510 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:45,315 INFO L93 Difference]: Finished difference Result 784 states and 1100 transitions. [2024-11-27 19:49:45,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:49:45,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 175 [2024-11-27 19:49:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:45,321 INFO L225 Difference]: With dead ends: 784 [2024-11-27 19:49:45,321 INFO L226 Difference]: Without dead ends: 536 [2024-11-27 19:49:45,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-27 19:49:45,323 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 91 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:45,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1281 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:49:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-27 19:49:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 414. [2024-11-27 19:49:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 354 states have (on average 1.3333333333333333) internal successors, (472), 355 states have internal predecessors, (472), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:49:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 582 transitions. [2024-11-27 19:49:45,390 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 582 transitions. Word has length 175 [2024-11-27 19:49:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:45,391 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 582 transitions. [2024-11-27 19:49:45,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 582 transitions. [2024-11-27 19:49:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-27 19:49:45,394 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:45,395 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:45,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 19:49:45,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:45,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash -91338530, now seen corresponding path program 1 times [2024-11-27 19:49:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:45,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867666212] [2024-11-27 19:49:45,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:45,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:46,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:46,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867666212] [2024-11-27 19:49:46,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867666212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:46,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:46,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:49:46,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395195437] [2024-11-27 19:49:46,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:46,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:49:46,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:46,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:49:46,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:49:46,983 INFO L87 Difference]: Start difference. First operand 414 states and 582 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:47,552 INFO L93 Difference]: Finished difference Result 833 states and 1165 transitions. [2024-11-27 19:49:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:49:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 175 [2024-11-27 19:49:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:47,558 INFO L225 Difference]: With dead ends: 833 [2024-11-27 19:49:47,559 INFO L226 Difference]: Without dead ends: 542 [2024-11-27 19:49:47,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-27 19:49:47,561 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 90 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:47,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1471 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 19:49:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-27 19:49:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 423. [2024-11-27 19:49:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 363 states have (on average 1.325068870523416) internal successors, (481), 364 states have internal predecessors, (481), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:49:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 591 transitions. [2024-11-27 19:49:47,632 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 591 transitions. Word has length 175 [2024-11-27 19:49:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:47,633 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 591 transitions. [2024-11-27 19:49:47,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 591 transitions. [2024-11-27 19:49:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 19:49:47,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:47,636 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:47,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 19:49:47,637 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:47,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:47,637 INFO L85 PathProgramCache]: Analyzing trace with hash -513157732, now seen corresponding path program 1 times [2024-11-27 19:49:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:47,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025058102] [2024-11-27 19:49:47,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:48,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:48,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025058102] [2024-11-27 19:49:48,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025058102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:48,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:48,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:49:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964146440] [2024-11-27 19:49:48,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:48,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:49:48,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:48,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:49:48,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:49:48,095 INFO L87 Difference]: Start difference. First operand 423 states and 591 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:48,448 INFO L93 Difference]: Finished difference Result 961 states and 1345 transitions. [2024-11-27 19:49:48,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:49:48,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-27 19:49:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:48,467 INFO L225 Difference]: With dead ends: 961 [2024-11-27 19:49:48,468 INFO L226 Difference]: Without dead ends: 664 [2024-11-27 19:49:48,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:49:48,469 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 140 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:48,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 667 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:49:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-11-27 19:49:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 491. [2024-11-27 19:49:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 431 states have (on average 1.3109048723897911) internal successors, (565), 432 states have internal predecessors, (565), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:49:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 675 transitions. [2024-11-27 19:49:48,559 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 675 transitions. Word has length 177 [2024-11-27 19:49:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:48,559 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 675 transitions. [2024-11-27 19:49:48,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 675 transitions. [2024-11-27 19:49:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 19:49:48,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:48,563 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:48,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 19:49:48,563 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:48,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 187906846, now seen corresponding path program 1 times [2024-11-27 19:49:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:48,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898733264] [2024-11-27 19:49:48,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898733264] [2024-11-27 19:49:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898733264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:48,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:48,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:49:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476243468] [2024-11-27 19:49:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:48,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:49:48,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:48,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:49:48,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:49:48,765 INFO L87 Difference]: Start difference. First operand 491 states and 675 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:48,882 INFO L93 Difference]: Finished difference Result 849 states and 1175 transitions. [2024-11-27 19:49:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:49:48,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-27 19:49:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:48,887 INFO L225 Difference]: With dead ends: 849 [2024-11-27 19:49:48,887 INFO L226 Difference]: Without dead ends: 503 [2024-11-27 19:49:48,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:49:48,889 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:48,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:49:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-27 19:49:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 497. [2024-11-27 19:49:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 437 states have (on average 1.3066361556064072) internal successors, (571), 438 states have internal predecessors, (571), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:49:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 681 transitions. [2024-11-27 19:49:48,985 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 681 transitions. Word has length 177 [2024-11-27 19:49:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:48,986 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 681 transitions. [2024-11-27 19:49:48,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 681 transitions. [2024-11-27 19:49:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 19:49:48,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:48,990 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:48,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 19:49:48,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:48,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1605403492, now seen corresponding path program 1 times [2024-11-27 19:49:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:48,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742069251] [2024-11-27 19:49:48,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:49,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:49,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742069251] [2024-11-27 19:49:49,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742069251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:49,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:49,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:49:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420521110] [2024-11-27 19:49:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:49,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:49:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:49,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:49:49,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:49:49,831 INFO L87 Difference]: Start difference. First operand 497 states and 681 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:50,185 INFO L93 Difference]: Finished difference Result 883 states and 1197 transitions. [2024-11-27 19:49:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:49:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-27 19:49:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:50,193 INFO L225 Difference]: With dead ends: 883 [2024-11-27 19:49:50,193 INFO L226 Difference]: Without dead ends: 881 [2024-11-27 19:49:50,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:49:50,196 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 118 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:50,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1327 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:49:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-27 19:49:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 714. [2024-11-27 19:49:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 654 states have (on average 1.2966360856269112) internal successors, (848), 655 states have internal predecessors, (848), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:49:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 958 transitions. [2024-11-27 19:49:50,294 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 958 transitions. Word has length 177 [2024-11-27 19:49:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:50,295 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 958 transitions. [2024-11-27 19:49:50,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 958 transitions. [2024-11-27 19:49:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 19:49:50,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:50,300 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:50,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 19:49:50,301 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash -233330152, now seen corresponding path program 1 times [2024-11-27 19:49:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:50,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385420573] [2024-11-27 19:49:50,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385420573] [2024-11-27 19:49:51,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385420573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:51,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:51,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:49:51,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267165060] [2024-11-27 19:49:51,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:51,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:49:51,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:51,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:49:51,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:49:51,217 INFO L87 Difference]: Start difference. First operand 714 states and 958 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:51,510 INFO L93 Difference]: Finished difference Result 1314 states and 1761 transitions. [2024-11-27 19:49:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:49:51,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-27 19:49:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:51,516 INFO L225 Difference]: With dead ends: 1314 [2024-11-27 19:49:51,516 INFO L226 Difference]: Without dead ends: 803 [2024-11-27 19:49:51,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:49:51,519 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 54 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:51,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 773 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:49:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-11-27 19:49:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 799. [2024-11-27 19:49:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 728 states have (on average 1.2884615384615385) internal successors, (938), 731 states have internal predecessors, (938), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-27 19:49:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1064 transitions. [2024-11-27 19:49:51,620 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1064 transitions. Word has length 177 [2024-11-27 19:49:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:51,621 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1064 transitions. [2024-11-27 19:49:51,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1064 transitions. [2024-11-27 19:49:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 19:49:51,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:51,625 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:51,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 19:49:51,626 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:51,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:51,626 INFO L85 PathProgramCache]: Analyzing trace with hash 467734426, now seen corresponding path program 1 times [2024-11-27 19:49:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498925727] [2024-11-27 19:49:51,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:52,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498925727] [2024-11-27 19:49:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498925727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:52,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:49:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17423072] [2024-11-27 19:49:52,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:52,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 19:49:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:52,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 19:49:52,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:49:52,460 INFO L87 Difference]: Start difference. First operand 799 states and 1064 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:52,886 INFO L93 Difference]: Finished difference Result 1619 states and 2154 transitions. [2024-11-27 19:49:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:49:52,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-27 19:49:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:52,894 INFO L225 Difference]: With dead ends: 1619 [2024-11-27 19:49:52,894 INFO L226 Difference]: Without dead ends: 1027 [2024-11-27 19:49:52,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:49:52,896 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 166 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:52,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 998 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:49:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2024-11-27 19:49:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1023. [2024-11-27 19:49:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 938 states have (on average 1.2803837953091683) internal successors, (1201), 943 states have internal predecessors, (1201), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-27 19:49:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1351 transitions. [2024-11-27 19:49:52,999 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1351 transitions. Word has length 177 [2024-11-27 19:49:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:53,000 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1351 transitions. [2024-11-27 19:49:53,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1351 transitions. [2024-11-27 19:49:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 19:49:53,003 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:53,003 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:53,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 19:49:53,004 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:53,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash -119071588, now seen corresponding path program 1 times [2024-11-27 19:49:53,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:53,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259396509] [2024-11-27 19:49:53,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:53,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:53,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259396509] [2024-11-27 19:49:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259396509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:53,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:49:53,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887268192] [2024-11-27 19:49:53,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:53,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:49:53,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:53,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:49:53,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:49:53,366 INFO L87 Difference]: Start difference. First operand 1023 states and 1351 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:53,821 INFO L93 Difference]: Finished difference Result 1952 states and 2609 transitions. [2024-11-27 19:49:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:49:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-27 19:49:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:53,828 INFO L225 Difference]: With dead ends: 1952 [2024-11-27 19:49:53,829 INFO L226 Difference]: Without dead ends: 1172 [2024-11-27 19:49:53,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:49:53,831 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 243 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:53,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 664 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:49:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-27 19:49:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 996. [2024-11-27 19:49:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 911 states have (on average 1.2755214050493964) internal successors, (1162), 916 states have internal predecessors, (1162), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-27 19:49:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1312 transitions. [2024-11-27 19:49:53,940 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1312 transitions. Word has length 177 [2024-11-27 19:49:53,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:53,941 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1312 transitions. [2024-11-27 19:49:53,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:49:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1312 transitions. [2024-11-27 19:49:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 19:49:53,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:53,945 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:53,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 19:49:53,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:53,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash 472378136, now seen corresponding path program 1 times [2024-11-27 19:49:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:53,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650720942] [2024-11-27 19:49:53,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:54,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:54,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650720942] [2024-11-27 19:49:54,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650720942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:54,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:54,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:49:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63500605] [2024-11-27 19:49:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:54,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:49:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:54,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:49:54,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:49:54,755 INFO L87 Difference]: Start difference. First operand 996 states and 1312 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:55,041 INFO L93 Difference]: Finished difference Result 1761 states and 2319 transitions. [2024-11-27 19:49:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:49:55,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-27 19:49:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:55,047 INFO L225 Difference]: With dead ends: 1761 [2024-11-27 19:49:55,047 INFO L226 Difference]: Without dead ends: 1008 [2024-11-27 19:49:55,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:49:55,049 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 92 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:55,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 805 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:49:55,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-11-27 19:49:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 941. [2024-11-27 19:49:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 864 states have (on average 1.2685185185185186) internal successors, (1096), 867 states have internal predecessors, (1096), 67 states have call successors, (67), 9 states have call predecessors, (67), 9 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-27 19:49:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1230 transitions. [2024-11-27 19:49:55,155 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1230 transitions. Word has length 177 [2024-11-27 19:49:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:55,158 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1230 transitions. [2024-11-27 19:49:55,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1230 transitions. [2024-11-27 19:49:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 19:49:55,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:55,163 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:55,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 19:49:55,163 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:55,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1899361126, now seen corresponding path program 1 times [2024-11-27 19:49:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146039461] [2024-11-27 19:49:55,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:55,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:49:55,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:55,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146039461] [2024-11-27 19:49:55,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146039461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:49:55,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:49:55,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:49:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699128866] [2024-11-27 19:49:55,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:49:55,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 19:49:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:55,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 19:49:55,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:49:55,928 INFO L87 Difference]: Start difference. First operand 941 states and 1230 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:49:56,336 INFO L93 Difference]: Finished difference Result 1727 states and 2258 transitions. [2024-11-27 19:49:56,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:49:56,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-27 19:49:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:49:56,342 INFO L225 Difference]: With dead ends: 1727 [2024-11-27 19:49:56,342 INFO L226 Difference]: Without dead ends: 1029 [2024-11-27 19:49:56,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:49:56,347 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 107 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:49:56,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1096 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:49:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-11-27 19:49:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2024-11-27 19:49:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 933 states have (on average 1.262593783494105) internal successors, (1178), 938 states have internal predecessors, (1178), 79 states have call successors, (79), 12 states have call predecessors, (79), 12 states have return successors, (79), 74 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-27 19:49:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1336 transitions. [2024-11-27 19:49:56,473 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1336 transitions. Word has length 177 [2024-11-27 19:49:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:49:56,474 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1336 transitions. [2024-11-27 19:49:56,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:49:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1336 transitions. [2024-11-27 19:49:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-27 19:49:56,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:49:56,478 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:49:56,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 19:49:56,478 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:49:56,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:49:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1029916482, now seen corresponding path program 1 times [2024-11-27 19:49:56,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:49:56,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454605897] [2024-11-27 19:49:56,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:49:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-27 19:49:57,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:49:57,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454605897] [2024-11-27 19:49:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454605897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:49:57,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381501047] [2024-11-27 19:49:57,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:49:57,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:49:57,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:49:57,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:49:57,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 19:49:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:49:58,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-27 19:49:58,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:49:58,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 19:49:58,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-27 19:49:58,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-27 19:49:58,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-27 19:49:58,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-27 19:49:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-27 19:49:58,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:49:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-27 19:49:59,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381501047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:49:59,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:49:59,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-11-27 19:49:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298511755] [2024-11-27 19:49:59,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:49:59,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 19:49:59,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:49:59,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 19:49:59,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-27 19:49:59,360 INFO L87 Difference]: Start difference. First operand 1025 states and 1336 transitions. Second operand has 18 states, 15 states have (on average 9.266666666666667) internal successors, (139), 18 states have internal predecessors, (139), 5 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 2 states have call predecessors, (63), 5 states have call successors, (63) [2024-11-27 19:50:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:00,548 INFO L93 Difference]: Finished difference Result 2133 states and 2770 transitions. [2024-11-27 19:50:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-27 19:50:00,549 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.266666666666667) internal successors, (139), 18 states have internal predecessors, (139), 5 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 2 states have call predecessors, (63), 5 states have call successors, (63) Word has length 178 [2024-11-27 19:50:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:00,556 INFO L225 Difference]: With dead ends: 2133 [2024-11-27 19:50:00,556 INFO L226 Difference]: Without dead ends: 1339 [2024-11-27 19:50:00,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 346 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2024-11-27 19:50:00,559 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 738 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:00,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 838 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 19:50:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-11-27 19:50:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1212. [2024-11-27 19:50:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1071 states have (on average 1.2492997198879552) internal successors, (1338), 1078 states have internal predecessors, (1338), 113 states have call successors, (113), 27 states have call predecessors, (113), 27 states have return successors, (113), 106 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-27 19:50:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1564 transitions. [2024-11-27 19:50:00,769 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1564 transitions. Word has length 178 [2024-11-27 19:50:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:00,770 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1564 transitions. [2024-11-27 19:50:00,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.266666666666667) internal successors, (139), 18 states have internal predecessors, (139), 5 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 2 states have call predecessors, (63), 5 states have call successors, (63) [2024-11-27 19:50:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1564 transitions. [2024-11-27 19:50:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-27 19:50:00,773 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:00,773 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:00,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 19:50:00,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:00,975 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:00,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1304481982, now seen corresponding path program 1 times [2024-11-27 19:50:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887874174] [2024-11-27 19:50:00,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:50:01,139 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 19:50:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:50:01,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 19:50:01,400 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 19:50:01,401 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 19:50:01,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 19:50:01,407 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:01,580 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 19:50:01,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:50:01 BoogieIcfgContainer [2024-11-27 19:50:01,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 19:50:01,589 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 19:50:01,589 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 19:50:01,589 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 19:50:01,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:49:26" (3/4) ... [2024-11-27 19:50:01,593 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 19:50:01,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 19:50:01,597 INFO L158 Benchmark]: Toolchain (without parser) took 37264.70ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 93.0MB in the beginning and 447.0MB in the end (delta: -354.0MB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. [2024-11-27 19:50:01,597 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:50:01,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.73ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 76.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 19:50:01,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.83ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 72.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:50:01,601 INFO L158 Benchmark]: Boogie Preprocessor took 150.63ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 67.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:50:01,602 INFO L158 Benchmark]: RCFGBuilder took 1252.65ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 82.6MB in the end (delta: -15.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-11-27 19:50:01,602 INFO L158 Benchmark]: TraceAbstraction took 35232.15ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 82.0MB in the beginning and 447.1MB in the end (delta: -365.1MB). Peak memory consumption was 188.5MB. Max. memory is 16.1GB. [2024-11-27 19:50:01,602 INFO L158 Benchmark]: Witness Printer took 7.17ms. Allocated memory is still 671.1MB. Free memory was 447.1MB in the beginning and 447.0MB in the end (delta: 92.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:50:01,605 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.32ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.73ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 76.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.83ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 72.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 150.63ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 67.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1252.65ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 82.6MB in the end (delta: -15.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 35232.15ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 82.0MB in the beginning and 447.1MB in the end (delta: -365.1MB). Peak memory consumption was 188.5MB. Max. memory is 16.1GB. * Witness Printer took 7.17ms. Allocated memory is still 671.1MB. Free memory was 447.1MB in the beginning and 447.0MB in the end (delta: 92.1kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_0_ = 0; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] isInitial = 1 [L112] FCALL initially() [L114] CALL updateLastVariables() [L104] EXPR BOOL_unsigned_char_Array_0[0] [L104] last_1_BOOL_unsigned_char_Array_0_0_ = BOOL_unsigned_char_Array_0[0] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] float_Array_0[0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] float_Array_0[2] = __VERIFIER_nondet_float() [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] signed_short_int_Array_0[0][0] = __VERIFIER_nondet_short() [L91] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] signed_short_int_Array_0[1][0] = __VERIFIER_nondet_short() [L94] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] signed_short_int_Array_0[0][1] = __VERIFIER_nondet_short() [L97] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] RET assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L100] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L115] RET updateVariables() [L116] CALL step() [L44] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_0_)) [L47] EXPR signed_short_int_Array_0[1][0] [L47] EXPR signed_short_int_Array_0[0][0] [L47] signed_short_int_Array_0[1][1] = ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]) [L49] EXPR float_Array_0[0] [L49] EXPR float_Array_0[1] [L49] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE (float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2] [L50] EXPR double_Array_0[0] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] COND TRUE (double_Array_0[0] - 2.3) > float_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] EXPR signed_short_int_Array_0[1][0] [L51] unsigned_short_int_Array_0[0] = (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]) [L58] EXPR signed_short_int_Array_0[1][1] [L58] EXPR unsigned_short_int_Array_0[0] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L58] EXPR BOOL_unsigned_char_Array_0[4] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L58] EXPR BOOL_unsigned_char_Array_0[3] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] = (! BOOL_unsigned_char_Array_0[1]) [L63] EXPR BOOL_unsigned_char_Array_0[0] [L63] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L64] stepLocal_0 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] stepLocal_0 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND FALSE !(stepLocal_0 && BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR signed_short_int_Array_0[1][0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L107] EXPR BOOL_unsigned_char_Array_0[4] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L107] EXPR BOOL_unsigned_char_Array_0[3] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))) [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[1] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) [L107] EXPR float_Array_0[0] [L107] EXPR float_Array_0[1] [L107] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0])) [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107-L108] return ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.0s, OverallIterations: 22, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4316 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4308 mSDsluCounter, 17956 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13671 mSDsCounter, 660 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3437 IncrementalHoareTripleChecker+Invalid, 4097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 660 mSolverCounterUnsat, 4285 mSDtfsCounter, 3437 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 758 GetRequests, 594 SyntacticMatches, 5 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1212occurred in iteration=21, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 1863 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 4158 NumberOfCodeBlocks, 4158 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4134 ConstructedInterpolants, 0 QuantifiedInterpolants, 13104 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1162 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 19940/20160 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 19:50:01,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB --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 fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:50:04,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:50:04,871 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 19:50:04,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:50:04,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:50:04,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:50:04,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:50:04,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:50:04,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:50:04,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:50:04,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:50:04,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:50:04,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:50:04,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:50:04,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:50:04,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:50:04,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:50:04,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:50:04,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:50:04,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:50:04,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:50:04,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:50:04,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:50:04,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 19:50:04,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 19:50:04,942 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 19:50:04,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:50:04,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:50:04,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:50:04,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:50:04,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:50:04,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:04,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:04,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:04,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:04,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:50:04,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:04,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:04,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:04,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:04,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:50:04,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:50:04,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:50:04,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:50:04,946 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 19:50:04,946 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 19:50:04,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:50:04,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:50:04,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:50:04,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:50:04,947 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB 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 -> fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b [2024-11-27 19:50:05,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:50:05,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:50:05,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:50:05,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:50:05,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:50:05,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-11-27 19:50:08,620 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data/f27c083b3/c3740a7b7b314f3c832882914593ab7d/FLAGe7e86f6cb [2024-11-27 19:50:09,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:50:09,003 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2024-11-27 19:50:09,020 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data/f27c083b3/c3740a7b7b314f3c832882914593ab7d/FLAGe7e86f6cb [2024-11-27 19:50:09,047 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/data/f27c083b3/c3740a7b7b314f3c832882914593ab7d [2024-11-27 19:50:09,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:50:09,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:50:09,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:09,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:50:09,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:50:09,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfadb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09, skipping insertion in model container [2024-11-27 19:50:09,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:50:09,317 WARN L250 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_cb60547d-8843-494c-bf93-d2171a26281a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-11-27 19:50:09,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:09,503 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:50:09,516 WARN L250 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_cb60547d-8843-494c-bf93-d2171a26281a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2024-11-27 19:50:09,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:09,686 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:50:09,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09 WrapperNode [2024-11-27 19:50:09,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:09,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:09,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:50:09,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:50:09,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,804 INFO L138 Inliner]: procedures = 39, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 565 [2024-11-27 19:50:09,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:09,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:50:09,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:50:09,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:50:09,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,871 INFO L175 MemorySlicer]: Split 150 memory accesses to 7 slices as follows [2, 36, 8, 27, 3, 47, 27]. 31 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 3, 1, 4, 2]. The 20 writes are split as follows [0, 6, 1, 3, 1, 5, 4]. [2024-11-27 19:50:09,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:09,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:50:09,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:50:09,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:50:09,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:50:10,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (1/1) ... [2024-11-27 19:50:10,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:10,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:10,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:50:10,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:50:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:50:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-27 19:50:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-27 19:50:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-27 19:50:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-27 19:50:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-27 19:50:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-27 19:50:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-27 19:50:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-27 19:50:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-27 19:50:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-27 19:50:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-27 19:50:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-27 19:50:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-27 19:50:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-27 19:50:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-27 19:50:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-27 19:50:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-27 19:50:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-27 19:50:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-27 19:50:10,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-27 19:50:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-27 19:50:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-27 19:50:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-27 19:50:10,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-27 19:50:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-27 19:50:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-27 19:50:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-27 19:50:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-27 19:50:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 19:50:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 19:50:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-27 19:50:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-27 19:50:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-27 19:50:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-27 19:50:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-27 19:50:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-27 19:50:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-27 19:50:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-27 19:50:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-27 19:50:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-27 19:50:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-27 19:50:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-27 19:50:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 19:50:10,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:50:10,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-27 19:50:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-27 19:50:10,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-27 19:50:10,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-27 19:50:10,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-27 19:50:10,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-27 19:50:10,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-27 19:50:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-27 19:50:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-27 19:50:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 19:50:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 19:50:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 19:50:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-27 19:50:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-27 19:50:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-27 19:50:10,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-27 19:50:10,406 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:50:10,409 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:50:16,547 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-27 19:50:16,547 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:50:16,568 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:50:16,569 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 19:50:16,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:16 BoogieIcfgContainer [2024-11-27 19:50:16,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:50:16,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:50:16,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:50:16,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:50:16,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:50:09" (1/3) ... [2024-11-27 19:50:16,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2c511b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:16, skipping insertion in model container [2024-11-27 19:50:16,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:09" (2/3) ... [2024-11-27 19:50:16,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2c511b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:16, skipping insertion in model container [2024-11-27 19:50:16,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:16" (3/3) ... [2024-11-27 19:50:16,582 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2024-11-27 19:50:16,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:50:16,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-14.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 19:50:16,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:50:16,692 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;@4cbfbfd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:50:16,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:50:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-27 19:50:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:50:16,722 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:16,723 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:16,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:16,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1214119564, now seen corresponding path program 1 times [2024-11-27 19:50:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:16,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450166774] [2024-11-27 19:50:16,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:16,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:16,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:16,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-27 19:50:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:17,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 19:50:17,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-11-27 19:50:17,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:17,735 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:17,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450166774] [2024-11-27 19:50:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450166774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:17,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:17,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425947436] [2024-11-27 19:50:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:17,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 19:50:17,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:17,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 19:50:17,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:50:17,785 INFO L87 Difference]: Start difference. First operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:50:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:17,844 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-27 19:50:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 19:50:17,847 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-27 19:50:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:17,858 INFO L225 Difference]: With dead ends: 249 [2024-11-27 19:50:17,858 INFO L226 Difference]: Without dead ends: 124 [2024-11-27 19:50:17,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:50:17,870 INFO L435 NwaCegarLoop]: 183 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, 183 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:17,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-27 19:50:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-27 19:50:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-27 19:50:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-27 19:50:17,952 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-27 19:50:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:17,953 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-27 19:50:17,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:50:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-27 19:50:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:50:17,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:17,961 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:17,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-27 19:50:18,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:18,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:18,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1352198634, now seen corresponding path program 1 times [2024-11-27 19:50:18,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:18,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707001917] [2024-11-27 19:50:18,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:18,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:18,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:18,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:18,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-27 19:50:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:18,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 19:50:18,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-27 19:50:18,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:18,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:18,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707001917] [2024-11-27 19:50:18,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707001917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:18,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:18,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:50:18,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888407105] [2024-11-27 19:50:18,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:18,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:18,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:18,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:18,941 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:50:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:19,048 INFO L93 Difference]: Finished difference Result 247 states and 366 transitions. [2024-11-27 19:50:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:19,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-27 19:50:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:19,051 INFO L225 Difference]: With dead ends: 247 [2024-11-27 19:50:19,052 INFO L226 Difference]: Without dead ends: 126 [2024-11-27 19:50:19,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:19,054 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 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-11-27 19:50:19,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-27 19:50:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-27 19:50:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-27 19:50:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-27 19:50:19,084 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 168 [2024-11-27 19:50:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:19,090 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-27 19:50:19,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:50:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-27 19:50:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:50:19,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:19,096 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:19,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-27 19:50:19,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:19,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:19,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash -214559316, now seen corresponding path program 1 times [2024-11-27 19:50:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:19,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386988180] [2024-11-27 19:50:19,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:19,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:19,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:19,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:19,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/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-11-27 19:50:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:19,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 19:50:19,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:20,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-27 19:50:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:50:21,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:21,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386988180] [2024-11-27 19:50:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386988180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:21,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528382248] [2024-11-27 19:50:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:21,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:21,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:21,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:21,015 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:21,549 INFO L93 Difference]: Finished difference Result 388 states and 574 transitions. [2024-11-27 19:50:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:21,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:50:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:21,555 INFO L225 Difference]: With dead ends: 388 [2024-11-27 19:50:21,555 INFO L226 Difference]: Without dead ends: 265 [2024-11-27 19:50:21,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:21,557 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 201 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:21,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 514 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 19:50:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-27 19:50:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 222. [2024-11-27 19:50:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 177 states have internal predecessors, (243), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:50:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 327 transitions. [2024-11-27 19:50:21,594 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 327 transitions. Word has length 168 [2024-11-27 19:50:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:21,595 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 327 transitions. [2024-11-27 19:50:21,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 327 transitions. [2024-11-27 19:50:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:50:21,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:21,599 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:21,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/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-11-27 19:50:21,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:21,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:21,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash -348572822, now seen corresponding path program 1 times [2024-11-27 19:50:21,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:21,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720218494] [2024-11-27 19:50:21,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:21,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:21,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:21,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:21,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-27 19:50:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:22,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 19:50:22,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:50:22,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:22,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:22,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720218494] [2024-11-27 19:50:22,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720218494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:22,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:50:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379809930] [2024-11-27 19:50:22,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:22,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:22,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:22,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:22,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:22,526 INFO L87 Difference]: Start difference. First operand 222 states and 327 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:22,624 INFO L93 Difference]: Finished difference Result 375 states and 557 transitions. [2024-11-27 19:50:22,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:22,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:50:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:22,628 INFO L225 Difference]: With dead ends: 375 [2024-11-27 19:50:22,628 INFO L226 Difference]: Without dead ends: 228 [2024-11-27 19:50:22,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:22,631 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:22,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 530 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-27 19:50:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-27 19:50:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 183 states have (on average 1.360655737704918) internal successors, (249), 183 states have internal predecessors, (249), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:50:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 333 transitions. [2024-11-27 19:50:22,669 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 333 transitions. Word has length 168 [2024-11-27 19:50:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:22,670 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 333 transitions. [2024-11-27 19:50:22,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 333 transitions. [2024-11-27 19:50:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:50:22,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:22,674 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:22,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-27 19:50:22,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:22,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:22,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash 469075628, now seen corresponding path program 1 times [2024-11-27 19:50:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:22,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705601838] [2024-11-27 19:50:22,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:22,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:22,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:22,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:22,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-27 19:50:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:23,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 19:50:23,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:50:23,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:23,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:23,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705601838] [2024-11-27 19:50:23,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705601838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:23,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:23,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:50:23,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758637010] [2024-11-27 19:50:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:23,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:23,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:23,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:23,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:23,638 INFO L87 Difference]: Start difference. First operand 228 states and 333 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:23,861 INFO L93 Difference]: Finished difference Result 383 states and 563 transitions. [2024-11-27 19:50:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:23,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:50:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:23,865 INFO L225 Difference]: With dead ends: 383 [2024-11-27 19:50:23,866 INFO L226 Difference]: Without dead ends: 230 [2024-11-27 19:50:23,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:23,868 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:23,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 509 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:50:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-27 19:50:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-11-27 19:50:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 185 states have internal predecessors, (251), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:50:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 335 transitions. [2024-11-27 19:50:23,903 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 335 transitions. Word has length 168 [2024-11-27 19:50:23,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:23,904 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 335 transitions. [2024-11-27 19:50:23,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 335 transitions. [2024-11-27 19:50:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:50:23,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:23,907 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:23,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-27 19:50:24,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:24,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:24,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1480192878, now seen corresponding path program 1 times [2024-11-27 19:50:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844725235] [2024-11-27 19:50:24,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:24,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:24,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:24,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-27 19:50:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:24,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 19:50:24,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:24,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-27 19:50:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:50:24,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:24,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844725235] [2024-11-27 19:50:24,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844725235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:24,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:24,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:24,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619327930] [2024-11-27 19:50:24,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:24,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:24,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:24,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:24,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:24,989 INFO L87 Difference]: Start difference. First operand 230 states and 335 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:31,427 INFO L93 Difference]: Finished difference Result 500 states and 731 transitions. [2024-11-27 19:50:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:50:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:50:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:31,431 INFO L225 Difference]: With dead ends: 500 [2024-11-27 19:50:31,431 INFO L226 Difference]: Without dead ends: 345 [2024-11-27 19:50:31,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:50:31,432 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 143 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:31,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1035 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-27 19:50:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-27 19:50:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 240. [2024-11-27 19:50:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.358974358974359) internal successors, (265), 195 states have internal predecessors, (265), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:50:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 349 transitions. [2024-11-27 19:50:31,462 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 349 transitions. Word has length 168 [2024-11-27 19:50:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:31,463 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 349 transitions. [2024-11-27 19:50:31,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 349 transitions. [2024-11-27 19:50:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 19:50:31,465 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:31,465 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:31,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-27 19:50:31,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:31,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:31,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash -810788050, now seen corresponding path program 1 times [2024-11-27 19:50:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:31,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295802764] [2024-11-27 19:50:31,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:31,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:31,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:31,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:31,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-27 19:50:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:32,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 19:50:32,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:50:32,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:32,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:32,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295802764] [2024-11-27 19:50:32,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295802764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:32,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:32,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:32,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215858339] [2024-11-27 19:50:32,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:32,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:32,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:32,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:32,474 INFO L87 Difference]: Start difference. First operand 240 states and 349 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:33,328 INFO L93 Difference]: Finished difference Result 544 states and 793 transitions. [2024-11-27 19:50:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:50:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-27 19:50:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:33,334 INFO L225 Difference]: With dead ends: 544 [2024-11-27 19:50:33,336 INFO L226 Difference]: Without dead ends: 379 [2024-11-27 19:50:33,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:50:33,338 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 169 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:33,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 694 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 19:50:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-27 19:50:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 236. [2024-11-27 19:50:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 191 states have (on average 1.324607329842932) internal successors, (253), 191 states have internal predecessors, (253), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:50:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 337 transitions. [2024-11-27 19:50:33,393 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 337 transitions. Word has length 168 [2024-11-27 19:50:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:33,394 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 337 transitions. [2024-11-27 19:50:33,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:50:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 337 transitions. [2024-11-27 19:50:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-27 19:50:33,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:33,399 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:33,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-27 19:50:33,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:33,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:33,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash -684748057, now seen corresponding path program 1 times [2024-11-27 19:50:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:33,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085760960] [2024-11-27 19:50:33,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:33,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:33,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:33,603 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:33,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-27 19:50:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:34,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 19:50:34,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:34,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:50:34,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-27 19:50:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-27 19:50:34,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:34,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:34,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085760960] [2024-11-27 19:50:34,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085760960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:34,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:34,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:34,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013718729] [2024-11-27 19:50:34,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:34,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:50:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:34,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:50:34,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:34,596 INFO L87 Difference]: Start difference. First operand 236 states and 337 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:50:36,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 19:50:39,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 19:50:41,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 19:50:43,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:43,335 INFO L93 Difference]: Finished difference Result 448 states and 639 transitions. [2024-11-27 19:50:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:50:43,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2024-11-27 19:50:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:43,346 INFO L225 Difference]: With dead ends: 448 [2024-11-27 19:50:43,346 INFO L226 Difference]: Without dead ends: 238 [2024-11-27 19:50:43,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:50:43,348 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:43,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 570 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-27 19:50:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-27 19:50:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2024-11-27 19:50:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 191 states have internal predecessors, (251), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:50:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 335 transitions. [2024-11-27 19:50:43,371 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 335 transitions. Word has length 170 [2024-11-27 19:50:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:43,372 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 335 transitions. [2024-11-27 19:50:43,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-27 19:50:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 335 transitions. [2024-11-27 19:50:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-27 19:50:43,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:43,375 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:43,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-27 19:50:43,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:43,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:43,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1221629651, now seen corresponding path program 1 times [2024-11-27 19:50:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:43,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567727643] [2024-11-27 19:50:43,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:43,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:43,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:43,579 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:43,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-27 19:50:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:44,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-27 19:50:44,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:44,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 19:50:44,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-27 19:50:45,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-27 19:50:45,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-27 19:50:48,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:50:48,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 61 [2024-11-27 19:50:48,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:50:48,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 34 [2024-11-27 19:50:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 282 proven. 114 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-11-27 19:50:48,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:50:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-11-27 19:50:49,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:49,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567727643] [2024-11-27 19:50:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567727643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:50:49,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 19:50:49,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2024-11-27 19:50:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776596098] [2024-11-27 19:50:49,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 19:50:49,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 19:50:49,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:49,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 19:50:49,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-11-27 19:50:49,709 INFO L87 Difference]: Start difference. First operand 236 states and 335 transitions. Second operand has 18 states, 14 states have (on average 9.357142857142858) internal successors, (131), 18 states have internal predecessors, (131), 7 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 3 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-27 19:50:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:53,450 INFO L93 Difference]: Finished difference Result 598 states and 820 transitions. [2024-11-27 19:50:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-27 19:50:53,451 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 9.357142857142858) internal successors, (131), 18 states have internal predecessors, (131), 7 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 3 states have call predecessors, (42), 7 states have call successors, (42) Word has length 172 [2024-11-27 19:50:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:53,455 INFO L225 Difference]: With dead ends: 598 [2024-11-27 19:50:53,455 INFO L226 Difference]: Without dead ends: 437 [2024-11-27 19:50:53,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=434, Invalid=1546, Unknown=0, NotChecked=0, Total=1980 [2024-11-27 19:50:53,458 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 698 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:53,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1024 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-27 19:50:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-27 19:50:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 264. [2024-11-27 19:50:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 213 states have (on average 1.2816901408450705) internal successors, (273), 213 states have internal predecessors, (273), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-27 19:50:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2024-11-27 19:50:53,494 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 172 [2024-11-27 19:50:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:53,495 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2024-11-27 19:50:53,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 9.357142857142858) internal successors, (131), 18 states have internal predecessors, (131), 7 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 3 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-27 19:50:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2024-11-27 19:50:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-27 19:50:53,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:53,498 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:53,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-27 19:50:53,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:53,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:53,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1134001875, now seen corresponding path program 1 times [2024-11-27 19:50:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:53,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696736626] [2024-11-27 19:50:53,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:53,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:50:53,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:53,704 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:50:53,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-27 19:50:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:54,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-27 19:50:54,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:54,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 19:50:54,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-27 19:50:55,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:50:55,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 46 [2024-11-27 19:50:56,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:50:56,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 68 [2024-11-27 19:50:56,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-27 19:50:57,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2024-11-27 19:50:58,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:50:58,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 81 [2024-11-27 19:50:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 452 proven. 39 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-11-27 19:50:58,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:50:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:50:59,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:59,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696736626] [2024-11-27 19:50:59,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696736626] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 19:50:59,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 19:50:59,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [23] total 28 [2024-11-27 19:50:59,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529317915] [2024-11-27 19:50:59,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:59,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:50:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:59,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:50:59,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-27 19:50:59,560 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:10,565 INFO L93 Difference]: Finished difference Result 538 states and 726 transitions. [2024-11-27 19:51:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:51:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-11-27 19:51:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:10,570 INFO L225 Difference]: With dead ends: 538 [2024-11-27 19:51:10,570 INFO L226 Difference]: Without dead ends: 361 [2024-11-27 19:51:10,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2024-11-27 19:51:10,572 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 358 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:10,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1353 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-27 19:51:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-27 19:51:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 358. [2024-11-27 19:51:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 289 states have (on average 1.2837370242214532) internal successors, (371), 290 states have internal predecessors, (371), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:51:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 481 transitions. [2024-11-27 19:51:10,622 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 481 transitions. Word has length 172 [2024-11-27 19:51:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:10,623 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 481 transitions. [2024-11-27 19:51:10,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 481 transitions. [2024-11-27 19:51:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 19:51:10,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:10,626 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:10,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-27 19:51:10,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:10,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:10,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash -428380584, now seen corresponding path program 1 times [2024-11-27 19:51:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709136713] [2024-11-27 19:51:10,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:10,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:10,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:51:10,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:51:10,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-27 19:51:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:11,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-27 19:51:11,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:11,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 19:51:12,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-27 19:51:12,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-27 19:51:12,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:12,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2024-11-27 19:51:15,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:15,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 61 [2024-11-27 19:51:15,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:15,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 101 [2024-11-27 19:51:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 178 proven. 114 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-27 19:51:16,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:51:17,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:17,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709136713] [2024-11-27 19:51:17,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709136713] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:17,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 19:51:17,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2024-11-27 19:51:17,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450434461] [2024-11-27 19:51:17,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:17,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:51:17,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:17,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:51:17,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-27 19:51:17,370 INFO L87 Difference]: Start difference. First operand 358 states and 481 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:17,998 INFO L93 Difference]: Finished difference Result 701 states and 945 transitions. [2024-11-27 19:51:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:51:17,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-27 19:51:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:18,004 INFO L225 Difference]: With dead ends: 701 [2024-11-27 19:51:18,005 INFO L226 Difference]: Without dead ends: 434 [2024-11-27 19:51:18,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-27 19:51:18,007 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 39 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:18,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 839 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 19:51:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-27 19:51:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 392. [2024-11-27 19:51:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 323 states have (on average 1.278637770897833) internal successors, (413), 324 states have internal predecessors, (413), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:51:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 523 transitions. [2024-11-27 19:51:18,073 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 523 transitions. Word has length 177 [2024-11-27 19:51:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:18,074 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 523 transitions. [2024-11-27 19:51:18,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 523 transitions. [2024-11-27 19:51:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:51:18,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:18,078 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:18,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-27 19:51:18,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:18,280 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:18,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 753507478, now seen corresponding path program 1 times [2024-11-27 19:51:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239749150] [2024-11-27 19:51:18,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:18,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:18,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:51:18,285 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:51:18,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-27 19:51:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:18,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 19:51:18,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:18,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-27 19:51:19,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-27 19:51:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:51:19,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:51:19,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:19,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239749150] [2024-11-27 19:51:19,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239749150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:19,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:19,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092645615] [2024-11-27 19:51:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:19,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:19,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:19,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:19,065 INFO L87 Difference]: Start difference. First operand 392 states and 523 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:19,577 INFO L93 Difference]: Finished difference Result 952 states and 1279 transitions. [2024-11-27 19:51:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:51:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:51:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:19,585 INFO L225 Difference]: With dead ends: 952 [2024-11-27 19:51:19,586 INFO L226 Difference]: Without dead ends: 651 [2024-11-27 19:51:19,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:51:19,588 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 170 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:19,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 735 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 19:51:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-27 19:51:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 398. [2024-11-27 19:51:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 329 states have (on average 1.2735562310030395) internal successors, (419), 330 states have internal predecessors, (419), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:51:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 529 transitions. [2024-11-27 19:51:19,661 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 529 transitions. Word has length 179 [2024-11-27 19:51:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:19,662 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 529 transitions. [2024-11-27 19:51:19,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 529 transitions. [2024-11-27 19:51:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:51:19,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:19,666 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:19,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-27 19:51:19,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:19,867 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:19,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2006942870, now seen corresponding path program 1 times [2024-11-27 19:51:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340104737] [2024-11-27 19:51:19,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:19,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:19,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:51:19,870 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:51:19,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-27 19:51:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:20,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 19:51:20,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:51:20,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:51:20,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:20,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340104737] [2024-11-27 19:51:20,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340104737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:20,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:20,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:20,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89213997] [2024-11-27 19:51:20,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:20,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:20,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:20,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:20,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:20,886 INFO L87 Difference]: Start difference. First operand 398 states and 529 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:25,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 19:51:26,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 19:51:28,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 19:51:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:30,401 INFO L93 Difference]: Finished difference Result 948 states and 1263 transitions. [2024-11-27 19:51:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:51:30,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:51:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:30,407 INFO L225 Difference]: With dead ends: 948 [2024-11-27 19:51:30,407 INFO L226 Difference]: Without dead ends: 641 [2024-11-27 19:51:30,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:51:30,410 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 140 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:30,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 638 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-27 19:51:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-27 19:51:30,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 444. [2024-11-27 19:51:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 375 states have (on average 1.2666666666666666) internal successors, (475), 376 states have internal predecessors, (475), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:51:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 585 transitions. [2024-11-27 19:51:30,499 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 585 transitions. Word has length 179 [2024-11-27 19:51:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:30,500 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 585 transitions. [2024-11-27 19:51:30,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 585 transitions. [2024-11-27 19:51:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:51:30,502 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:30,502 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:30,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-27 19:51:30,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:30,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:30,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1586959848, now seen corresponding path program 1 times [2024-11-27 19:51:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:30,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760338420] [2024-11-27 19:51:30,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:30,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:30,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:51:30,706 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:51:30,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-27 19:51:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:31,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 19:51:31,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:51:31,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:51:31,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760338420] [2024-11-27 19:51:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760338420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478438429] [2024-11-27 19:51:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:31,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:31,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:31,342 INFO L87 Difference]: Start difference. First operand 444 states and 585 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:31,478 INFO L93 Difference]: Finished difference Result 809 states and 1072 transitions. [2024-11-27 19:51:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:31,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:51:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:31,482 INFO L225 Difference]: With dead ends: 809 [2024-11-27 19:51:31,483 INFO L226 Difference]: Without dead ends: 456 [2024-11-27 19:51:31,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:31,485 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:31,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 528 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:31,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-27 19:51:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 450. [2024-11-27 19:51:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 381 states have (on average 1.26246719160105) internal successors, (481), 382 states have internal predecessors, (481), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:51:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 591 transitions. [2024-11-27 19:51:31,553 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 591 transitions. Word has length 179 [2024-11-27 19:51:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:31,554 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 591 transitions. [2024-11-27 19:51:31,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 591 transitions. [2024-11-27 19:51:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:51:31,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:31,556 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:31,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-27 19:51:31,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:31,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:31,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1419701354, now seen corresponding path program 1 times [2024-11-27 19:51:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:31,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48855048] [2024-11-27 19:51:31,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:31,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:31,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:51:31,761 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:51:31,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-27 19:51:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:32,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 19:51:32,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:32,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-27 19:51:33,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-27 19:51:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:51:33,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:51:33,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:33,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48855048] [2024-11-27 19:51:33,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48855048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:33,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:33,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:51:33,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291632494] [2024-11-27 19:51:33,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:33,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:51:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:33,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:51:33,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:51:33,123 INFO L87 Difference]: Start difference. First operand 450 states and 591 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:38,827 INFO L93 Difference]: Finished difference Result 785 states and 1022 transitions. [2024-11-27 19:51:38,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:51:38,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:51:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:38,832 INFO L225 Difference]: With dead ends: 785 [2024-11-27 19:51:38,833 INFO L226 Difference]: Without dead ends: 783 [2024-11-27 19:51:38,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:51:38,834 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 117 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:38,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1316 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-27 19:51:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-27 19:51:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 601. [2024-11-27 19:51:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 532 states have (on average 1.2575187969924813) internal successors, (669), 533 states have internal predecessors, (669), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:51:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 779 transitions. [2024-11-27 19:51:38,900 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 779 transitions. Word has length 179 [2024-11-27 19:51:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:38,901 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 779 transitions. [2024-11-27 19:51:38,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 779 transitions. [2024-11-27 19:51:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:51:38,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:38,904 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:38,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-27 19:51:39,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:39,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:39,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:39,105 INFO L85 PathProgramCache]: Analyzing trace with hash -47628014, now seen corresponding path program 1 times [2024-11-27 19:51:39,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:39,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283706962] [2024-11-27 19:51:39,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:39,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:39,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:51:39,108 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:51:39,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-27 19:51:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:39,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 19:51:39,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:51:40,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:51:40,199 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:40,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283706962] [2024-11-27 19:51:40,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283706962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:40,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:40,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:51:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666518425] [2024-11-27 19:51:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:40,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:51:40,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:40,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:51:40,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:51:40,201 INFO L87 Difference]: Start difference. First operand 601 states and 779 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:41,387 INFO L93 Difference]: Finished difference Result 1476 states and 1922 transitions. [2024-11-27 19:51:41,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:51:41,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:51:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:41,395 INFO L225 Difference]: With dead ends: 1476 [2024-11-27 19:51:41,395 INFO L226 Difference]: Without dead ends: 966 [2024-11-27 19:51:41,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-27 19:51:41,398 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 158 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:41,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1170 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 19:51:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-27 19:51:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 687. [2024-11-27 19:51:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 618 states have (on average 1.2540453074433657) internal successors, (775), 619 states have internal predecessors, (775), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-27 19:51:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 885 transitions. [2024-11-27 19:51:41,469 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 885 transitions. Word has length 179 [2024-11-27 19:51:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:41,469 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 885 transitions. [2024-11-27 19:51:41,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 885 transitions. [2024-11-27 19:51:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:51:41,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:41,473 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:41,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-27 19:51:41,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:41,674 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:41,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash 632430356, now seen corresponding path program 1 times [2024-11-27 19:51:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79748148] [2024-11-27 19:51:41,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:41,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:41,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:51:41,680 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:51:41,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-27 19:51:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:42,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-27 19:51:42,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:42,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-27 19:51:42,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-27 19:51:45,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:45,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2024-11-27 19:51:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 350 proven. 45 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-27 19:51:46,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:51:46,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:46,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79748148] [2024-11-27 19:51:46,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79748148] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:46,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 19:51:46,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2024-11-27 19:51:46,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298728937] [2024-11-27 19:51:46,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:46,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:46,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:46,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:46,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-27 19:51:46,903 INFO L87 Difference]: Start difference. First operand 687 states and 885 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:47,297 INFO L93 Difference]: Finished difference Result 1400 states and 1788 transitions. [2024-11-27 19:51:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:51:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:47,302 INFO L225 Difference]: With dead ends: 1400 [2024-11-27 19:51:47,302 INFO L226 Difference]: Without dead ends: 804 [2024-11-27 19:51:47,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-27 19:51:47,304 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 50 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:47,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 633 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:51:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-27 19:51:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 800. [2024-11-27 19:51:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 716 states have (on average 1.2416201117318435) internal successors, (889), 719 states have internal predecessors, (889), 63 states have call successors, (63), 20 states have call predecessors, (63), 20 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-27 19:51:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1015 transitions. [2024-11-27 19:51:47,404 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1015 transitions. Word has length 179 [2024-11-27 19:51:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:47,404 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1015 transitions. [2024-11-27 19:51:47,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1015 transitions. [2024-11-27 19:51:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:51:47,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:47,407 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:47,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-27 19:51:47,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:47,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:47,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:47,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1333494934, now seen corresponding path program 1 times [2024-11-27 19:51:47,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:47,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259941009] [2024-11-27 19:51:47,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:47,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:47,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:51:47,611 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:51:47,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-27 19:51:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:48,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-27 19:51:48,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:48,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-27 19:51:50,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-27 19:51:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 428 proven. 39 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-11-27 19:51:50,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:51:51,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259941009] [2024-11-27 19:51:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259941009] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:51,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 19:51:51,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2024-11-27 19:51:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777107724] [2024-11-27 19:51:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:51,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:51:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:51,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:51:51,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-27 19:51:51,241 INFO L87 Difference]: Start difference. First operand 800 states and 1015 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:51,955 INFO L93 Difference]: Finished difference Result 1774 states and 2247 transitions. [2024-11-27 19:51:51,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:51:51,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:51:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:51,959 INFO L225 Difference]: With dead ends: 1774 [2024-11-27 19:51:51,959 INFO L226 Difference]: Without dead ends: 1069 [2024-11-27 19:51:51,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-27 19:51:51,965 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 64 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:51,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1009 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 19:51:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-11-27 19:51:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 930. [2024-11-27 19:51:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 846 states have (on average 1.2364066193853427) internal successors, (1046), 849 states have internal predecessors, (1046), 63 states have call successors, (63), 20 states have call predecessors, (63), 20 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-27 19:51:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1172 transitions. [2024-11-27 19:51:52,058 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1172 transitions. Word has length 179 [2024-11-27 19:51:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:52,059 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1172 transitions. [2024-11-27 19:51:52,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:51:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1172 transitions. [2024-11-27 19:51:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:51:52,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:52,061 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:52,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-27 19:51:52,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:52,262 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:52,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash 746688920, now seen corresponding path program 1 times [2024-11-27 19:51:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:52,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568680424] [2024-11-27 19:51:52,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:52,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:51:52,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:51:52,268 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:51:52,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-27 19:51:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:53,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 19:51:53,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:51:53,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:51:53,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:53,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568680424] [2024-11-27 19:51:53,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568680424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:53,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:53,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212290009] [2024-11-27 19:51:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:53,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:53,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:53,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:53,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:53,391 INFO L87 Difference]: Start difference. First operand 930 states and 1172 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:52:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:00,213 INFO L93 Difference]: Finished difference Result 1960 states and 2484 transitions. [2024-11-27 19:52:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:52:00,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:52:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:00,217 INFO L225 Difference]: With dead ends: 1960 [2024-11-27 19:52:00,217 INFO L226 Difference]: Without dead ends: 1125 [2024-11-27 19:52:00,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:52:00,219 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 142 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:00,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 867 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-27 19:52:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-27 19:52:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 907. [2024-11-27 19:52:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 823 states have (on average 1.2199270959902795) internal successors, (1004), 826 states have internal predecessors, (1004), 63 states have call successors, (63), 20 states have call predecessors, (63), 20 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-27 19:52:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1130 transitions. [2024-11-27 19:52:00,315 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1130 transitions. Word has length 179 [2024-11-27 19:52:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:00,316 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1130 transitions. [2024-11-27 19:52:00,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:52:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1130 transitions. [2024-11-27 19:52:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:52:00,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:00,319 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:52:00,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-27 19:52:00,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:52:00,519 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:52:00,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1302488558, now seen corresponding path program 1 times [2024-11-27 19:52:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:52:00,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578842539] [2024-11-27 19:52:00,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:00,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:52:00,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:52:00,526 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:52:00,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/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 (21)] Waiting until timeout for monitored process [2024-11-27 19:52:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:52:01,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-27 19:52:01,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:52:01,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 19:52:01,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-27 19:52:03,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2024-11-27 19:52:03,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:03,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:52:03,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 73 [2024-11-27 19:52:03,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-11-27 19:52:04,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:52:04,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 43 [2024-11-27 19:52:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 330 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-27 19:52:04,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:52:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:52:05,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:52:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578842539] [2024-11-27 19:52:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578842539] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 19:52:05,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 19:52:05,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2024-11-27 19:52:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943814005] [2024-11-27 19:52:05,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:52:05,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:52:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:52:05,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:52:05,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-27 19:52:05,137 INFO L87 Difference]: Start difference. First operand 907 states and 1130 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:52:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:05,603 INFO L93 Difference]: Finished difference Result 1832 states and 2281 transitions. [2024-11-27 19:52:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:52:05,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:52:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:05,610 INFO L225 Difference]: With dead ends: 1832 [2024-11-27 19:52:05,610 INFO L226 Difference]: Without dead ends: 1020 [2024-11-27 19:52:05,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-27 19:52:05,612 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 50 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:05,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 763 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 19:52:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-11-27 19:52:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 930. [2024-11-27 19:52:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 846 states have (on average 1.2222222222222223) internal successors, (1034), 849 states have internal predecessors, (1034), 63 states have call successors, (63), 20 states have call predecessors, (63), 20 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-27 19:52:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1160 transitions. [2024-11-27 19:52:05,714 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1160 transitions. Word has length 179 [2024-11-27 19:52:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:05,714 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1160 transitions. [2024-11-27 19:52:05,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:52:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1160 transitions. [2024-11-27 19:52:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 19:52:05,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:05,717 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:52:05,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/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 (21)] Forceful destruction successful, exit code 0 [2024-11-27 19:52:05,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:52:05,918 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:52:05,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 620739476, now seen corresponding path program 1 times [2024-11-27 19:52:05,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:52:05,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862149458] [2024-11-27 19:52:05,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:05,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:52:05,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:52:05,921 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:52:05,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/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 (22)] Waiting until timeout for monitored process [2024-11-27 19:52:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:52:06,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-27 19:52:06,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:52:06,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 19:52:07,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2024-11-27 19:52:07,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:52:07,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2024-11-27 19:52:07,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2024-11-27 19:52:08,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:52:08,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 35 [2024-11-27 19:52:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 398 proven. 39 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-11-27 19:52:08,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:52:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-27 19:52:08,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:52:08,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862149458] [2024-11-27 19:52:08,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862149458] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 19:52:08,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 19:52:08,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 14 [2024-11-27 19:52:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350297295] [2024-11-27 19:52:08,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:52:08,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:52:08,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:52:08,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:52:08,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-27 19:52:08,954 INFO L87 Difference]: Start difference. First operand 930 states and 1160 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:52:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:09,640 INFO L93 Difference]: Finished difference Result 1880 states and 2335 transitions. [2024-11-27 19:52:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:52:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 179 [2024-11-27 19:52:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:09,646 INFO L225 Difference]: With dead ends: 1880 [2024-11-27 19:52:09,646 INFO L226 Difference]: Without dead ends: 1045 [2024-11-27 19:52:09,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-27 19:52:09,649 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 154 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:09,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 914 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 19:52:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2024-11-27 19:52:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 912. [2024-11-27 19:52:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 828 states have (on average 1.21256038647343) internal successors, (1004), 831 states have internal predecessors, (1004), 63 states have call successors, (63), 20 states have call predecessors, (63), 20 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-27 19:52:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1130 transitions. [2024-11-27 19:52:09,742 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1130 transitions. Word has length 179 [2024-11-27 19:52:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:09,743 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1130 transitions. [2024-11-27 19:52:09,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-27 19:52:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1130 transitions. [2024-11-27 19:52:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-27 19:52:09,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:09,746 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:52:09,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/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 (22)] Ended with exit code 0 [2024-11-27 19:52:09,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:52:09,947 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:52:09,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash -490774648, now seen corresponding path program 1 times [2024-11-27 19:52:09,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:52:09,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989575590] [2024-11-27 19:52:09,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:52:09,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 19:52:09,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:52:09,951 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 19:52:09,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb60547d-8843-494c-bf93-d2171a26281a/bin/uautomizer-verify-aQ6SnzHsRB/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 (23)] Waiting until timeout for monitored process