./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ --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 c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:39:31,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:39:31,726 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 21:39:31,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:39:31,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:39:31,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:39:31,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:39:31,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:39:31,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:39:31,776 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:39:31,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:39:31,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:39:31,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:39:31,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:39:31,780 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:39:31,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:39:31,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:39:31,781 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:39:31,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:39:31,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:39:31,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:39:31,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:39:31,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:39:31,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:39:31,784 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:39:31,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:39:31,785 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:39:31,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:39:31,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:39:31,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:39:31,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:39:31,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:39:31,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:39:31,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:39:31,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:39:31,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:39:31,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:39:31,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:39:31,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:39:31,790 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:39:31,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:39:31,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:39:31,792 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ 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 -> c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 [2023-11-23 21:39:32,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:39:32,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:39:32,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:39:32,141 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:39:32,141 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:39:32,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-23 21:39:35,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:39:35,465 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:39:35,465 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-23 21:39:35,491 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/data/b847b7ed0/4f881bfaea0b4e6694916dcd4a0a1145/FLAG16af7440c [2023-11-23 21:39:35,507 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/data/b847b7ed0/4f881bfaea0b4e6694916dcd4a0a1145 [2023-11-23 21:39:35,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:39:35,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:39:35,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:39:35,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:39:35,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:39:35,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:35" (1/1) ... [2023-11-23 21:39:35,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bba830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:35, skipping insertion in model container [2023-11-23 21:39:35,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:35" (1/1) ... [2023-11-23 21:39:35,588 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:39:35,791 WARN L240 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_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i[916,929] [2023-11-23 21:39:35,892 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:39:35,905 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:39:35,918 WARN L240 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_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i[916,929] [2023-11-23 21:39:35,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:39:36,002 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:39:36,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36 WrapperNode [2023-11-23 21:39:36,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:39:36,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:39:36,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:39:36,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:39:36,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,093 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2023-11-23 21:39:36,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:39:36,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:39:36,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:39:36,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:39:36,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,113 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,139 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 21:39:36,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:39:36,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:39:36,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:39:36,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:39:36,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (1/1) ... [2023-11-23 21:39:36,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:39:36,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:36,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:39:36,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:39:36,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:39:36,276 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 21:39:36,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 21:39:36,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 21:39:36,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:39:36,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:39:36,386 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:39:36,389 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:39:37,050 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:39:37,128 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:39:37,128 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 21:39:37,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:37 BoogieIcfgContainer [2023-11-23 21:39:37,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:39:37,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:39:37,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:39:37,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:39:37,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:39:35" (1/3) ... [2023-11-23 21:39:37,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b5eba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:39:37, skipping insertion in model container [2023-11-23 21:39:37,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:36" (2/3) ... [2023-11-23 21:39:37,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b5eba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:39:37, skipping insertion in model container [2023-11-23 21:39:37,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:37" (3/3) ... [2023-11-23 21:39:37,143 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-23 21:39:37,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:39:37,160 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:39:37,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:39:37,222 INFO L357 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, mHoare=true, 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;@59ce477d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:39:37,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:39:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 54 states have internal predecessors, (83), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 21:39:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-23 21:39:37,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:37,249 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:37,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:37,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash -838293440, now seen corresponding path program 1 times [2023-11-23 21:39:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:37,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619144177] [2023-11-23 21:39:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:37,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-23 21:39:37,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:37,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619144177] [2023-11-23 21:39:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619144177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:37,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:37,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:39:37,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782610633] [2023-11-23 21:39:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:37,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:39:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:37,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:39:37,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:39:37,827 INFO L87 Difference]: Start difference. First operand has 79 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 54 states have internal predecessors, (83), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-23 21:39:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:37,903 INFO L93 Difference]: Finished difference Result 155 states and 276 transitions. [2023-11-23 21:39:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:39:37,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2023-11-23 21:39:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:37,919 INFO L225 Difference]: With dead ends: 155 [2023-11-23 21:39:37,920 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 21:39:37,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:39:37,932 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:37,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:39:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 21:39:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-23 21:39:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 21:39:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2023-11-23 21:39:38,016 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 151 [2023-11-23 21:39:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:38,017 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2023-11-23 21:39:38,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-23 21:39:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2023-11-23 21:39:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-23 21:39:38,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:38,031 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:38,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:39:38,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:38,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2006101766, now seen corresponding path program 1 times [2023-11-23 21:39:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509098845] [2023-11-23 21:39:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:38,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-23 21:39:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509098845] [2023-11-23 21:39:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509098845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:38,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:38,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:39:38,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137410577] [2023-11-23 21:39:38,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:38,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:38,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:38,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:38,663 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:38,808 INFO L93 Difference]: Finished difference Result 220 states and 344 transitions. [2023-11-23 21:39:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:38,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2023-11-23 21:39:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:38,815 INFO L225 Difference]: With dead ends: 220 [2023-11-23 21:39:38,817 INFO L226 Difference]: Without dead ends: 146 [2023-11-23 21:39:38,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:38,822 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 107 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:38,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 308 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-23 21:39:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 76. [2023-11-23 21:39:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 21:39:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 118 transitions. [2023-11-23 21:39:38,856 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 118 transitions. Word has length 151 [2023-11-23 21:39:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:38,858 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 118 transitions. [2023-11-23 21:39:38,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 118 transitions. [2023-11-23 21:39:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-23 21:39:38,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:38,862 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:38,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:39:38,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:38,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1702059516, now seen corresponding path program 1 times [2023-11-23 21:39:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:38,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976219977] [2023-11-23 21:39:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-23 21:39:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:39,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976219977] [2023-11-23 21:39:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976219977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:39,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:39:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552804693] [2023-11-23 21:39:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:39,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:39:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:39,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:39:39,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:39:39,505 INFO L87 Difference]: Start difference. First operand 76 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:39,757 INFO L93 Difference]: Finished difference Result 227 states and 353 transitions. [2023-11-23 21:39:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:39:39,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2023-11-23 21:39:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:39,761 INFO L225 Difference]: With dead ends: 227 [2023-11-23 21:39:39,761 INFO L226 Difference]: Without dead ends: 152 [2023-11-23 21:39:39,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:39:39,764 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 76 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:39,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 310 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-23 21:39:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2023-11-23 21:39:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-23 21:39:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 226 transitions. [2023-11-23 21:39:39,812 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 226 transitions. Word has length 151 [2023-11-23 21:39:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:39,814 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 226 transitions. [2023-11-23 21:39:39,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 226 transitions. [2023-11-23 21:39:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-23 21:39:39,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:39,820 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:39,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:39:39,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:39,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1881597395, now seen corresponding path program 1 times [2023-11-23 21:39:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:39,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832108405] [2023-11-23 21:39:39,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:39,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-23 21:39:40,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:40,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832108405] [2023-11-23 21:39:40,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832108405] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:39:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568727898] [2023-11-23 21:39:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:40,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:40,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:40,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:39:40,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:39:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:40,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 21:39:40,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:39:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2023-11-23 21:39:40,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:39:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-23 21:39:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568727898] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:39:41,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:39:41,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-11-23 21:39:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621848591] [2023-11-23 21:39:41,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:39:41,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:39:41,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:39:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:39:41,270 INFO L87 Difference]: Start difference. First operand 144 states and 226 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-11-23 21:39:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:41,606 INFO L93 Difference]: Finished difference Result 249 states and 380 transitions. [2023-11-23 21:39:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:39:41,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 152 [2023-11-23 21:39:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:41,610 INFO L225 Difference]: With dead ends: 249 [2023-11-23 21:39:41,610 INFO L226 Difference]: Without dead ends: 158 [2023-11-23 21:39:41,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-11-23 21:39:41,612 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 61 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:41,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 238 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-23 21:39:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2023-11-23 21:39:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-23 21:39:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2023-11-23 21:39:41,646 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 152 [2023-11-23 21:39:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:41,647 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2023-11-23 21:39:41,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-11-23 21:39:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2023-11-23 21:39:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-23 21:39:41,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:41,650 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:41,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 21:39:41,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:41,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:41,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1133506223, now seen corresponding path program 1 times [2023-11-23 21:39:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:41,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397598132] [2023-11-23 21:39:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-23 21:39:42,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397598132] [2023-11-23 21:39:42,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397598132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:42,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:42,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:39:42,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337912113] [2023-11-23 21:39:42,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:42,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:39:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:39:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:39:42,453 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:42,597 INFO L93 Difference]: Finished difference Result 366 states and 544 transitions. [2023-11-23 21:39:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:39:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2023-11-23 21:39:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:42,601 INFO L225 Difference]: With dead ends: 366 [2023-11-23 21:39:42,601 INFO L226 Difference]: Without dead ends: 264 [2023-11-23 21:39:42,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:39:42,603 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 105 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:42,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 293 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-23 21:39:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 217. [2023-11-23 21:39:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 157 states have (on average 1.375796178343949) internal successors, (216), 158 states have internal predecessors, (216), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-23 21:39:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 322 transitions. [2023-11-23 21:39:42,641 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 322 transitions. Word has length 152 [2023-11-23 21:39:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:42,642 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 322 transitions. [2023-11-23 21:39:42,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 322 transitions. [2023-11-23 21:39:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-23 21:39:42,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:42,645 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:42,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:39:42,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:42,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash 454841679, now seen corresponding path program 1 times [2023-11-23 21:39:42,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:42,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202862945] [2023-11-23 21:39:42,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:42,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-23 21:39:42,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:42,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202862945] [2023-11-23 21:39:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202862945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:42,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:42,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:39:42,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617690593] [2023-11-23 21:39:42,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:42,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:42,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:42,828 INFO L87 Difference]: Start difference. First operand 217 states and 322 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:42,901 INFO L93 Difference]: Finished difference Result 462 states and 690 transitions. [2023-11-23 21:39:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:42,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2023-11-23 21:39:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:42,906 INFO L225 Difference]: With dead ends: 462 [2023-11-23 21:39:42,906 INFO L226 Difference]: Without dead ends: 315 [2023-11-23 21:39:42,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:42,911 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 105 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:42,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 287 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:39:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-23 21:39:42,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2023-11-23 21:39:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 228 states have (on average 1.3640350877192982) internal successors, (311), 229 states have internal predecessors, (311), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2023-11-23 21:39:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 463 transitions. [2023-11-23 21:39:42,983 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 463 transitions. Word has length 152 [2023-11-23 21:39:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:42,984 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 463 transitions. [2023-11-23 21:39:42,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 463 transitions. [2023-11-23 21:39:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-23 21:39:42,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:42,987 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:42,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:39:42,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:42,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1155906257, now seen corresponding path program 1 times [2023-11-23 21:39:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:42,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342845921] [2023-11-23 21:39:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-23 21:39:44,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:44,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342845921] [2023-11-23 21:39:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342845921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:44,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:39:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87501915] [2023-11-23 21:39:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:44,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:39:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:44,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:39:44,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:39:44,782 INFO L87 Difference]: Start difference. First operand 313 states and 463 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:45,426 INFO L93 Difference]: Finished difference Result 941 states and 1383 transitions. [2023-11-23 21:39:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:39:45,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2023-11-23 21:39:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:45,432 INFO L225 Difference]: With dead ends: 941 [2023-11-23 21:39:45,433 INFO L226 Difference]: Without dead ends: 708 [2023-11-23 21:39:45,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:39:45,435 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 194 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:45,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 397 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 21:39:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2023-11-23 21:39:45,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 524. [2023-11-23 21:39:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 381 states have (on average 1.2992125984251968) internal successors, (495), 383 states have internal predecessors, (495), 129 states have call successors, (129), 13 states have call predecessors, (129), 13 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2023-11-23 21:39:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 753 transitions. [2023-11-23 21:39:45,550 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 753 transitions. Word has length 152 [2023-11-23 21:39:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:45,551 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 753 transitions. [2023-11-23 21:39:45,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 753 transitions. [2023-11-23 21:39:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-23 21:39:45,554 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:45,555 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:45,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:39:45,556 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:45,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash 475847887, now seen corresponding path program 1 times [2023-11-23 21:39:45,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:45,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001370285] [2023-11-23 21:39:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-23 21:39:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001370285] [2023-11-23 21:39:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001370285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:39:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224535791] [2023-11-23 21:39:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:46,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:46,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:39:46,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:39:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-23 21:39:46,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:39:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-11-23 21:39:47,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:39:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2023-11-23 21:39:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224535791] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:39:47,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:39:47,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 25 [2023-11-23 21:39:47,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190110931] [2023-11-23 21:39:47,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:39:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 21:39:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:47,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 21:39:47,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2023-11-23 21:39:47,589 INFO L87 Difference]: Start difference. First operand 524 states and 753 transitions. Second operand has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) [2023-11-23 21:39:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:49,265 INFO L93 Difference]: Finished difference Result 1552 states and 2213 transitions. [2023-11-23 21:39:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-23 21:39:49,266 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) Word has length 152 [2023-11-23 21:39:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:49,277 INFO L225 Difference]: With dead ends: 1552 [2023-11-23 21:39:49,278 INFO L226 Difference]: Without dead ends: 1084 [2023-11-23 21:39:49,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=494, Invalid=1398, Unknown=0, NotChecked=0, Total=1892 [2023-11-23 21:39:49,282 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 622 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:49,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1003 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 21:39:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2023-11-23 21:39:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 532. [2023-11-23 21:39:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 387 states have (on average 1.2919896640826873) internal successors, (500), 389 states have internal predecessors, (500), 129 states have call successors, (129), 15 states have call predecessors, (129), 15 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2023-11-23 21:39:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 758 transitions. [2023-11-23 21:39:49,440 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 758 transitions. Word has length 152 [2023-11-23 21:39:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:49,444 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 758 transitions. [2023-11-23 21:39:49,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) [2023-11-23 21:39:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 758 transitions. [2023-11-23 21:39:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-23 21:39:49,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:49,448 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:49,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 21:39:49,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:49,654 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:49,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1724587897, now seen corresponding path program 1 times [2023-11-23 21:39:49,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:49,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260765365] [2023-11-23 21:39:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-23 21:39:49,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:49,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260765365] [2023-11-23 21:39:49,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260765365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:49,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:49,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:39:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17066050] [2023-11-23 21:39:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:49,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:39:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:39:49,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:39:49,925 INFO L87 Difference]: Start difference. First operand 532 states and 758 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:50,182 INFO L93 Difference]: Finished difference Result 1026 states and 1460 transitions. [2023-11-23 21:39:50,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:39:50,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2023-11-23 21:39:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:50,187 INFO L225 Difference]: With dead ends: 1026 [2023-11-23 21:39:50,187 INFO L226 Difference]: Without dead ends: 557 [2023-11-23 21:39:50,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:39:50,191 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 128 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:50,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 540 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2023-11-23 21:39:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 531. [2023-11-23 21:39:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 386 states have (on average 1.2875647668393781) internal successors, (497), 388 states have internal predecessors, (497), 129 states have call successors, (129), 15 states have call predecessors, (129), 15 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2023-11-23 21:39:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 755 transitions. [2023-11-23 21:39:50,310 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 755 transitions. Word has length 152 [2023-11-23 21:39:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:50,311 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 755 transitions. [2023-11-23 21:39:50,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:39:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 755 transitions. [2023-11-23 21:39:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-23 21:39:50,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:50,314 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:50,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:39:50,314 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:50,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1074023158, now seen corresponding path program 1 times [2023-11-23 21:39:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645055924] [2023-11-23 21:39:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:39:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:39:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 21:39:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 21:39:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 21:39:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 21:39:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:39:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:39:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 21:39:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 21:39:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 21:39:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 21:39:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:39:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 21:39:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 21:39:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 21:39:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 21:39:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 21:39:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 21:39:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 21:39:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 21:39:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-23 21:39:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645055924] [2023-11-23 21:39:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645055924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:39:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899088087] [2023-11-23 21:39:50,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:50,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:50,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:50,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:39:50,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 21:39:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 21:39:50,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:39:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2023-11-23 21:39:51,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:39:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-23 21:39:51,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899088087] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:39:51,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:39:51,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2023-11-23 21:39:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774759565] [2023-11-23 21:39:51,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:39:51,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-23 21:39:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-23 21:39:51,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2023-11-23 21:39:51,649 INFO L87 Difference]: Start difference. First operand 531 states and 755 transitions. Second operand has 19 states, 18 states have (on average 5.055555555555555) internal successors, (91), 19 states have internal predecessors, (91), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2023-11-23 21:39:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:52,622 INFO L93 Difference]: Finished difference Result 1115 states and 1560 transitions. [2023-11-23 21:39:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 21:39:52,623 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.055555555555555) internal successors, (91), 19 states have internal predecessors, (91), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) Word has length 153 [2023-11-23 21:39:52,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:52,628 INFO L225 Difference]: With dead ends: 1115 [2023-11-23 21:39:52,628 INFO L226 Difference]: Without dead ends: 647 [2023-11-23 21:39:52,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=1065, Unknown=0, NotChecked=0, Total=1406 [2023-11-23 21:39:52,631 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 624 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:52,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 557 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 21:39:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2023-11-23 21:39:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 615. [2023-11-23 21:39:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 443 states have (on average 1.2483069977426637) internal successors, (553), 449 states have internal predecessors, (553), 149 states have call successors, (149), 22 states have call predecessors, (149), 22 states have return successors, (149), 143 states have call predecessors, (149), 149 states have call successors, (149) [2023-11-23 21:39:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 851 transitions. [2023-11-23 21:39:52,769 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 851 transitions. Word has length 153 [2023-11-23 21:39:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:52,770 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 851 transitions. [2023-11-23 21:39:52,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.055555555555555) internal successors, (91), 19 states have internal predecessors, (91), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2023-11-23 21:39:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 851 transitions. [2023-11-23 21:39:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-23 21:39:52,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:52,773 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:52,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 21:39:52,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 21:39:52,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:39:52,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -614920584, now seen corresponding path program 1 times [2023-11-23 21:39:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449693382] [2023-11-23 21:39:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:39:53,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:39:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:39:53,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:39:53,527 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:39:53,528 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 21:39:53,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:39:53,534 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:53,539 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:39:53,670 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-23 21:39:53,675 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-23 21:39:53,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:39:53 BoogieIcfgContainer [2023-11-23 21:39:53,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:39:53,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:39:53,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:39:53,713 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:39:53,714 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:37" (3/4) ... [2023-11-23 21:39:53,716 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 21:39:53,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:39:53,719 INFO L158 Benchmark]: Toolchain (without parser) took 18203.62ms. Allocated memory was 159.4MB in the beginning and 358.6MB in the end (delta: 199.2MB). Free memory was 115.4MB in the beginning and 307.1MB in the end (delta: -191.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2023-11-23 21:39:53,719 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 109.1MB. Free memory was 56.3MB in the beginning and 56.1MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:39:53,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.42ms. Allocated memory is still 159.4MB. Free memory was 115.0MB in the beginning and 98.7MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-23 21:39:53,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.87ms. Allocated memory is still 159.4MB. Free memory was 98.7MB in the beginning and 92.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 21:39:53,720 INFO L158 Benchmark]: Boogie Preprocessor took 79.78ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 81.5MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 21:39:53,721 INFO L158 Benchmark]: RCFGBuilder took 953.71ms. Allocated memory is still 159.4MB. Free memory was 81.1MB in the beginning and 103.9MB in the end (delta: -22.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-23 21:39:53,722 INFO L158 Benchmark]: TraceAbstraction took 16581.14ms. Allocated memory was 159.4MB in the beginning and 358.6MB in the end (delta: 199.2MB). Free memory was 103.1MB in the beginning and 308.2MB in the end (delta: -205.0MB). Peak memory consumption was 155.3MB. Max. memory is 16.1GB. [2023-11-23 21:39:53,722 INFO L158 Benchmark]: Witness Printer took 4.82ms. Allocated memory is still 358.6MB. Free memory was 308.2MB in the beginning and 307.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:39:53,725 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 109.1MB. Free memory was 56.3MB in the beginning and 56.1MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.42ms. Allocated memory is still 159.4MB. Free memory was 115.0MB in the beginning and 98.7MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.87ms. Allocated memory is still 159.4MB. Free memory was 98.7MB in the beginning and 92.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.78ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 81.5MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 953.71ms. Allocated memory is still 159.4MB. Free memory was 81.1MB in the beginning and 103.9MB in the end (delta: -22.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16581.14ms. Allocated memory was 159.4MB in the beginning and 358.6MB in the end (delta: 199.2MB). Free memory was 103.1MB in the beginning and 308.2MB in the end (delta: -205.0MB). Peak memory consumption was 155.3MB. Max. memory is 16.1GB. * Witness Printer took 4.82ms. Allocated memory is still 358.6MB. Free memory was 308.2MB in the beginning and 307.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of bitwiseOr at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] unsigned char var_1_4 = 1; [L24] double var_1_7 = 31.25; [L25] double var_1_8 = 7.6; [L26] double var_1_9 = 8.9; [L27] double var_1_10 = 256.8; [L28] signed short int var_1_11 = 0; [L29] unsigned long int var_1_15 = 64; [L30] signed short int var_1_18 = 16; [L31] signed short int var_1_19 = 22006; [L32] unsigned char var_1_21 = 1; [L33] unsigned char var_1_22 = 0; [L34] float var_1_23 = 2.25; [L35] signed long int var_1_24 = -1; [L36] unsigned char var_1_26 = 32; [L37] unsigned char var_1_27 = 200; [L38] unsigned char var_1_28 = 5; [L39] unsigned char var_1_29 = 64; [L40] unsigned char var_1_30 = 64; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 5; [L43] signed char var_1_33 = 2; [L44] signed char var_1_34 = 32; [L45] unsigned short int var_1_35 = 16; [L46] float var_1_37 = 63.5; [L47] signed long int last_1_var_1_24 = -1; [L48] unsigned char last_1_var_1_26 = 32; [L49] signed char last_1_var_1_33 = 2; [L50] unsigned short int last_1_var_1_35 = 16; [L191] isInitial = 1 [L192] FCALL initially() [L193] int k_loop; [L194] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L194] COND TRUE k_loop < 1 [L195] CALL updateLastVariables() [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_26 = var_1_26 [L183] last_1_var_1_33 = var_1_33 [L184] last_1_var_1_35 = var_1_35 [L195] RET updateLastVariables() [L196] CALL updateVariables() [L143] var_1_4 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L144] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L146] var_1_8 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L147] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L148] var_1_9 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L149] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L150] var_1_10 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L151] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L152] var_1_19 = __VERIFIER_nondet_short() [L153] CALL assume_abort_if_not(var_1_19 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L153] RET assume_abort_if_not(var_1_19 >= 16383) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L154] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L154] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L155] var_1_22 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L156] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L157] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L157] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L158] var_1_27 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_27 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L159] RET assume_abort_if_not(var_1_27 >= 190) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L160] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L160] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L161] var_1_28 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L162] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L163] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L163] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L164] var_1_29 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_29 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L165] RET assume_abort_if_not(var_1_29 >= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L166] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L166] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L167] var_1_30 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_30 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L168] RET assume_abort_if_not(var_1_30 >= 31) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L169] CALL assume_abort_if_not(var_1_30 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L169] RET assume_abort_if_not(var_1_30 <= 64) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L171] RET assume_abort_if_not(var_1_31 >= 32) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L172] CALL assume_abort_if_not(var_1_31 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L172] RET assume_abort_if_not(var_1_31 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L173] var_1_32 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L174] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L175] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L175] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L176] var_1_34 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L177] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L178] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L178] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L196] RET updateVariables() [L197] CALL step() [L54] signed long int stepLocal_6 = last_1_var_1_24; [L55] unsigned char stepLocal_5 = var_1_30; [L56] signed long int stepLocal_4 = last_1_var_1_24; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L57] EXPR last_1_var_1_35 | 100000000 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L57] COND TRUE stepLocal_6 < (last_1_var_1_35 | 100000000) [L58] COND TRUE stepLocal_5 > last_1_var_1_35 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L59] COND FALSE !(var_1_19 < stepLocal_4) [L62] var_1_35 = (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33)))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=126, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L74] COND TRUE \read(var_1_4) [L75] var_1_21 = (! var_1_22) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=126, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L77] COND TRUE ! var_1_21 [L78] var_1_23 = var_1_8 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=32, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=126, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L80] COND TRUE (var_1_8 + 199.375) <= 10.5 [L81] var_1_26 = ((var_1_27 - var_1_28) - (var_1_29 - 1)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=2, var_1_34=63, var_1_35=126, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L89] COND TRUE \read(var_1_22) [L90] var_1_33 = ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L92] var_1_37 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_10=100000005, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L93] COND FALSE !((- var_1_8) != var_1_23) [L96] var_1_11 = ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_10=100000005, var_1_11=126, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L98] COND TRUE var_1_26 == var_1_11 [L99] var_1_15 = ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L107] COND FALSE !((var_1_11 == var_1_15) && var_1_21) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L110] signed short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_3=126, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L111] COND TRUE var_1_1 != stepLocal_3 [L112] var_1_18 = (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_3=126, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=-32632, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=-1, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L114] COND FALSE !(var_1_18 != var_1_18) [L123] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_3=126, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=-32632, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=126, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L125] signed short int stepLocal_2 = var_1_11; [L126] signed long int stepLocal_1 = var_1_1; [L127] unsigned short int stepLocal_0 = var_1_35; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_0=126, stepLocal_1=-256, stepLocal_2=126, stepLocal_3=126, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=-32632, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=126, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=125/4, var_1_8=100000006] [L128] COND FALSE !(stepLocal_0 == var_1_1) [L139] var_1_7 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_0=126, stepLocal_1=-256, stepLocal_2=126, stepLocal_3=126, stepLocal_4=-1, stepLocal_5=64, stepLocal_6=-1, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=-32632, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=126, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=100000005, var_1_8=100000006] [L197] RET step() [L198] CALL, EXPR property() [L187] EXPR ((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=-32632, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=126, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=100000005, var_1_8=100000006] [L187-L188] return (((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28))))) && (var_1_37 == ((float) var_1_10)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=-32632, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=126, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=100000005, var_1_8=100000006] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000005, var_1_11=126, var_1_15=126, var_1_18=-32632, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000006, var_1_24=126, var_1_26=126, var_1_27=251, var_1_28=63, var_1_29=63, var_1_30=64, var_1_31=32, var_1_32=63, var_1_33=-31, var_1_34=63, var_1_35=126, var_1_37=100000005, var_1_4=1, var_1_7=100000005, var_1_8=100000006] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 11, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2030 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2022 mSDsluCounter, 4047 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2785 mSDsCounter, 709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2136 IncrementalHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 709 mSolverCounterUnsat, 1262 mSDtfsCounter, 2136 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1497 GetRequests, 1387 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=615occurred in iteration=10, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 927 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2128 NumberOfCodeBlocks, 2128 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2416 ConstructedInterpolants, 0 QuantifiedInterpolants, 7566 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1146 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 15808/16192 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 [2023-11-23 21:39:53,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ --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 c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:39:56,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:39:56,677 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-23 21:39:56,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:39:56,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:39:56,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:39:56,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:39:56,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:39:56,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:39:56,759 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:39:56,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:39:56,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:39:56,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:39:56,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:39:56,764 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:39:56,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:39:56,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:39:56,766 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:39:56,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:39:56,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:39:56,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:39:56,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:39:56,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:39:56,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:39:56,770 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 21:39:56,771 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 21:39:56,771 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:39:56,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:39:56,772 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:39:56,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:39:56,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:39:56,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:39:56,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:39:56,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:39:56,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:39:56,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:39:56,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:39:56,777 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 21:39:56,777 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 21:39:56,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:39:56,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:39:56,778 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:39:56,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:39:56,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:39:56,779 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 21:39:56,779 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ 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 -> c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 [2023-11-23 21:39:57,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:39:57,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:39:57,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:39:57,229 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:39:57,230 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:39:57,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-23 21:40:00,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:40:01,032 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:40:01,033 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-23 21:40:01,043 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/data/753ddaf94/859d5cc90a394f14afcf48d8dbca3555/FLAG2dcde5e3c [2023-11-23 21:40:01,058 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/data/753ddaf94/859d5cc90a394f14afcf48d8dbca3555 [2023-11-23 21:40:01,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:40:01,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:40:01,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:40:01,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:40:01,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:40:01,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9528a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01, skipping insertion in model container [2023-11-23 21:40:01,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,110 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:40:01,278 WARN L240 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_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i[916,929] [2023-11-23 21:40:01,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:40:01,438 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:40:01,452 WARN L240 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_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i[916,929] [2023-11-23 21:40:01,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:40:01,526 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:40:01,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01 WrapperNode [2023-11-23 21:40:01,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:40:01,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:40:01,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:40:01,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:40:01,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,626 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2023-11-23 21:40:01,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:40:01,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:40:01,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:40:01,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:40:01,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,667 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,705 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 21:40:01,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:40:01,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:40:01,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:40:01,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:40:01,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (1/1) ... [2023-11-23 21:40:01,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:40:01,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:40:01,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:40:01,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:40:01,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:40:01,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-23 21:40:01,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 21:40:01,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 21:40:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:40:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:40:02,038 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:40:02,041 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:40:06,664 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:40:06,780 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:40:06,781 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 21:40:06,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:40:06 BoogieIcfgContainer [2023-11-23 21:40:06,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:40:06,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:40:06,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:40:06,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:40:06,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:40:01" (1/3) ... [2023-11-23 21:40:06,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bb4b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:40:06, skipping insertion in model container [2023-11-23 21:40:06,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:01" (2/3) ... [2023-11-23 21:40:06,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bb4b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:40:06, skipping insertion in model container [2023-11-23 21:40:06,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:40:06" (3/3) ... [2023-11-23 21:40:06,794 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-93.i [2023-11-23 21:40:06,816 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:40:06,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:40:06,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:40:06,894 INFO L357 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, mHoare=true, 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;@7a37accf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:40:06,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:40:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 21:40:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 21:40:06,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:40:06,923 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:06,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:40:06,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash -327988832, now seen corresponding path program 1 times [2023-11-23 21:40:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:40:06,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682664676] [2023-11-23 21:40:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:06,953 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 [2023-11-23 21:40:06,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:40:06,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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) [2023-11-23 21:40:06,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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 [2023-11-23 21:40:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:07,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 21:40:07,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:40:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2023-11-23 21:40:07,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:40:07,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:40:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682664676] [2023-11-23 21:40:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682664676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:07,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:40:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123184920] [2023-11-23 21:40:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:07,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:40:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:40:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:40:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:40:07,565 INFO L87 Difference]: Start difference. First operand has 72 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-23 21:40:09,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:40:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:40:09,817 INFO L93 Difference]: Finished difference Result 141 states and 252 transitions. [2023-11-23 21:40:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:40:09,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2023-11-23 21:40:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:40:09,834 INFO L225 Difference]: With dead ends: 141 [2023-11-23 21:40:09,834 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 21:40:09,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:40:09,845 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:40:09,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2023-11-23 21:40:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 21:40:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-23 21:40:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 43 states have internal predecessors, (61), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 21:40:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 107 transitions. [2023-11-23 21:40:09,929 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 107 transitions. Word has length 148 [2023-11-23 21:40:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:40:09,929 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 107 transitions. [2023-11-23 21:40:09,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-23 21:40:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 107 transitions. [2023-11-23 21:40:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 21:40:09,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:40:09,946 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:09,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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 [2023-11-23 21:40:10,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:40:10,158 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:40:10,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -562304218, now seen corresponding path program 1 times [2023-11-23 21:40:10,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:40:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074116702] [2023-11-23 21:40:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:10,161 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 [2023-11-23 21:40:10,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:40:10,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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) [2023-11-23 21:40:10,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9a8f9d-2584-496a-a6a4-9d66ca3a3871/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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 [2023-11-23 21:40:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:10,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 21:40:10,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:40:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-23 21:40:11,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:40:11,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:40:11,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074116702] [2023-11-23 21:40:11,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074116702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:11,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:11,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:40:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702903402] [2023-11-23 21:40:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:11,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:40:11,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:40:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:40:11,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:40:11,887 INFO L87 Difference]: Start difference. First operand 68 states and 107 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 21:40:14,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:40:16,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:40:18,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:40:20,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:40:22,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []