./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd --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 d1bf3ccbc41d82475637fe8f43837fac9590c3a6be7f8985790f4258a4d74c90 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:03:06,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:03:06,331 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:03:06,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:03:06,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:03:06,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:03:06,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:03:06,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:03:06,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:03:06,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:03:06,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:03:06,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:03:06,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:03:06,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:03:06,384 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:03:06,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:03:06,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:03:06,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:03:06,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:03:06,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:03:06,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:03:06,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:03:06,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:03:06,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:03:06,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:03:06,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:03:06,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:03:06,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:03:06,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:03:06,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:03:06,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:03:06,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:03:06,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:03:06,387 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_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd 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 -> d1bf3ccbc41d82475637fe8f43837fac9590c3a6be7f8985790f4258a4d74c90 [2024-11-13 14:03:06,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:03:06,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:03:06,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:03:06,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:03:06,754 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:03:06,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i Unable to find full path for "g++" [2024-11-13 14:03:08,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:03:09,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:03:09,260 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i [2024-11-13 14:03:09,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/data/69ef55b22/86dda3629fa04af4975de2a8269fcd58/FLAGdf4323859 [2024-11-13 14:03:09,302 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/data/69ef55b22/86dda3629fa04af4975de2a8269fcd58 [2024-11-13 14:03:09,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:03:09,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:03:09,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:09,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:03:09,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:03:09,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:09,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1545038d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09, skipping insertion in model container [2024-11-13 14:03:09,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:09,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:03:09,550 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_ca28aa3d-90db-496e-aebc-a6cbb09d5960/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i[916,929] [2024-11-13 14:03:09,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:09,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:03:09,698 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_ca28aa3d-90db-496e-aebc-a6cbb09d5960/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i[916,929] [2024-11-13 14:03:09,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:09,815 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:03:09,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09 WrapperNode [2024-11-13 14:03:09,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:09,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:09,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:03:09,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:03:09,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:09,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:09,932 INFO L138 Inliner]: procedures = 29, calls = 198, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 604 [2024-11-13 14:03:09,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:09,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:03:09,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:03:09,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:03:09,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:09,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:09,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:10,027 INFO L175 MemorySlicer]: Split 150 memory accesses to 17 slices as follows [2, 3, 6, 6, 9, 6, 12, 20, 10, 8, 6, 9, 8, 11, 8, 8, 18]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 20 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1]. [2024-11-13 14:03:10,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:10,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:10,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:10,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:10,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:10,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:10,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:03:10,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:03:10,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:03:10,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:03:10,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (1/1) ... [2024-11-13 14:03:10,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:03:10,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:03:10,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:03:10,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:03:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:03:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 14:03:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 14:03:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 14:03:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 14:03:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 14:03:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 14:03:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-13 14:03:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-13 14:03:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-13 14:03:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-13 14:03:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-13 14:03:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-13 14:03:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-13 14:03:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-13 14:03:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-13 14:03:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-13 14:03:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2024-11-13 14:03:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:03:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:03:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:03:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 14:03:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 14:03:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 14:03:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-13 14:03:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-13 14:03:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-13 14:03:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-13 14:03:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-13 14:03:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-13 14:03:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-13 14:03:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-13 14:03:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-13 14:03:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-13 14:03:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-13 14:03:10,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 14:03:10,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 14:03:10,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-13 14:03:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-13 14:03:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 14:03:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 14:03:10,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 14:03:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-13 14:03:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-13 14:03:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-13 14:03:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-13 14:03:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-13 14:03:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-13 14:03:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-13 14:03:10,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-13 14:03:10,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-13 14:03:10,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-13 14:03:10,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2024-11-13 14:03:10,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:03:10,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:03:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:03:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-13 14:03:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-13 14:03:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-13 14:03:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-13 14:03:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:03:10,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:03:10,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:03:10,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:03:11,403 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-11-13 14:03:11,403 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:03:11,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:03:11,425 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:03:11,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:11 BoogieIcfgContainer [2024-11-13 14:03:11,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:03:11,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:03:11,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:03:11,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:03:11,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:03:09" (1/3) ... [2024-11-13 14:03:11,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ae71c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:03:11, skipping insertion in model container [2024-11-13 14:03:11,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:09" (2/3) ... [2024-11-13 14:03:11,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ae71c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:03:11, skipping insertion in model container [2024-11-13 14:03:11,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:11" (3/3) ... [2024-11-13 14:03:11,441 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-14.i [2024-11-13 14:03:11,461 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:03:11,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-14.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:03:11,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:03:11,571 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;@4209c7d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:03:11,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:03:11,576 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-13 14:03:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:03:11,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:11,592 INFO L215 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-13 14:03:11,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1550381836, now seen corresponding path program 1 times [2024-11-13 14:03:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874281489] [2024-11-13 14:03:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:12,338 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-13 14:03:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874281489] [2024-11-13 14:03:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874281489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:12,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:12,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:03:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109940221] [2024-11-13 14:03:12,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:12,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:03:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:12,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:03:12,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:03:12,368 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 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-13 14:03:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:12,410 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-13 14:03:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:03:12,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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 168 [2024-11-13 14:03:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:12,419 INFO L225 Difference]: With dead ends: 249 [2024-11-13 14:03:12,421 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 14:03:12,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-13 14:03:12,430 INFO L432 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-13 14:03:12,431 INFO L433 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-13 14:03:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 14:03:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-13 14:03:12,485 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-13 14:03:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-13 14:03:12,492 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-13 14:03:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:12,493 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-13 14:03:12,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-13 14:03:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-13 14:03:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:03:12,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:12,497 INFO L215 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-13 14:03:12,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:03:12,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:12,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1157563414, now seen corresponding path program 1 times [2024-11-13 14:03:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:12,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10322259] [2024-11-13 14:03:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:13,512 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-13 14:03:13,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10322259] [2024-11-13 14:03:13,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10322259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:13,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:13,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:03:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889574529] [2024-11-13 14:03:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:13,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:03:13,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:13,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:03:13,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:03:13,521 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), 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-13 14:03:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:13,816 INFO L93 Difference]: Finished difference Result 367 states and 544 transitions. [2024-11-13 14:03:13,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:03:13,822 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-13 14:03:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:13,829 INFO L225 Difference]: With dead ends: 367 [2024-11-13 14:03:13,829 INFO L226 Difference]: Without dead ends: 246 [2024-11-13 14:03:13,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-13 14:03:13,831 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 184 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:13,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 523 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:03:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-13 14:03:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 218. [2024-11-13 14:03:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 173 states have internal predecessors, (239), 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-13 14:03:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 323 transitions. [2024-11-13 14:03:13,885 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 323 transitions. Word has length 168 [2024-11-13 14:03:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:13,886 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 323 transitions. [2024-11-13 14:03:13,886 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-13 14:03:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2024-11-13 14:03:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:03:13,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:13,890 INFO L215 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-13 14:03:13,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:03:13,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:13,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1023549908, now seen corresponding path program 1 times [2024-11-13 14:03:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:13,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010230009] [2024-11-13 14:03:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:15,335 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-13 14:03:15,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010230009] [2024-11-13 14:03:15,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010230009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:15,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:15,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:15,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395737522] [2024-11-13 14:03:15,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:15,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:03:15,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:03:15,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:03:15,338 INFO L87 Difference]: Start difference. First operand 218 states and 323 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-13 14:03:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:15,595 INFO L93 Difference]: Finished difference Result 349 states and 518 transitions. [2024-11-13 14:03:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:03:15,596 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-13 14:03:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:15,599 INFO L225 Difference]: With dead ends: 349 [2024-11-13 14:03:15,599 INFO L226 Difference]: Without dead ends: 222 [2024-11-13 14:03:15,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:03:15,601 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 183 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:15,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 468 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:03:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-13 14:03:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2024-11-13 14:03:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 175 states have internal predecessors, (241), 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-13 14:03:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 325 transitions. [2024-11-13 14:03:15,633 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 325 transitions. Word has length 168 [2024-11-13 14:03:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:15,634 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 325 transitions. [2024-11-13 14:03:15,635 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-13 14:03:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 325 transitions. [2024-11-13 14:03:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:03:15,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:15,638 INFO L215 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-13 14:03:15,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:03:15,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:15,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2034667158, now seen corresponding path program 1 times [2024-11-13 14:03:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:15,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216171062] [2024-11-13 14:03:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:16,468 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-13 14:03:16,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:16,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216171062] [2024-11-13 14:03:16,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216171062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:16,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:16,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:16,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279551095] [2024-11-13 14:03:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:16,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:03:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:03:16,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:03:16,472 INFO L87 Difference]: Start difference. First operand 220 states and 325 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-13 14:03:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:16,652 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2024-11-13 14:03:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:03:16,653 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-13 14:03:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:16,658 INFO L225 Difference]: With dead ends: 455 [2024-11-13 14:03:16,659 INFO L226 Difference]: Without dead ends: 333 [2024-11-13 14:03:16,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-13 14:03:16,661 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 146 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:16,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1104 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:03:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-13 14:03:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 230. [2024-11-13 14:03:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.3783783783783783) internal successors, (255), 185 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-13 14:03:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 339 transitions. [2024-11-13 14:03:16,741 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 339 transitions. Word has length 168 [2024-11-13 14:03:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:16,742 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 339 transitions. [2024-11-13 14:03:16,742 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-13 14:03:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 339 transitions. [2024-11-13 14:03:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:03:16,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:16,747 INFO L215 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-13 14:03:16,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:03:16,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:16,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash -256313770, now seen corresponding path program 1 times [2024-11-13 14:03:16,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:16,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120419353] [2024-11-13 14:03:16,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:16,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:17,830 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-13 14:03:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:17,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120419353] [2024-11-13 14:03:17,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120419353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:17,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:17,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:03:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054033496] [2024-11-13 14:03:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:17,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:03:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:03:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:03:17,833 INFO L87 Difference]: Start difference. First operand 230 states and 339 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-13 14:03:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:18,357 INFO L93 Difference]: Finished difference Result 486 states and 717 transitions. [2024-11-13 14:03:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:03:18,358 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-13 14:03:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:18,361 INFO L225 Difference]: With dead ends: 486 [2024-11-13 14:03:18,361 INFO L226 Difference]: Without dead ends: 352 [2024-11-13 14:03:18,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 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-13 14:03:18,363 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 563 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:18,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 543 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:03:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-13 14:03:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 226. [2024-11-13 14:03:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.3535911602209945) internal successors, (245), 181 states have internal predecessors, (245), 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-13 14:03:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2024-11-13 14:03:18,402 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 168 [2024-11-13 14:03:18,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:18,403 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2024-11-13 14:03:18,403 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-13 14:03:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2024-11-13 14:03:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:03:18,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:18,406 INFO L215 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-13 14:03:18,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:03:18,406 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:18,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:18,407 INFO L85 PathProgramCache]: Analyzing trace with hash -410909713, now seen corresponding path program 1 times [2024-11-13 14:03:18,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:18,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907337009] [2024-11-13 14:03:18,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:18,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 14:03:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907337009] [2024-11-13 14:03:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907337009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:03:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342008570] [2024-11-13 14:03:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:20,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:03:20,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:03:20,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:03:20,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:03:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:20,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 14:03:20,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:03:21,232 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-13 14:03:21,658 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 11 treesize of output 7 [2024-11-13 14:03:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 10 proven. 470 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-13 14:03:21,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:03:22,232 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 28 [2024-11-13 14:03:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 14:03:22,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342008570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:03:22,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:03:22,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 17 [2024-11-13 14:03:22,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13857867] [2024-11-13 14:03:22,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:03:22,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:03:22,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:22,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:03:22,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:03:22,408 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 17 states, 13 states have (on average 7.153846153846154) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 3 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-13 14:03:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:24,055 INFO L93 Difference]: Finished difference Result 509 states and 727 transitions. [2024-11-13 14:03:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 14:03:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 7.153846153846154) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 3 states have call predecessors, (44), 6 states have call successors, (44) Word has length 170 [2024-11-13 14:03:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:24,059 INFO L225 Difference]: With dead ends: 509 [2024-11-13 14:03:24,059 INFO L226 Difference]: Without dead ends: 374 [2024-11-13 14:03:24,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2024-11-13 14:03:24,063 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1061 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:24,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 1316 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:03:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-13 14:03:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 238. [2024-11-13 14:03:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 191 states have (on average 1.324607329842932) internal successors, (253), 191 states have internal predecessors, (253), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 14:03:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 337 transitions. [2024-11-13 14:03:24,121 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 337 transitions. Word has length 170 [2024-11-13 14:03:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:24,124 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 337 transitions. [2024-11-13 14:03:24,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 7.153846153846154) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 3 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-13 14:03:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 337 transitions. [2024-11-13 14:03:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:03:24,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:24,127 INFO L215 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-13 14:03:24,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:03:24,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:03:24,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:24,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -323281937, now seen corresponding path program 1 times [2024-11-13 14:03:24,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:24,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540735950] [2024-11-13 14:03:24,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 14:03:28,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:28,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540735950] [2024-11-13 14:03:28,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540735950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:03:28,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392293697] [2024-11-13 14:03:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:28,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:03:28,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:03:28,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:03:28,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:03:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:29,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 14:03:29,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:03:30,108 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-13 14:03:30,920 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-13 14:03:32,393 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 100 treesize of output 87 [2024-11-13 14:03:32,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 22 [2024-11-13 14:03:32,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 24 [2024-11-13 14:03:32,643 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 11 [2024-11-13 14:03:32,832 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 46 treesize of output 34 [2024-11-13 14:03:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 480 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-13 14:03:33,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:03:34,652 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 89 treesize of output 85 [2024-11-13 14:03:34,670 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2024-11-13 14:03:34,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 1 [2024-11-13 14:03:34,778 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-13 14:03:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392293697] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:03:34,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:03:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 26] total 46 [2024-11-13 14:03:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434768999] [2024-11-13 14:03:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:34,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:03:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:34,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:03:34,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1849, Unknown=0, NotChecked=0, Total=2070 [2024-11-13 14:03:34,781 INFO L87 Difference]: Start difference. First operand 238 states and 337 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-13 14:03:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:35,625 INFO L93 Difference]: Finished difference Result 452 states and 636 transitions. [2024-11-13 14:03:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:03:35,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 170 [2024-11-13 14:03:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:35,629 INFO L225 Difference]: With dead ends: 452 [2024-11-13 14:03:35,630 INFO L226 Difference]: Without dead ends: 321 [2024-11-13 14:03:35,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=266, Invalid=2184, Unknown=0, NotChecked=0, Total=2450 [2024-11-13 14:03:35,633 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 405 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:35,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1395 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:03:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-13 14:03:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2024-11-13 14:03:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 262 states have (on average 1.33206106870229) internal successors, (349), 263 states have internal predecessors, (349), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:03:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 445 transitions. [2024-11-13 14:03:35,678 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 445 transitions. Word has length 170 [2024-11-13 14:03:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:35,679 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 445 transitions. [2024-11-13 14:03:35,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-13 14:03:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 445 transitions. [2024-11-13 14:03:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 14:03:35,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:35,681 INFO L215 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-13 14:03:35,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:03:35,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 14:03:35,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:35,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash 783461653, now seen corresponding path program 1 times [2024-11-13 14:03:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:35,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818922335] [2024-11-13 14:03:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:35,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:37,412 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-13 14:03:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:37,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818922335] [2024-11-13 14:03:37,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818922335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:37,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:37,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:03:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360047177] [2024-11-13 14:03:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:37,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:03:37,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:37,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:03:37,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:03:37,415 INFO L87 Difference]: Start difference. First operand 317 states and 445 transitions. Second operand has 12 states, 10 states have (on average 7.3) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-13 14:03:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:38,090 INFO L93 Difference]: Finished difference Result 652 states and 906 transitions. [2024-11-13 14:03:38,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:03:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 175 [2024-11-13 14:03:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:38,096 INFO L225 Difference]: With dead ends: 652 [2024-11-13 14:03:38,097 INFO L226 Difference]: Without dead ends: 446 [2024-11-13 14:03:38,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:03:38,099 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 368 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:38,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1141 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:03:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-13 14:03:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 443. [2024-11-13 14:03:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 369 states have (on average 1.3062330623306233) internal successors, (482), 372 states have internal predecessors, (482), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:03:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 610 transitions. [2024-11-13 14:03:38,168 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 610 transitions. Word has length 175 [2024-11-13 14:03:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:38,168 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 610 transitions. [2024-11-13 14:03:38,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-13 14:03:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 610 transitions. [2024-11-13 14:03:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:03:38,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:38,171 INFO L215 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-13 14:03:38,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:03:38,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:38,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -775448845, now seen corresponding path program 1 times [2024-11-13 14:03:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:38,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776121983] [2024-11-13 14:03:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:39,204 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-13 14:03:39,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:39,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776121983] [2024-11-13 14:03:39,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776121983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:39,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:39,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:03:39,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32292598] [2024-11-13 14:03:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:39,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:03:39,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:39,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:03:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:03:39,207 INFO L87 Difference]: Start difference. First operand 443 states and 610 transitions. Second operand has 8 states, 8 states have (on average 9.375) 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), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:03:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:39,638 INFO L93 Difference]: Finished difference Result 740 states and 1006 transitions. [2024-11-13 14:03:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:03:39,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) 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), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-13 14:03:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:39,644 INFO L225 Difference]: With dead ends: 740 [2024-11-13 14:03:39,644 INFO L226 Difference]: Without dead ends: 738 [2024-11-13 14:03:39,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:03:39,645 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 283 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:39,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1032 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:03:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-13 14:03:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 734. [2024-11-13 14:03:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 628 states have (on average 1.2961783439490446) internal successors, (814), 635 states have internal predecessors, (814), 92 states have call successors, (92), 13 states have call predecessors, (92), 13 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 14:03:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 998 transitions. [2024-11-13 14:03:39,728 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 998 transitions. Word has length 177 [2024-11-13 14:03:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:39,729 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 998 transitions. [2024-11-13 14:03:39,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) 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), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:03:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 998 transitions. [2024-11-13 14:03:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:03:39,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:39,732 INFO L215 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-13 14:03:39,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:03:39,732 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:39,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash 596624495, now seen corresponding path program 1 times [2024-11-13 14:03:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:39,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772375676] [2024-11-13 14:03:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:40,320 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-13 14:03:40,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:40,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772375676] [2024-11-13 14:03:40,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772375676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:40,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:40,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697308250] [2024-11-13 14:03:40,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:40,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:03:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:40,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:03:40,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:03:40,324 INFO L87 Difference]: Start difference. First operand 734 states and 998 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-13 14:03:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:40,462 INFO L93 Difference]: Finished difference Result 1343 states and 1821 transitions. [2024-11-13 14:03:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:03:40,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-13 14:03:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:40,467 INFO L225 Difference]: With dead ends: 1343 [2024-11-13 14:03:40,469 INFO L226 Difference]: Without dead ends: 760 [2024-11-13 14:03:40,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-13 14:03:40,474 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 90 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:40,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 518 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:03:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-13 14:03:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 758. [2024-11-13 14:03:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 647 states have (on average 1.2874806800618237) internal successors, (833), 654 states have internal predecessors, (833), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 14:03:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1017 transitions. [2024-11-13 14:03:40,581 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1017 transitions. Word has length 177 [2024-11-13 14:03:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:40,581 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1017 transitions. [2024-11-13 14:03:40,582 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-13 14:03:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1017 transitions. [2024-11-13 14:03:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:03:40,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:40,585 INFO L215 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-13 14:03:40,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:03:40,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1297689073, now seen corresponding path program 1 times [2024-11-13 14:03:40,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:40,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62733513] [2024-11-13 14:03:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,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-13 14:03:41,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:41,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62733513] [2024-11-13 14:03:41,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62733513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:41,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:41,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:03:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523229365] [2024-11-13 14:03:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:41,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:03:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:41,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:03:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:03:41,095 INFO L87 Difference]: Start difference. First operand 758 states and 1017 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-13 14:03:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:41,263 INFO L93 Difference]: Finished difference Result 1597 states and 2157 transitions. [2024-11-13 14:03:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:03:41,264 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-13 14:03:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:41,269 INFO L225 Difference]: With dead ends: 1597 [2024-11-13 14:03:41,270 INFO L226 Difference]: Without dead ends: 994 [2024-11-13 14:03:41,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:03:41,272 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 95 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:41,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 859 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:03:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-13 14:03:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 892. [2024-11-13 14:03:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 781 states have (on average 1.2919334186939821) internal successors, (1009), 788 states have internal predecessors, (1009), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 14:03:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1193 transitions. [2024-11-13 14:03:41,366 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1193 transitions. Word has length 177 [2024-11-13 14:03:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:41,366 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1193 transitions. [2024-11-13 14:03:41,366 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-13 14:03:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1193 transitions. [2024-11-13 14:03:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:03:41,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:41,370 INFO L215 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-13 14:03:41,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:03:41,370 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:41,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:41,370 INFO L85 PathProgramCache]: Analyzing trace with hash 710883059, now seen corresponding path program 1 times [2024-11-13 14:03:41,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064841896] [2024-11-13 14:03:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:41,805 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-13 14:03:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064841896] [2024-11-13 14:03:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064841896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:41,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:41,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733005781] [2024-11-13 14:03:41,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:41,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:03:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:41,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:03:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:03:41,807 INFO L87 Difference]: Start difference. First operand 892 states and 1193 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-13 14:03:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:42,052 INFO L93 Difference]: Finished difference Result 2340 states and 3125 transitions. [2024-11-13 14:03:42,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:03:42,052 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-13 14:03:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:42,063 INFO L225 Difference]: With dead ends: 2340 [2024-11-13 14:03:42,063 INFO L226 Difference]: Without dead ends: 1635 [2024-11-13 14:03:42,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-13 14:03:42,066 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 147 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:42,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 871 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:03:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-13 14:03:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1216. [2024-11-13 14:03:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1105 states have (on average 1.2877828054298643) internal successors, (1423), 1112 states have internal predecessors, (1423), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 14:03:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1607 transitions. [2024-11-13 14:03:42,178 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1607 transitions. Word has length 177 [2024-11-13 14:03:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:42,178 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1607 transitions. [2024-11-13 14:03:42,178 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-13 14:03:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1607 transitions. [2024-11-13 14:03:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:03:42,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:42,182 INFO L215 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-13 14:03:42,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:03:42,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:42,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1771122831, now seen corresponding path program 1 times [2024-11-13 14:03:42,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:42,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061018512] [2024-11-13 14:03:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:42,616 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-13 14:03:42,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061018512] [2024-11-13 14:03:42,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061018512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:42,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:42,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303913214] [2024-11-13 14:03:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:42,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:03:42,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:42,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:03:42,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:03:42,618 INFO L87 Difference]: Start difference. First operand 1216 states and 1607 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-13 14:03:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:42,792 INFO L93 Difference]: Finished difference Result 2297 states and 3047 transitions. [2024-11-13 14:03:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:03:42,793 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-13 14:03:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:42,800 INFO L225 Difference]: With dead ends: 2297 [2024-11-13 14:03:42,801 INFO L226 Difference]: Without dead ends: 1354 [2024-11-13 14:03:42,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-13 14:03:42,804 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 92 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:42,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 626 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:03:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-11-13 14:03:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1348. [2024-11-13 14:03:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1225 states have (on average 1.2857142857142858) internal successors, (1575), 1236 states have internal predecessors, (1575), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (100), 89 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 14:03:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1775 transitions. [2024-11-13 14:03:42,933 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1775 transitions. Word has length 177 [2024-11-13 14:03:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:42,933 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1775 transitions. [2024-11-13 14:03:42,934 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-13 14:03:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1775 transitions. [2024-11-13 14:03:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:03:42,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:42,937 INFO L215 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-13 14:03:42,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:03:42,938 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash 152105203, now seen corresponding path program 1 times [2024-11-13 14:03:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188431625] [2024-11-13 14:03:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:43,531 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-13 14:03:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:43,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188431625] [2024-11-13 14:03:43,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188431625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:43,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:43,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:03:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810413961] [2024-11-13 14:03:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:43,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:03:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:03:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:03:43,533 INFO L87 Difference]: Start difference. First operand 1348 states and 1775 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-13 14:03:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:43,773 INFO L93 Difference]: Finished difference Result 2697 states and 3547 transitions. [2024-11-13 14:03:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:03:43,774 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-13 14:03:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:43,782 INFO L225 Difference]: With dead ends: 2697 [2024-11-13 14:03:43,782 INFO L226 Difference]: Without dead ends: 1586 [2024-11-13 14:03:43,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:03:43,785 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 85 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:43,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 989 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:03:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-13 14:03:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1404. [2024-11-13 14:03:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1281 states have (on average 1.2669789227166277) internal successors, (1623), 1292 states have internal predecessors, (1623), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (100), 89 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 14:03:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1823 transitions. [2024-11-13 14:03:43,911 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1823 transitions. Word has length 177 [2024-11-13 14:03:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:43,912 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1823 transitions. [2024-11-13 14:03:43,912 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-13 14:03:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1823 transitions. [2024-11-13 14:03:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:03:43,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:43,916 INFO L215 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-13 14:03:43,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:03:43,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:43,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2097086453, now seen corresponding path program 1 times [2024-11-13 14:03:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:43,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286823860] [2024-11-13 14:03:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,101 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-13 14:03:44,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286823860] [2024-11-13 14:03:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286823860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:44,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:44,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:03:44,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895575315] [2024-11-13 14:03:44,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:44,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:03:44,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:44,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:03:44,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:03:44,103 INFO L87 Difference]: Start difference. First operand 1404 states and 1823 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-13 14:03:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:44,237 INFO L93 Difference]: Finished difference Result 2311 states and 3022 transitions. [2024-11-13 14:03:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:03:44,237 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-13 14:03:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:44,244 INFO L225 Difference]: With dead ends: 2311 [2024-11-13 14:03:44,244 INFO L226 Difference]: Without dead ends: 1130 [2024-11-13 14:03:44,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-13 14:03:44,247 INFO L432 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-13 14:03:44,247 INFO L433 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-13 14:03:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-13 14:03:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2024-11-13 14:03:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1007 states have (on average 1.2641509433962264) internal successors, (1273), 1018 states have internal predecessors, (1273), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (100), 89 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 14:03:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1473 transitions. [2024-11-13 14:03:44,401 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1473 transitions. Word has length 177 [2024-11-13 14:03:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:44,401 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1473 transitions. [2024-11-13 14:03:44,401 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-13 14:03:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1473 transitions. [2024-11-13 14:03:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:03:44,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:44,404 INFO L215 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-13 14:03:44,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:03:44,405 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:44,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1538308597, now seen corresponding path program 1 times [2024-11-13 14:03:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888626087] [2024-11-13 14:03:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:03:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:03:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:03:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:03:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:03:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:03:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:03:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:03:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:03:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:03:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:03:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:03:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:03:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:03:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:03:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:03:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:03:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:03:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:03:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 14:03:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:03:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:44,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-13 14:03:44,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:44,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888626087] [2024-11-13 14:03:44,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888626087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:44,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017228233] [2024-11-13 14:03:44,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:44,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:03:44,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:44,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:03:44,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:03:44,829 INFO L87 Difference]: Start difference. First operand 1130 states and 1473 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-13 14:03:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:45,092 INFO L93 Difference]: Finished difference Result 2248 states and 2943 transitions. [2024-11-13 14:03:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:03:45,093 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-13 14:03:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:45,101 INFO L225 Difference]: With dead ends: 2248 [2024-11-13 14:03:45,101 INFO L226 Difference]: Without dead ends: 1341 [2024-11-13 14:03:45,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-13 14:03:45,105 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 143 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:45,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 756 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:03:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-13 14:03:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1118. [2024-11-13 14:03:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 995 states have (on average 1.2552763819095478) internal successors, (1249), 1006 states have internal predecessors, (1249), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (100), 89 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 14:03:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1449 transitions. [2024-11-13 14:03:45,235 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1449 transitions. Word has length 177 [2024-11-13 14:03:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:45,236 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1449 transitions. [2024-11-13 14:03:45,236 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-13 14:03:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1449 transitions. [2024-11-13 14:03:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 14:03:45,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:45,260 INFO L215 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-13 14:03:45,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:03:45,260 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:45,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1993783350, now seen corresponding path program 1 times [2024-11-13 14:03:45,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:45,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345081513] [2024-11-13 14:03:45,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:45,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:45,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:03:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:03:45,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:03:45,819 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:03:45,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:03:45,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:03:45,827 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:46,198 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:03:46,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:03:46 BoogieIcfgContainer [2024-11-13 14:03:46,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:03:46,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:03:46,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:03:46,206 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:03:46,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:11" (3/4) ... [2024-11-13 14:03:46,209 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:03:46,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:03:46,211 INFO L158 Benchmark]: Toolchain (without parser) took 36905.14ms. Allocated memory was 117.4MB in the beginning and 578.8MB in the end (delta: 461.4MB). Free memory was 91.6MB in the beginning and 393.1MB in the end (delta: -301.5MB). Peak memory consumption was 159.7MB. Max. memory is 16.1GB. [2024-11-13 14:03:46,211 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 83.9MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:03:46,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.26ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:03:46,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.39ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 73.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:03:46,212 INFO L158 Benchmark]: Boogie Preprocessor took 155.21ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 67.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:03:46,215 INFO L158 Benchmark]: RCFGBuilder took 1339.01ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 72.8MB in the end (delta: -5.7MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-11-13 14:03:46,215 INFO L158 Benchmark]: TraceAbstraction took 34773.73ms. Allocated memory was 117.4MB in the beginning and 578.8MB in the end (delta: 461.4MB). Free memory was 72.2MB in the beginning and 393.2MB in the end (delta: -321.0MB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. [2024-11-13 14:03:46,216 INFO L158 Benchmark]: Witness Printer took 4.89ms. Allocated memory is still 578.8MB. Free memory was 393.2MB in the beginning and 393.1MB in the end (delta: 52.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:03:46,217 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 83.9MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.26ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.39ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 73.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 155.21ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 67.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1339.01ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 72.8MB in the end (delta: -5.7MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 34773.73ms. Allocated memory was 117.4MB in the beginning and 578.8MB in the end (delta: 461.4MB). Free memory was 72.2MB in the beginning and 393.2MB in the end (delta: -321.0MB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. * Witness Printer took 4.89ms. Allocated memory is still 578.8MB. Free memory was 393.2MB in the beginning and 393.1MB in the end (delta: 52.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000; [L22] signed long int var_1_1 = 1000000; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_3 = 1; [L26] unsigned char var_1_3 = 1; [L27] unsigned char* var_1_3_Pointer = &(var_1_3); [L28] signed short int var_1_5 = -64; [L28] signed short int var_1_5 = -64; [L29] signed short int* var_1_5_Pointer = &(var_1_5); [L30] signed short int var_1_6 = -64; [L30] signed short int var_1_6 = -64; [L31] signed short int* var_1_6_Pointer = &(var_1_6); [L32] signed short int var_1_7 = 10; [L32] signed short int var_1_7 = 10; [L33] signed short int* var_1_7_Pointer = &(var_1_7); [L34] signed short int var_1_8 = 8; [L34] signed short int var_1_8 = 8; [L35] signed short int* var_1_8_Pointer = &(var_1_8); [L36] unsigned char var_1_9 = 0; [L36] unsigned char var_1_9 = 0; [L37] unsigned char* var_1_9_Pointer = &(var_1_9); [L38] unsigned char var_1_10 = 1; [L38] unsigned char var_1_10 = 1; [L39] unsigned char* var_1_10_Pointer = &(var_1_10); [L40] unsigned char var_1_11 = 0; [L40] unsigned char var_1_11 = 0; [L41] unsigned char* var_1_11_Pointer = &(var_1_11); [L42] unsigned short int var_1_12 = 2; [L42] unsigned short int var_1_12 = 2; [L43] unsigned short int* var_1_12_Pointer = &(var_1_12); [L44] float var_1_13 = 32.25; [L44] float var_1_13 = 32.25; [L45] float* var_1_13_Pointer = &(var_1_13); [L46] float var_1_14 = 15.5; [L46] float var_1_14 = 15.5; [L47] float* var_1_14_Pointer = &(var_1_14); [L48] float var_1_15 = 256.25; [L48] float var_1_15 = 256.25; [L49] float* var_1_15_Pointer = &(var_1_15); [L50] double var_1_16 = 8.6; [L50] double var_1_16 = 8.6; [L51] double* var_1_16_Pointer = &(var_1_16); [L52] unsigned short int var_1_17 = 57581; [L52] unsigned short int var_1_17 = 57581; [L53] unsigned short int* var_1_17_Pointer = &(var_1_17); [L54] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR \read(var_1_9) [L118] last_1_var_1_9 = var_1_9 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] var_1_3 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] var_1_6 = __VERIFIER_nondet_short() [L90] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] var_1_7 = __VERIFIER_nondet_short() [L93] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] var_1_8 = __VERIFIER_nondet_short() [L96] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] var_1_13 = __VERIFIER_nondet_float() [L105] EXPR \read(var_1_13) [L105] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F [L105] EXPR \read(var_1_13) [L105] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] var_1_14 = __VERIFIER_nondet_float() [L107] EXPR \read(var_1_14) [L107] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F [L107] EXPR \read(var_1_14) [L107] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] var_1_15 = __VERIFIER_nondet_float() [L110] EXPR \read(var_1_15) [L110] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F [L110] EXPR \read(var_1_15) [L110] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L111] var_1_16 = __VERIFIER_nondet_double() [L112] EXPR \read(var_1_16) [L112] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F [L112] EXPR \read(var_1_16) [L112] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] var_1_17 = __VERIFIER_nondet_ushort() [L114] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L129] RET updateVariables() [L130] CALL step() [L58] COND FALSE !(\read(last_1_var_1_9)) [L61] EXPR \read(*var_1_7_Pointer) [L61] EXPR \read(*var_1_8_Pointer) [L61] (*(var_1_5_Pointer)) = (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))) [L63] EXPR \read(*var_1_13_Pointer) [L63] EXPR \read(*var_1_14_Pointer) [L63] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L63] COND TRUE ((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer)) [L64] EXPR \read(*var_1_16_Pointer) [L64] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L64] COND TRUE ((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer)) [L65] EXPR \read(*var_1_17_Pointer) [L65] EXPR \read(*var_1_7_Pointer) [L65] (*(var_1_12_Pointer)) = ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))) [L72] EXPR \read(*var_1_5_Pointer) [L72] EXPR \read(*var_1_12_Pointer) [L72] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) [L72] EXPR \read(*var_1_2_Pointer) [L72] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) [L72] EXPR \read(*var_1_3_Pointer) [L72] (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] COND TRUE (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) [L73] EXPR \read(*var_1_10_Pointer) [L73] (*(var_1_9_Pointer)) = (! (*(var_1_10_Pointer))) [L77] EXPR \read(*var_1_9_Pointer) [L77] unsigned char stepLocal_0 = (*(var_1_9_Pointer)); [L78] stepLocal_0 && (*(var_1_9_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] stepLocal_0 && (*(var_1_9_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] COND FALSE !(stepLocal_0 && (*(var_1_9_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*var_1_9_Pointer) [L121] EXPR (*(var_1_9_Pointer)) && (*(var_1_9_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (*(var_1_9_Pointer)) && (*(var_1_9_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1 [L121] EXPR ((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))) [L121] EXPR \read(*var_1_5_Pointer) [L121] EXPR \read(*var_1_7_Pointer) [L121] EXPR \read(*var_1_8_Pointer) [L121] EXPR last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer))))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer))))))) [L121] EXPR \read(*var_1_5_Pointer) [L121] EXPR \read(*var_1_12_Pointer) [L121] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) [L121] EXPR \read(*var_1_2_Pointer) [L121] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) [L121] EXPR \read(*var_1_3_Pointer) [L121] EXPR (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))) [L121] EXPR \read(*var_1_9_Pointer) [L121] EXPR \read(*var_1_10_Pointer) [L121] EXPR ((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer))))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))))) && ((((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))))) && ((((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer))))) [L121] EXPR \read(*var_1_13_Pointer) [L121] EXPR \read(*var_1_14_Pointer) [L121] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer)))) [L121] EXPR \read(*var_1_12_Pointer) [L121] EXPR \read(*var_1_8_Pointer) [L121] EXPR (((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))))) && ((((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121-L122] return (((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))))) && ((((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer))))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.3s, OverallIterations: 17, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3845 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3845 mSDsluCounter, 12855 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9626 mSDsCounter, 600 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1924 IncrementalHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 600 mSolverCounterUnsat, 3229 mSDtfsCounter, 1924 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1535 GetRequests, 1367 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1404occurred in iteration=14, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1340 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 3289 NumberOfCodeBlocks, 3289 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3431 ConstructedInterpolants, 0 QuantifiedInterpolants, 18899 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1416 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 15751/16800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:03:46,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd --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 d1bf3ccbc41d82475637fe8f43837fac9590c3a6be7f8985790f4258a4d74c90 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:03:49,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:03:49,167 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:03:49,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:03:49,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:03:49,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:03:49,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:03:49,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:03:49,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:03:49,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:03:49,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:03:49,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:03:49,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:03:49,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:03:49,222 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:03:49,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:03:49,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:03:49,223 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:03:49,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:03:49,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:03:49,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:03:49,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:03:49,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:03:49,224 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:03:49,224 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:03:49,224 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:03:49,224 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:03:49,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:03:49,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:03:49,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:03:49,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:03:49,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:03:49,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:03:49,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:03:49,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:03:49,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:03:49,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:03:49,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:03:49,227 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:03:49,227 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:03:49,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:03:49,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:03:49,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:03:49,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:03:49,228 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_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd 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 -> d1bf3ccbc41d82475637fe8f43837fac9590c3a6be7f8985790f4258a4d74c90 [2024-11-13 14:03:49,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:03:49,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:03:49,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:03:49,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:03:49,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:03:49,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i Unable to find full path for "g++" Unable to find full path for "g++" [2024-11-13 14:03:52,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:03:53,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:03:53,014 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i [2024-11-13 14:03:53,031 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/data/a485fac00/27114abf6fa5407fac4aa91815efe3f0/FLAG782c5248f [2024-11-13 14:03:53,061 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/data/a485fac00/27114abf6fa5407fac4aa91815efe3f0 [2024-11-13 14:03:53,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:03:53,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:03:53,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:53,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:03:53,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:03:53,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b8ed24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53, skipping insertion in model container [2024-11-13 14:03:53,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:03:53,300 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_ca28aa3d-90db-496e-aebc-a6cbb09d5960/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i[916,929] [2024-11-13 14:03:53,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:53,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:03:53,462 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_ca28aa3d-90db-496e-aebc-a6cbb09d5960/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i[916,929] [2024-11-13 14:03:53,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:53,554 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:03:53,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53 WrapperNode [2024-11-13 14:03:53,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:53,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:53,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:03:53,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:03:53,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,623 INFO L138 Inliner]: procedures = 39, calls = 198, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 601 [2024-11-13 14:03:53,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:53,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:03:53,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:03:53,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:03:53,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,694 INFO L175 MemorySlicer]: Split 150 memory accesses to 17 slices as follows [2, 3, 6, 6, 9, 6, 12, 20, 10, 8, 6, 9, 8, 11, 8, 8, 18]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 20 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1]. [2024-11-13 14:03:53,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:03:53,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:03:53,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:03:53,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:03:53,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (1/1) ... [2024-11-13 14:03:53,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:03:53,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:03:53,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:03:53,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:03:53,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:03:53,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 14:03:53,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 14:03:53,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-13 14:03:53,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-13 14:03:53,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-13 14:03:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-13 14:03:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-13 14:03:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-13 14:03:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-13 14:03:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-13 14:03:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-13 14:03:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-13 14:03:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-13 14:03:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-13 14:03:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-13 14:03:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2024-11-13 14:03:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#16 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-13 14:03:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-13 14:03:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-13 14:03:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-13 14:03:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-13 14:03:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2024-11-13 14:03:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#16 [2024-11-13 14:03:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 14:03:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 14:03:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 14:03:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 14:03:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 14:03:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 14:03:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-13 14:03:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-13 14:03:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-13 14:03:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-13 14:03:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-13 14:03:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-13 14:03:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-13 14:03:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-13 14:03:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-13 14:03:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 14:03:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-13 14:03:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-13 14:03:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-13 14:03:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-13 14:03:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-13 14:03:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-13 14:03:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-13 14:03:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-13 14:03:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-13 14:03:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-13 14:03:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-13 14:03:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-13 14:03:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-13 14:03:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-13 14:03:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2024-11-13 14:03:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#16 [2024-11-13 14:03:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:03:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:03:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 14:03:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 14:03:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 14:03:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 14:03:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-13 14:03:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-13 14:03:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-13 14:03:53,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-13 14:03:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-13 14:03:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-13 14:03:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-13 14:03:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-13 14:03:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-13 14:03:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-11-13 14:03:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2024-11-13 14:03:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 14:03:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 14:03:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-13 14:03:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2024-11-13 14:03:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2024-11-13 14:03:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:03:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:03:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-13 14:03:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-13 14:03:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-13 14:03:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-13 14:03:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2024-11-13 14:03:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 14:03:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 14:03:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-13 14:03:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-13 14:03:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-13 14:03:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-13 14:03:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-13 14:03:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-13 14:03:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-13 14:03:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-13 14:03:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 14:03:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-11-13 14:03:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2024-11-13 14:03:54,453 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:03:54,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:04:01,226 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-13 14:04:01,227 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:04:01,245 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:04:01,245 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:04:01,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:04:01 BoogieIcfgContainer [2024-11-13 14:04:01,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:04:01,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:04:01,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:04:01,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:04:01,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:03:53" (1/3) ... [2024-11-13 14:04:01,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f5854d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:04:01, skipping insertion in model container [2024-11-13 14:04:01,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:53" (2/3) ... [2024-11-13 14:04:01,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f5854d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:04:01, skipping insertion in model container [2024-11-13 14:04:01,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:04:01" (3/3) ... [2024-11-13 14:04:01,261 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-14.i [2024-11-13 14:04:01,280 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:04:01,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-14.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:04:01,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:04:01,367 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;@f3d3730, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:04:01,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:04:01,374 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-13 14:04:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:04:01,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:01,397 INFO L215 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-13 14:04:01,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1550381836, now seen corresponding path program 1 times [2024-11-13 14:04:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872590992] [2024-11-13 14:04:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:01,421 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-13 14:04:01,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:01,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:01,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:02,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:04:02,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-13 14:04:02,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:02,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:02,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872590992] [2024-11-13 14:04:02,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872590992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:02,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:02,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:04:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026084292] [2024-11-13 14:04:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:02,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:04:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:02,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:04:02,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:04:02,455 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-13 14:04:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:02,506 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-13 14:04:02,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:04:02,509 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-13 14:04:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:02,520 INFO L225 Difference]: With dead ends: 249 [2024-11-13 14:04:02,521 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 14:04:02,525 INFO L431 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-13 14:04:02,532 INFO L432 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-13 14:04:02,533 INFO L433 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-13 14:04:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 14:04:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-13 14:04:02,586 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-13 14:04:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-13 14:04:02,599 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-13 14:04:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:02,599 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-13 14:04:02,599 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-13 14:04:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-13 14:04:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:04:02,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:02,608 INFO L215 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-13 14:04:02,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:04:02,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:02,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:02,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1157563414, now seen corresponding path program 1 times [2024-11-13 14:04:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:02,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046198414] [2024-11-13 14:04:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:02,814 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-13 14:04:02,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:02,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:02,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:03,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:04:03,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:03,665 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-13 14:04:04,602 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-13 14:04:04,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:04,603 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:04,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046198414] [2024-11-13 14:04:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046198414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:04,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:04,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:04:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658895787] [2024-11-13 14:04:04,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:04,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:04:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:04,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:04:04,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:04:04,610 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), 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-13 14:04:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:04,947 INFO L93 Difference]: Finished difference Result 382 states and 568 transitions. [2024-11-13 14:04:04,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:04:04,948 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-13 14:04:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:04,953 INFO L225 Difference]: With dead ends: 382 [2024-11-13 14:04:04,955 INFO L226 Difference]: Without dead ends: 261 [2024-11-13 14:04:04,956 INFO L431 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-13 14:04:04,957 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 205 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:04,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 545 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:04:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-13 14:04:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 218. [2024-11-13 14:04:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 173 states have internal predecessors, (239), 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-13 14:04:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 323 transitions. [2024-11-13 14:04:05,012 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 323 transitions. Word has length 168 [2024-11-13 14:04:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:05,012 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 323 transitions. [2024-11-13 14:04:05,013 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-13 14:04:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2024-11-13 14:04:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:04:05,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:05,016 INFO L215 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-13 14:04:05,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 14:04:05,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:05,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1023549908, now seen corresponding path program 1 times [2024-11-13 14:04:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825343894] [2024-11-13 14:04:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:05,218 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-13 14:04:05,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:05,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:05,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:05,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:04:05,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:08,650 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 51 treesize of output 38 [2024-11-13 14:04:08,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:04:08,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2024-11-13 14:04:08,684 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 49 treesize of output 33 [2024-11-13 14:04:08,725 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 15 treesize of output 4 [2024-11-13 14:04:08,835 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-13 14:04:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 39 proven. 467 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-13 14:04:08,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:04:09,023 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 40 treesize of output 36 [2024-11-13 14:04:09,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:04:09,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:09,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2024-11-13 14:04:10,528 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 14:04:10,529 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 30 treesize of output 25 [2024-11-13 14:04:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 63 proven. 54 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-13 14:04:10,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:10,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825343894] [2024-11-13 14:04:10,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825343894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:04:10,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:04:10,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-11-13 14:04:10,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093414033] [2024-11-13 14:04:10,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:04:10,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 14:04:10,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 14:04:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:04:10,994 INFO L87 Difference]: Start difference. First operand 218 states and 323 transitions. Second operand has 22 states, 18 states have (on average 6.555555555555555) internal successors, (118), 20 states have internal predecessors, (118), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:04:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:14,801 INFO L93 Difference]: Finished difference Result 540 states and 787 transitions. [2024-11-13 14:04:14,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 14:04:14,802 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 6.555555555555555) internal successors, (118), 20 states have internal predecessors, (118), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) Word has length 168 [2024-11-13 14:04:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:14,807 INFO L225 Difference]: With dead ends: 540 [2024-11-13 14:04:14,809 INFO L226 Difference]: Without dead ends: 395 [2024-11-13 14:04:14,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=533, Invalid=1629, Unknown=0, NotChecked=0, Total=2162 [2024-11-13 14:04:14,814 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 880 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:14,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1322 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 14:04:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-13 14:04:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 240. [2024-11-13 14:04:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 191 states have (on average 1.3455497382198953) internal successors, (257), 191 states have internal predecessors, (257), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 14:04:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 341 transitions. [2024-11-13 14:04:14,892 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 341 transitions. Word has length 168 [2024-11-13 14:04:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:14,893 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 341 transitions. [2024-11-13 14:04:14,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 6.555555555555555) internal successors, (118), 20 states have internal predecessors, (118), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:04:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 341 transitions. [2024-11-13 14:04:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:04:14,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:14,896 INFO L215 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-13 14:04:14,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:15,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:15,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:15,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash -256313770, now seen corresponding path program 1 times [2024-11-13 14:04:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804885152] [2024-11-13 14:04:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:15,098 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-13 14:04:15,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:15,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:15,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:15,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:04:15,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:17,991 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 51 treesize of output 38 [2024-11-13 14:04:18,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:04:18,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2024-11-13 14:04:18,014 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 49 treesize of output 33 [2024-11-13 14:04:18,056 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-13 14:04:18,122 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-13 14:04:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 39 proven. 467 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-13 14:04:18,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:04:18,300 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 40 treesize of output 36 [2024-11-13 14:04:18,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:04:18,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:18,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2024-11-13 14:04:19,443 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 14:04:19,443 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 30 treesize of output 25 [2024-11-13 14:04:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 63 proven. 54 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-13 14:04:19,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804885152] [2024-11-13 14:04:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804885152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:04:19,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:04:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-11-13 14:04:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481553724] [2024-11-13 14:04:19,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:04:19,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 14:04:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 14:04:19,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:04:19,917 INFO L87 Difference]: Start difference. First operand 240 states and 341 transitions. Second operand has 22 states, 18 states have (on average 6.722222222222222) internal successors, (121), 20 states have internal predecessors, (121), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:04:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:23,228 INFO L93 Difference]: Finished difference Result 556 states and 797 transitions. [2024-11-13 14:04:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 14:04:23,229 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 6.722222222222222) internal successors, (121), 20 states have internal predecessors, (121), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) Word has length 168 [2024-11-13 14:04:23,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:23,236 INFO L225 Difference]: With dead ends: 556 [2024-11-13 14:04:23,236 INFO L226 Difference]: Without dead ends: 397 [2024-11-13 14:04:23,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=533, Invalid=1629, Unknown=0, NotChecked=0, Total=2162 [2024-11-13 14:04:23,238 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1209 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:23,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 1185 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 14:04:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-13 14:04:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 248. [2024-11-13 14:04:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 199 states have (on average 1.3316582914572865) internal successors, (265), 199 states have internal predecessors, (265), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 14:04:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 349 transitions. [2024-11-13 14:04:23,278 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 349 transitions. Word has length 168 [2024-11-13 14:04:23,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:23,280 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 349 transitions. [2024-11-13 14:04:23,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 6.722222222222222) internal successors, (121), 20 states have internal predecessors, (121), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:04:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 349 transitions. [2024-11-13 14:04:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:04:23,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:23,283 INFO L215 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-13 14:04:23,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:23,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:23,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:23,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 702916246, now seen corresponding path program 1 times [2024-11-13 14:04:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:23,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333978600] [2024-11-13 14:04:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:23,485 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-13 14:04:23,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:23,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:23,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:24,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:04:24,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:24,144 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-13 14:04:24,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:24,144 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333978600] [2024-11-13 14:04:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333978600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:24,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:24,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:04:24,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217535285] [2024-11-13 14:04:24,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:24,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:04:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:24,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:04:24,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:04:24,147 INFO L87 Difference]: Start difference. First operand 248 states and 349 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-13 14:04:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:24,226 INFO L93 Difference]: Finished difference Result 419 states and 593 transitions. [2024-11-13 14:04:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:04:24,227 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-13 14:04:24,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:24,230 INFO L225 Difference]: With dead ends: 419 [2024-11-13 14:04:24,230 INFO L226 Difference]: Without dead ends: 252 [2024-11-13 14:04:24,231 INFO L431 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-13 14:04:24,232 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:24,232 INFO L433 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-13 14:04:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-13 14:04:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-13 14:04:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 203 states have internal predecessors, (269), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 14:04:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 353 transitions. [2024-11-13 14:04:24,265 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 353 transitions. Word has length 168 [2024-11-13 14:04:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:24,266 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 353 transitions. [2024-11-13 14:04:24,266 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-13 14:04:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 353 transitions. [2024-11-13 14:04:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:04:24,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:24,269 INFO L215 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-13 14:04:24,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 14:04:24,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:24,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:24,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash -323281937, now seen corresponding path program 1 times [2024-11-13 14:04:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349220067] [2024-11-13 14:04:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:24,471 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-13 14:04:24,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:24,473 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:24,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:25,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:04:25,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:26,261 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 29 treesize of output 25 [2024-11-13 14:04:26,811 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 90 treesize of output 78 [2024-11-13 14:04:26,819 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 78 treesize of output 66 [2024-11-13 14:04:26,825 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 76 treesize of output 60 [2024-11-13 14:04:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-13 14:04:26,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:04:27,710 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-13 14:04:27,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349220067] [2024-11-13 14:04:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349220067] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:04:27,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:04:27,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2024-11-13 14:04:27,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592670801] [2024-11-13 14:04:27,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:27,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:04:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:04:27,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:04:27,713 INFO L87 Difference]: Start difference. First operand 252 states and 353 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-13 14:04:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:35,805 INFO L93 Difference]: Finished difference Result 475 states and 663 transitions. [2024-11-13 14:04:35,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:04:35,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 170 [2024-11-13 14:04:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:35,809 INFO L225 Difference]: With dead ends: 475 [2024-11-13 14:04:35,809 INFO L226 Difference]: Without dead ends: 304 [2024-11-13 14:04:35,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:04:35,810 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 251 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:35,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 983 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-13 14:04:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-13 14:04:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2024-11-13 14:04:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 243 states have (on average 1.3209876543209877) internal successors, (321), 244 states have internal predecessors, (321), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:04:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 417 transitions. [2024-11-13 14:04:35,869 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 417 transitions. Word has length 170 [2024-11-13 14:04:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:35,870 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 417 transitions. [2024-11-13 14:04:35,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-13 14:04:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 417 transitions. [2024-11-13 14:04:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:04:35,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:35,874 INFO L215 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-13 14:04:35,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 14:04:36,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:36,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:36,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:36,075 INFO L85 PathProgramCache]: Analyzing trace with hash -945371400, now seen corresponding path program 1 times [2024-11-13 14:04:36,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:36,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233897017] [2024-11-13 14:04:36,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:36,076 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-13 14:04:36,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:36,078 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:36,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:36,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 14:04:36,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:38,711 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 42 treesize of output 26 [2024-11-13 14:04:38,760 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-13 14:04:38,822 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-13 14:04:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 39 proven. 467 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-13 14:04:38,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:04:38,941 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 26 treesize of output 22 [2024-11-13 14:04:38,947 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:04:38,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:38,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2024-11-13 14:04:40,187 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 14:04:40,188 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 30 treesize of output 25 [2024-11-13 14:04:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 63 proven. 54 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-13 14:04:40,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233897017] [2024-11-13 14:04:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233897017] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:04:40,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:04:40,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-13 14:04:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958370796] [2024-11-13 14:04:40,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:04:40,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 14:04:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:40,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 14:04:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:04:40,581 INFO L87 Difference]: Start difference. First operand 300 states and 417 transitions. Second operand has 23 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:04:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:43,312 INFO L93 Difference]: Finished difference Result 521 states and 724 transitions. [2024-11-13 14:04:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:04:43,313 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) Word has length 170 [2024-11-13 14:04:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:43,318 INFO L225 Difference]: With dead ends: 521 [2024-11-13 14:04:43,318 INFO L226 Difference]: Without dead ends: 306 [2024-11-13 14:04:43,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=378, Invalid=1104, Unknown=0, NotChecked=0, Total=1482 [2024-11-13 14:04:43,320 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 650 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:43,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1162 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 14:04:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-13 14:04:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2024-11-13 14:04:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 241 states have (on average 1.3070539419087137) internal successors, (315), 242 states have internal predecessors, (315), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:04:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 411 transitions. [2024-11-13 14:04:43,362 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 411 transitions. Word has length 170 [2024-11-13 14:04:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:43,362 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 411 transitions. [2024-11-13 14:04:43,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:04:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 411 transitions. [2024-11-13 14:04:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:04:43,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:43,366 INFO L215 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-13 14:04:43,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:43,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:43,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:43,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2069732218, now seen corresponding path program 1 times [2024-11-13 14:04:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:43,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513209226] [2024-11-13 14:04:43,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:43,568 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-13 14:04:43,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:43,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:43,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:44,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 14:04:44,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:46,121 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 42 treesize of output 26 [2024-11-13 14:04:46,172 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-13 14:04:46,247 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-13 14:04:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 39 proven. 467 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-13 14:04:46,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:04:46,389 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 26 treesize of output 22 [2024-11-13 14:04:46,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:04:46,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:46,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2024-11-13 14:04:47,526 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 14:04:47,526 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 30 treesize of output 25 [2024-11-13 14:04:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 63 proven. 54 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-13 14:04:47,997 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513209226] [2024-11-13 14:04:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513209226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:04:47,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:04:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-13 14:04:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474633391] [2024-11-13 14:04:47,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:04:47,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 14:04:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:47,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 14:04:48,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:04:48,003 INFO L87 Difference]: Start difference. First operand 298 states and 411 transitions. Second operand has 23 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:04:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:51,006 INFO L93 Difference]: Finished difference Result 511 states and 703 transitions. [2024-11-13 14:04:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:04:51,008 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) Word has length 170 [2024-11-13 14:04:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:51,010 INFO L225 Difference]: With dead ends: 511 [2024-11-13 14:04:51,010 INFO L226 Difference]: Without dead ends: 298 [2024-11-13 14:04:51,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=378, Invalid=1104, Unknown=0, NotChecked=0, Total=1482 [2024-11-13 14:04:51,012 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 511 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:51,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1144 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 14:04:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-13 14:04:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 280. [2024-11-13 14:04:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 223 states have (on average 1.3004484304932735) internal successors, (290), 224 states have internal predecessors, (290), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:04:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 386 transitions. [2024-11-13 14:04:51,038 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 386 transitions. Word has length 170 [2024-11-13 14:04:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:51,039 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 386 transitions. [2024-11-13 14:04:51,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:04:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 386 transitions. [2024-11-13 14:04:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 14:04:51,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:51,041 INFO L215 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-13 14:04:51,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:51,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:51,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:51,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash 783461653, now seen corresponding path program 1 times [2024-11-13 14:04:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987111716] [2024-11-13 14:04:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:51,243 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-13 14:04:51,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:51,245 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:51,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:51,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:04:51,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:53,969 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 51 treesize of output 38 [2024-11-13 14:04:53,972 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-13 14:04:53,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-11-13 14:04:54,406 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 141 treesize of output 109 [2024-11-13 14:04:54,434 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 107 treesize of output 87 [2024-11-13 14:04:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 39 proven. 467 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-13 14:04:54,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:04:55,254 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 40 treesize of output 36 [2024-11-13 14:04:55,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:04:55,272 INFO L349 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2024-11-13 14:04:55,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 1 [2024-11-13 14:04:55,499 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-13 14:04:55,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987111716] [2024-11-13 14:04:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987111716] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:04:55,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:04:55,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-11-13 14:04:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133013659] [2024-11-13 14:04:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:55,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:04:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:55,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:04:55,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:04:55,501 INFO L87 Difference]: Start difference. First operand 280 states and 386 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-13 14:04:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:55,922 INFO L93 Difference]: Finished difference Result 598 states and 819 transitions. [2024-11-13 14:04:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:04:55,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 175 [2024-11-13 14:04:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:55,926 INFO L225 Difference]: With dead ends: 598 [2024-11-13 14:04:55,926 INFO L226 Difference]: Without dead ends: 403 [2024-11-13 14:04:55,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:04:55,928 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 72 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:55,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 824 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:04:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-13 14:04:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2024-11-13 14:04:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 324 states have (on average 1.2808641975308641) internal successors, (415), 327 states have internal predecessors, (415), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:04:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 543 transitions. [2024-11-13 14:04:55,970 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 543 transitions. Word has length 175 [2024-11-13 14:04:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:55,970 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 543 transitions. [2024-11-13 14:04:55,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-13 14:04:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 543 transitions. [2024-11-13 14:04:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:04:55,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:55,973 INFO L215 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-13 14:04:55,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:56,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:56,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:56,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash -775448845, now seen corresponding path program 1 times [2024-11-13 14:04:56,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:56,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305894092] [2024-11-13 14:04:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:56,175 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-13 14:04:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:56,177 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:56,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:04:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:56,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:04:56,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:58,082 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-13 14:04:58,442 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-13 14:04:58,449 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 34 [2024-11-13 14:04:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 12 proven. 452 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-13 14:04:58,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:04:59,284 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-13 14:04:59,285 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:59,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305894092] [2024-11-13 14:04:59,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305894092] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:04:59,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:04:59,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2024-11-13 14:04:59,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646487589] [2024-11-13 14:04:59,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:59,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:04:59,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:59,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:04:59,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:04:59,287 INFO L87 Difference]: Start difference. First operand 400 states and 543 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-13 14:05:04,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:05:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:05,897 INFO L93 Difference]: Finished difference Result 654 states and 879 transitions. [2024-11-13 14:05:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:05:05,897 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-13 14:05:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:05,902 INFO L225 Difference]: With dead ends: 654 [2024-11-13 14:05:05,902 INFO L226 Difference]: Without dead ends: 652 [2024-11-13 14:05:05,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:05:05,903 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 67 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:05,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1100 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-13 14:05:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-13 14:05:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2024-11-13 14:05:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 540 states have (on average 1.2722222222222221) internal successors, (687), 547 states have internal predecessors, (687), 92 states have call successors, (92), 15 states have call predecessors, (92), 15 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 14:05:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 871 transitions. [2024-11-13 14:05:05,973 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 871 transitions. Word has length 177 [2024-11-13 14:05:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:05,974 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 871 transitions. [2024-11-13 14:05:05,974 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-13 14:05:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 871 transitions. [2024-11-13 14:05:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:05:05,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:05,976 INFO L215 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-13 14:05:05,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:06,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:06,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:06,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash 596624495, now seen corresponding path program 1 times [2024-11-13 14:05:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:06,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075660169] [2024-11-13 14:05:06,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:06,178 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-13 14:05:06,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:06,180 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:06,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:06,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 14:05:06,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 17 proven. 267 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-13 14:05:08,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:05:08,493 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-13 14:05:08,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:08,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075660169] [2024-11-13 14:05:08,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075660169] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:05:08,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:05:08,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-13 14:05:08,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453241756] [2024-11-13 14:05:08,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:08,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:05:08,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:08,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:05:08,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:05:08,496 INFO L87 Difference]: Start difference. First operand 648 states and 871 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-13 14:05:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:08,723 INFO L93 Difference]: Finished difference Result 1233 states and 1649 transitions. [2024-11-13 14:05:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:05:08,723 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-13 14:05:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:08,728 INFO L225 Difference]: With dead ends: 1233 [2024-11-13 14:05:08,728 INFO L226 Difference]: Without dead ends: 674 [2024-11-13 14:05:08,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:05:08,731 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 90 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:08,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 506 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:05:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-13 14:05:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 672. [2024-11-13 14:05:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 559 states have (on average 1.262969588550984) internal successors, (706), 566 states have internal predecessors, (706), 92 states have call successors, (92), 20 states have call predecessors, (92), 20 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 14:05:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 890 transitions. [2024-11-13 14:05:08,811 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 890 transitions. Word has length 177 [2024-11-13 14:05:08,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:08,829 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 890 transitions. [2024-11-13 14:05:08,829 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-13 14:05:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 890 transitions. [2024-11-13 14:05:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:05:08,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:08,831 INFO L215 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-13 14:05:08,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:09,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:09,032 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:09,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1297689073, now seen corresponding path program 1 times [2024-11-13 14:05:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956597138] [2024-11-13 14:05:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:09,033 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-13 14:05:09,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:09,035 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:09,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:09,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:05:09,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 19 proven. 137 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 14:05:11,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:05:11,664 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-13 14:05:11,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956597138] [2024-11-13 14:05:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956597138] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:05:11,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:05:11,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2024-11-13 14:05:11,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910440377] [2024-11-13 14:05:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:11,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:05:11,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:11,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:05:11,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:05:11,667 INFO L87 Difference]: Start difference. First operand 672 states and 890 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-13 14:05:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:11,977 INFO L93 Difference]: Finished difference Result 1433 states and 1905 transitions. [2024-11-13 14:05:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:05:11,978 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-13 14:05:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:11,983 INFO L225 Difference]: With dead ends: 1433 [2024-11-13 14:05:11,984 INFO L226 Difference]: Without dead ends: 854 [2024-11-13 14:05:11,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:05:11,987 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 130 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:11,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 838 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:05:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-13 14:05:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 752. [2024-11-13 14:05:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 639 states have (on average 1.2550860719874803) internal successors, (802), 646 states have internal predecessors, (802), 92 states have call successors, (92), 20 states have call predecessors, (92), 20 states have return successors, (92), 85 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 14:05:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 986 transitions. [2024-11-13 14:05:12,080 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 986 transitions. Word has length 177 [2024-11-13 14:05:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:12,080 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 986 transitions. [2024-11-13 14:05:12,081 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-13 14:05:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 986 transitions. [2024-11-13 14:05:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:05:12,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:12,084 INFO L215 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-13 14:05:12,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:05:12,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:12,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:12,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash 710883059, now seen corresponding path program 1 times [2024-11-13 14:05:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:12,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516655391] [2024-11-13 14:05:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:12,286 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-13 14:05:12,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:12,289 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:12,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:05:13,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:15,048 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 51 treesize of output 38 [2024-11-13 14:05:15,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:05:15,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2024-11-13 14:05:15,068 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 49 treesize of output 33 [2024-11-13 14:05:15,110 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-13 14:05:15,236 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-13 14:05:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 39 proven. 467 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-13 14:05:15,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:05:15,919 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 40 treesize of output 36 [2024-11-13 14:05:15,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:05:15,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:05:15,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2024-11-13 14:05:17,026 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 14:05:17,026 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 30 treesize of output 25 [2024-11-13 14:05:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 63 proven. 54 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-13 14:05:17,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:17,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516655391] [2024-11-13 14:05:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516655391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:05:17,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:05:17,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 28 [2024-11-13 14:05:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592307631] [2024-11-13 14:05:17,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:05:17,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 14:05:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:17,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 14:05:17,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:05:17,354 INFO L87 Difference]: Start difference. First operand 752 states and 986 transitions. Second operand has 28 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:05:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:22,150 INFO L93 Difference]: Finished difference Result 1562 states and 2059 transitions. [2024-11-13 14:05:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 14:05:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) Word has length 177 [2024-11-13 14:05:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:22,156 INFO L225 Difference]: With dead ends: 1562 [2024-11-13 14:05:22,157 INFO L226 Difference]: Without dead ends: 903 [2024-11-13 14:05:22,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=616, Invalid=2464, Unknown=0, NotChecked=0, Total=3080 [2024-11-13 14:05:22,160 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 723 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:22,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1854 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 14:05:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2024-11-13 14:05:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 798. [2024-11-13 14:05:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 671 states have (on average 1.2578241430700448) internal successors, (844), 678 states have internal predecessors, (844), 103 states have call successors, (103), 23 states have call predecessors, (103), 23 states have return successors, (103), 96 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-13 14:05:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1050 transitions. [2024-11-13 14:05:22,246 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1050 transitions. Word has length 177 [2024-11-13 14:05:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:22,246 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1050 transitions. [2024-11-13 14:05:22,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:05:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1050 transitions. [2024-11-13 14:05:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:05:22,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:22,249 INFO L215 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-13 14:05:22,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:22,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:22,450 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:22,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash -517687439, now seen corresponding path program 1 times [2024-11-13 14:05:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:22,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326695515] [2024-11-13 14:05:22,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:22,451 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-13 14:05:22,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:22,454 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:22,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:23,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 14:05:23,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 17 proven. 267 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-13 14:05:24,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:05:24,965 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-13 14:05:24,966 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:24,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326695515] [2024-11-13 14:05:24,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326695515] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:05:24,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:05:24,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 14:05:24,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145118831] [2024-11-13 14:05:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:24,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:05:24,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:24,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:05:24,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:05:24,968 INFO L87 Difference]: Start difference. First operand 798 states and 1050 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-13 14:05:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:25,187 INFO L93 Difference]: Finished difference Result 1641 states and 2165 transitions. [2024-11-13 14:05:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:05:25,188 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-13 14:05:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:25,192 INFO L225 Difference]: With dead ends: 1641 [2024-11-13 14:05:25,193 INFO L226 Difference]: Without dead ends: 936 [2024-11-13 14:05:25,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:05:25,196 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 84 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:25,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 614 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:05:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-11-13 14:05:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 930. [2024-11-13 14:05:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 791 states have (on average 1.259165613147914) internal successors, (996), 802 states have internal predecessors, (996), 111 states have call successors, (111), 27 states have call predecessors, (111), 27 states have return successors, (111), 100 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-13 14:05:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1218 transitions. [2024-11-13 14:05:25,309 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1218 transitions. Word has length 177 [2024-11-13 14:05:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:25,310 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1218 transitions. [2024-11-13 14:05:25,311 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-13 14:05:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1218 transitions. [2024-11-13 14:05:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:05:25,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:25,313 INFO L215 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-13 14:05:25,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:25,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:25,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:25,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1405540595, now seen corresponding path program 1 times [2024-11-13 14:05:25,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:25,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582233839] [2024-11-13 14:05:25,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:25,514 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-13 14:05:25,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:25,516 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:25,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:26,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:05:26,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 19 proven. 137 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 14:05:27,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:05:27,722 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-13 14:05:27,722 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:27,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582233839] [2024-11-13 14:05:27,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582233839] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:05:27,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:05:27,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 14 [2024-11-13 14:05:27,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36494351] [2024-11-13 14:05:27,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:27,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:05:27,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:27,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:05:27,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:05:27,735 INFO L87 Difference]: Start difference. First operand 930 states and 1218 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-13 14:05:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:28,117 INFO L93 Difference]: Finished difference Result 2117 states and 2767 transitions. [2024-11-13 14:05:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:05:28,118 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-13 14:05:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:28,125 INFO L225 Difference]: With dead ends: 2117 [2024-11-13 14:05:28,125 INFO L226 Difference]: Without dead ends: 1272 [2024-11-13 14:05:28,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:05:28,130 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 118 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:28,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 959 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:05:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-11-13 14:05:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1062. [2024-11-13 14:05:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 923 states have (on average 1.2394366197183098) internal successors, (1144), 934 states have internal predecessors, (1144), 111 states have call successors, (111), 27 states have call predecessors, (111), 27 states have return successors, (111), 100 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-13 14:05:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1366 transitions. [2024-11-13 14:05:28,242 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1366 transitions. Word has length 177 [2024-11-13 14:05:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:28,243 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1366 transitions. [2024-11-13 14:05:28,243 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-13 14:05:28,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1366 transitions. [2024-11-13 14:05:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:05:28,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:28,245 INFO L215 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-13 14:05:28,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:28,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:28,449 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:28,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1503223307, now seen corresponding path program 1 times [2024-11-13 14:05:28,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:28,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475953775] [2024-11-13 14:05:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:28,451 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-13 14:05:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:28,453 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:28,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:29,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 14:05:29,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:31,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 12 treesize of output 8 [2024-11-13 14:05:31,799 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 85 treesize of output 65 [2024-11-13 14:05:31,806 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 83 treesize of output 67 [2024-11-13 14:05:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 39 proven. 467 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-13 14:05:31,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:05:32,529 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 26 treesize of output 22 [2024-11-13 14:05:32,537 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:05:32,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:05:32,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2024-11-13 14:05:32,973 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-13 14:05:32,973 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475953775] [2024-11-13 14:05:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475953775] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:05:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:05:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 20 [2024-11-13 14:05:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501938323] [2024-11-13 14:05:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:05:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:32,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:05:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:05:32,975 INFO L87 Difference]: Start difference. First operand 1062 states and 1366 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-13 14:05:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:33,546 INFO L93 Difference]: Finished difference Result 2546 states and 3256 transitions. [2024-11-13 14:05:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:05:33,547 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-13 14:05:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:33,551 INFO L225 Difference]: With dead ends: 2546 [2024-11-13 14:05:33,551 INFO L226 Difference]: Without dead ends: 1577 [2024-11-13 14:05:33,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:05:33,553 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 72 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:33,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 974 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:05:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2024-11-13 14:05:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1562. [2024-11-13 14:05:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1377 states have (on average 1.2302106027596225) internal successors, (1694), 1396 states have internal predecessors, (1694), 149 states have call successors, (149), 35 states have call predecessors, (149), 35 states have return successors, (149), 130 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-13 14:05:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1992 transitions. [2024-11-13 14:05:33,686 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1992 transitions. Word has length 177 [2024-11-13 14:05:33,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:33,687 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 1992 transitions. [2024-11-13 14:05:33,687 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-13 14:05:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1992 transitions. [2024-11-13 14:05:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 14:05:33,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:33,690 INFO L215 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-13 14:05:33,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:33,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:33,891 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:33,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:33,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1643771917, now seen corresponding path program 1 times [2024-11-13 14:05:33,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:33,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609032661] [2024-11-13 14:05:33,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:33,892 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-13 14:05:33,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:33,894 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:33,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:34,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 14:05:34,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:36,701 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-13 14:05:37,120 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 141 treesize of output 109 [2024-11-13 14:05:37,130 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 107 treesize of output 87 [2024-11-13 14:05:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 39 proven. 467 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-13 14:05:37,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:05:38,139 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 26 treesize of output 22 [2024-11-13 14:05:38,150 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:05:38,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:05:38,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2024-11-13 14:05:39,540 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 14:05:39,540 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 30 treesize of output 25 [2024-11-13 14:05:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 63 proven. 54 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-13 14:05:39,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:05:39,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609032661] [2024-11-13 14:05:39,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609032661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:05:39,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:05:39,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2024-11-13 14:05:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666222691] [2024-11-13 14:05:39,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:05:39,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 14:05:39,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:05:39,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 14:05:39,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-11-13 14:05:39,894 INFO L87 Difference]: Start difference. First operand 1562 states and 1992 transitions. Second operand has 27 states, 23 states have (on average 6.304347826086956) internal successors, (145), 25 states have internal predecessors, (145), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:05:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:43,537 INFO L93 Difference]: Finished difference Result 3117 states and 3953 transitions. [2024-11-13 14:05:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 14:05:43,538 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 6.304347826086956) internal successors, (145), 25 states have internal predecessors, (145), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) Word has length 177 [2024-11-13 14:05:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:43,545 INFO L225 Difference]: With dead ends: 3117 [2024-11-13 14:05:43,545 INFO L226 Difference]: Without dead ends: 1648 [2024-11-13 14:05:43,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2024-11-13 14:05:43,549 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 459 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:43,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1454 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 14:05:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-13 14:05:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1024. [2024-11-13 14:05:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 898 states have (on average 1.2327394209354121) internal successors, (1107), 909 states have internal predecessors, (1107), 100 states have call successors, (100), 25 states have call predecessors, (100), 25 states have return successors, (100), 89 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 14:05:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1307 transitions. [2024-11-13 14:05:43,669 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1307 transitions. Word has length 177 [2024-11-13 14:05:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:43,669 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1307 transitions. [2024-11-13 14:05:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 6.304347826086956) internal successors, (145), 25 states have internal predecessors, (145), 7 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2024-11-13 14:05:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1307 transitions. [2024-11-13 14:05:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 14:05:43,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:43,673 INFO L215 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-13 14:05:43,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-13 14:05:43,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:43,874 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:43,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:43,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1993783350, now seen corresponding path program 1 times [2024-11-13 14:05:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:05:43,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357652419] [2024-11-13 14:05:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:43,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:05:43,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:05:43,879 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:43,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:05:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:44,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 14:05:44,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:55,954 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 70 treesize of output 34 [2024-11-13 14:05:55,980 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 70 treesize of output 34 [2024-11-13 14:05:56,007 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 70 treesize of output 34 [2024-11-13 14:05:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 448 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-13 14:05:56,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:08:07,705 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:08:11,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:08:11,446 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 112 treesize of output 87 [2024-11-13 14:09:20,895 WARN L286 SmtUtils]: Spent 14.15s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:09:29,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:29,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357652419] [2024-11-13 14:09:29,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357652419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:09:29,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571915746] [2024-11-13 14:09:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:29,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:09:29,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:09:29,256 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:09:29,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 14:09:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:29,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:09:29,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:42,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:42,803 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-13 14:09:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-13 14:09:51,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571915746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:51,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:09:51,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 14:09:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237536653] [2024-11-13 14:09:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:51,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:09:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:09:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=563, Unknown=3, NotChecked=0, Total=650 [2024-11-13 14:09:51,365 INFO L87 Difference]: Start difference. First operand 1024 states and 1307 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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-13 14:10:05,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:10:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:09,211 INFO L93 Difference]: Finished difference Result 1969 states and 2510 transitions. [2024-11-13 14:10:09,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:10:09,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 178 [2024-11-13 14:10:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:10:09,230 INFO L225 Difference]: With dead ends: 1969 [2024-11-13 14:10:09,231 INFO L226 Difference]: Without dead ends: 1026 [2024-11-13 14:10:09,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 189.5s TimeCoverageRelationStatistics Valid=98, Invalid=711, Unknown=3, NotChecked=0, Total=812 [2024-11-13 14:10:09,233 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 107 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:10:09,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 551 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-13 14:10:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-13 14:10:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1024. [2024-11-13 14:10:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 898 states have (on average 1.230512249443207) internal successors, (1105), 909 states have internal predecessors, (1105), 100 states have call successors, (100), 25 states have call predecessors, (100), 25 states have return successors, (100), 89 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 14:10:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1305 transitions. [2024-11-13 14:10:09,351 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1305 transitions. Word has length 178 [2024-11-13 14:10:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:10:09,351 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1305 transitions. [2024-11-13 14:10:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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-13 14:10:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1305 transitions. [2024-11-13 14:10:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 14:10:09,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:10:09,353 INFO L215 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-13 14:10:09,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 14:10:09,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:09,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:09,755 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:10:09,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2138444764, now seen corresponding path program 1 times [2024-11-13 14:10:09,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:10:09,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511901123] [2024-11-13 14:10:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:09,761 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-13 14:10:09,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:10:09,767 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:09,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:10,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 14:10:10,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:26,598 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 70 treesize of output 34 [2024-11-13 14:10:26,636 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 70 treesize of output 34 [2024-11-13 14:10:26,675 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 70 treesize of output 34 [2024-11-13 14:10:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 448 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-13 14:10:27,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:13:03,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:13:03,632 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 112 treesize of output 87 [2024-11-13 14:14:07,209 WARN L286 SmtUtils]: Spent 12.22s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:14:12,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:14:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511901123] [2024-11-13 14:14:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511901123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:14:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857411141] [2024-11-13 14:14:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:14:12,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:14:12,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:14:12,821 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:14:12,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca28aa3d-90db-496e-aebc-a6cbb09d5960/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 14:14:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:14:13,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 14:14:13,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:15:03,343 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 46 treesize of output 22 [2024-11-13 14:15:03,435 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 46 treesize of output 22 [2024-11-13 14:15:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 448 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-13 14:15:07,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:15:47,310 WARN L286 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)