./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu --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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:01:05,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:01:05,438 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:01:05,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:01:05,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:01:05,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:01:05,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:01:05,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:01:05,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:01:05,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:01:05,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:01:05,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:01:05,474 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:01:05,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:01:05,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:01:05,475 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:01:05,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:01:05,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:01:05,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:01:05,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:01:05,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:01:05,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:01:05,481 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:01:05,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:01:05,482 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:01:05,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:01:05,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:01:05,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:01:05,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:05,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:01:05,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:01:05,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:01:05,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:01:05,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:01:05,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:01:05,487 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:01:05,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:01:05,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:01:05,488 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:01:05,488 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_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/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_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2023-11-19 08:01:05,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:01:05,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:01:05,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:01:05,867 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:01:05,868 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:01:05,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 08:01:08,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:01:09,318 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:01:09,319 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 08:01:09,330 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/data/d40a953a8/060e8078376645f1a4d03ac1f4156a1c/FLAGe4a677b16 [2023-11-19 08:01:09,352 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/data/d40a953a8/060e8078376645f1a4d03ac1f4156a1c [2023-11-19 08:01:09,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:01:09,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:01:09,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:09,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:01:09,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:01:09,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737b72ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09, skipping insertion in model container [2023-11-19 08:01:09,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,412 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:01:09,636 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_03b88bf4-5d79-4f49-ac01-b860239f624b/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2023-11-19 08:01:09,644 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:09,658 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:01:09,687 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_03b88bf4-5d79-4f49-ac01-b860239f624b/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2023-11-19 08:01:09,688 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:09,703 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:01:09,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09 WrapperNode [2023-11-19 08:01:09,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:09,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:09,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:01:09,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:01:09,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,747 INFO L138 Inliner]: procedures = 14, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-11-19 08:01:09,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:09,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:01:09,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:01:09,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:01:09,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:01:09,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:01:09,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:01:09,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:01:09,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (1/1) ... [2023-11-19 08:01:09,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:09,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:09,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:01:09,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:01:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:01:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:01:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:01:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:01:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 08:01:09,910 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 08:01:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 08:01:09,911 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 08:01:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:01:09,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:01:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:01:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 08:01:09,912 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 08:01:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:01:10,044 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:01:10,046 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:01:10,305 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:01:10,316 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:01:10,316 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:01:10,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:10 BoogieIcfgContainer [2023-11-19 08:01:10,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:01:10,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:01:10,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:01:10,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:01:10,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:01:09" (1/3) ... [2023-11-19 08:01:10,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b63b6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:10, skipping insertion in model container [2023-11-19 08:01:10,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:09" (2/3) ... [2023-11-19 08:01:10,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b63b6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:10, skipping insertion in model container [2023-11-19 08:01:10,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:10" (3/3) ... [2023-11-19 08:01:10,341 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2023-11-19 08:01:10,363 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:01:10,364 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 08:01:10,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:01:10,440 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;@42b5fe0e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:01:10,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 08:01:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 08:01:10,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 08:01:10,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:10,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:10,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:10,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 58732503, now seen corresponding path program 1 times [2023-11-19 08:01:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904089504] [2023-11-19 08:01:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:11,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:11,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:11,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904089504] [2023-11-19 08:01:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904089504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:11,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:11,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:01:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099936123] [2023-11-19 08:01:11,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:11,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:01:11,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:01:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:01:11,336 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 08:01:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:11,491 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2023-11-19 08:01:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:01:11,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-11-19 08:01:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:11,505 INFO L225 Difference]: With dead ends: 50 [2023-11-19 08:01:11,505 INFO L226 Difference]: Without dead ends: 35 [2023-11-19 08:01:11,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:11,513 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:11,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:01:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-19 08:01:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-11-19 08:01:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-19 08:01:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-11-19 08:01:11,607 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 13 [2023-11-19 08:01:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:11,609 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-11-19 08:01:11,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 08:01:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-11-19 08:01:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 08:01:11,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:11,626 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:11,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:01:11,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:11,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1518425104, now seen corresponding path program 1 times [2023-11-19 08:01:11,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056073207] [2023-11-19 08:01:11,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:11,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 08:01:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 08:01:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056073207] [2023-11-19 08:01:12,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056073207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:12,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:12,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:01:12,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326854091] [2023-11-19 08:01:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:12,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:01:12,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:01:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:01:12,017 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 08:01:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:12,132 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2023-11-19 08:01:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:01:12,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2023-11-19 08:01:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:12,135 INFO L225 Difference]: With dead ends: 63 [2023-11-19 08:01:12,135 INFO L226 Difference]: Without dead ends: 35 [2023-11-19 08:01:12,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:12,139 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:12,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:01:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-19 08:01:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2023-11-19 08:01:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-19 08:01:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-11-19 08:01:12,151 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2023-11-19 08:01:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:12,152 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-11-19 08:01:12,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 08:01:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-11-19 08:01:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 08:01:12,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:12,155 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 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-19 08:01:12,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:01:12,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:12,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1549340056, now seen corresponding path program 1 times [2023-11-19 08:01:12,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:12,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102241861] [2023-11-19 08:01:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:12,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 08:01:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-19 08:01:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 08:01:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:12,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102241861] [2023-11-19 08:01:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102241861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:12,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:01:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87183488] [2023-11-19 08:01:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:12,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:01:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:01:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:01:12,681 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 08:01:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:12,782 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2023-11-19 08:01:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:01:12,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2023-11-19 08:01:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:12,785 INFO L225 Difference]: With dead ends: 65 [2023-11-19 08:01:12,785 INFO L226 Difference]: Without dead ends: 35 [2023-11-19 08:01:12,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:12,788 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:12,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 100 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:01:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-19 08:01:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-19 08:01:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-19 08:01:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-11-19 08:01:12,798 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 35 [2023-11-19 08:01:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:12,799 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-11-19 08:01:12,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 08:01:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-11-19 08:01:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-19 08:01:12,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:12,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-19 08:01:12,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:01:12,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:12,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:12,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1995545220, now seen corresponding path program 1 times [2023-11-19 08:01:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:12,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829229017] [2023-11-19 08:01:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:13,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:13,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:13,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 08:01:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 08:01:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 08:01:13,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:13,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829229017] [2023-11-19 08:01:13,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829229017] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:01:13,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225319292] [2023-11-19 08:01:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:13,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:13,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:13,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:01:13,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:01:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:13,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 08:01:13,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:01:13,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 08:01:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 08:01:14,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:01:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 08:01:15,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225319292] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:01:15,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:01:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-11-19 08:01:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750261210] [2023-11-19 08:01:15,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:01:15,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-19 08:01:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:15,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-19 08:01:15,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-11-19 08:01:15,146 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 22 states, 16 states have (on average 2.8125) internal successors, (45), 19 states have internal predecessors, (45), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-19 08:01:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:15,665 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2023-11-19 08:01:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 08:01:15,666 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 2.8125) internal successors, (45), 19 states have internal predecessors, (45), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) Word has length 40 [2023-11-19 08:01:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:15,668 INFO L225 Difference]: With dead ends: 71 [2023-11-19 08:01:15,668 INFO L226 Difference]: Without dead ends: 39 [2023-11-19 08:01:15,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2023-11-19 08:01:15,671 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 18 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:15,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 237 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:01:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-19 08:01:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-19 08:01:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-19 08:01:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-11-19 08:01:15,704 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 40 [2023-11-19 08:01:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:15,705 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-11-19 08:01:15,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 2.8125) internal successors, (45), 19 states have internal predecessors, (45), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-19 08:01:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-11-19 08:01:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-19 08:01:15,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:15,709 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 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-19 08:01:15,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 08:01:15,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:15,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:15,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash 512671536, now seen corresponding path program 2 times [2023-11-19 08:01:15,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:15,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522439850] [2023-11-19 08:01:15,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:15,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:16,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:01:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:01:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 08:01:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:17,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522439850] [2023-11-19 08:01:17,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522439850] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:01:17,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951597163] [2023-11-19 08:01:17,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 08:01:17,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:17,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:17,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:01:17,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:01:17,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 08:01:17,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:01:17,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-19 08:01:17,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:01:17,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 08:01:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 08:01:17,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:01:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 08:01:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951597163] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:01:19,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:01:19,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 18] total 29 [2023-11-19 08:01:19,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412901316] [2023-11-19 08:01:19,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:01:19,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-19 08:01:19,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:19,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-19 08:01:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2023-11-19 08:01:19,749 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 29 states, 22 states have (on average 2.272727272727273) internal successors, (50), 24 states have internal predecessors, (50), 9 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2023-11-19 08:01:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:20,092 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2023-11-19 08:01:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 08:01:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.272727272727273) internal successors, (50), 24 states have internal predecessors, (50), 9 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) Word has length 50 [2023-11-19 08:01:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:20,094 INFO L225 Difference]: With dead ends: 77 [2023-11-19 08:01:20,094 INFO L226 Difference]: Without dead ends: 41 [2023-11-19 08:01:20,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=878, Unknown=0, NotChecked=0, Total=1122 [2023-11-19 08:01:20,097 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:20,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 188 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 08:01:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-19 08:01:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-19 08:01:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 9 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-19 08:01:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-11-19 08:01:20,104 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 50 [2023-11-19 08:01:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:20,105 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-11-19 08:01:20,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.272727272727273) internal successors, (50), 24 states have internal predecessors, (50), 9 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2023-11-19 08:01:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-11-19 08:01:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 08:01:20,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:20,109 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 1, 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-19 08:01:20,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 08:01:20,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:20,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:20,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash 288225984, now seen corresponding path program 3 times [2023-11-19 08:01:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:20,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165861507] [2023-11-19 08:01:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:20,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:21,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:22,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:01:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 08:01:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-19 08:01:22,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:22,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165861507] [2023-11-19 08:01:22,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165861507] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:01:22,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993033407] [2023-11-19 08:01:22,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 08:01:22,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:22,133 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:01:22,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 08:01:22,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-19 08:01:22,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:01:22,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-19 08:01:22,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:01:22,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 08:01:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-19 08:01:22,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:01:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 08:01:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993033407] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:01:25,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:01:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 22] total 38 [2023-11-19 08:01:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982115462] [2023-11-19 08:01:25,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:01:25,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-19 08:01:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:25,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-19 08:01:25,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2023-11-19 08:01:25,349 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 38 states, 28 states have (on average 2.107142857142857) internal successors, (59), 32 states have internal predecessors, (59), 13 states have call successors, (21), 8 states have call predecessors, (21), 12 states have return successors, (23), 9 states have call predecessors, (23), 13 states have call successors, (23) [2023-11-19 08:01:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:25,860 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2023-11-19 08:01:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 08:01:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 28 states have (on average 2.107142857142857) internal successors, (59), 32 states have internal predecessors, (59), 13 states have call successors, (21), 8 states have call predecessors, (21), 12 states have return successors, (23), 9 states have call predecessors, (23), 13 states have call successors, (23) Word has length 55 [2023-11-19 08:01:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:25,862 INFO L225 Difference]: With dead ends: 81 [2023-11-19 08:01:25,863 INFO L226 Difference]: Without dead ends: 43 [2023-11-19 08:01:25,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=340, Invalid=1640, Unknown=0, NotChecked=0, Total=1980 [2023-11-19 08:01:25,866 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:25,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 246 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:01:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-19 08:01:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-19 08:01:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-19 08:01:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-11-19 08:01:25,873 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 55 [2023-11-19 08:01:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:25,874 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-11-19 08:01:25,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 28 states have (on average 2.107142857142857) internal successors, (59), 32 states have internal predecessors, (59), 13 states have call successors, (21), 8 states have call predecessors, (21), 12 states have return successors, (23), 9 states have call predecessors, (23), 13 states have call successors, (23) [2023-11-19 08:01:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-11-19 08:01:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-19 08:01:25,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:25,876 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 1, 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-19 08:01:25,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 08:01:26,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:26,093 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:26,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash 141065692, now seen corresponding path program 4 times [2023-11-19 08:01:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:26,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986049427] [2023-11-19 08:01:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:26,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:27,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:27,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:28,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:28,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:28,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 08:01:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:28,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 08:01:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-19 08:01:28,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:28,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986049427] [2023-11-19 08:01:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986049427] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:01:28,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702248506] [2023-11-19 08:01:28,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 08:01:28,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:28,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:28,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:01:28,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 08:01:28,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 08:01:28,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:01:28,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-19 08:01:28,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:01:28,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 08:01:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-19 08:01:28,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:01:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 08:01:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702248506] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:01:31,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:01:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 42 [2023-11-19 08:01:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70305159] [2023-11-19 08:01:31,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:01:31,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-19 08:01:31,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:31,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-19 08:01:31,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2023-11-19 08:01:31,899 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 42 states, 32 states have (on average 1.90625) internal successors, (61), 35 states have internal predecessors, (61), 12 states have call successors, (21), 9 states have call predecessors, (21), 15 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2023-11-19 08:01:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:32,600 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2023-11-19 08:01:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 08:01:32,601 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.90625) internal successors, (61), 35 states have internal predecessors, (61), 12 states have call successors, (21), 9 states have call predecessors, (21), 15 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 60 [2023-11-19 08:01:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:32,604 INFO L225 Difference]: With dead ends: 85 [2023-11-19 08:01:32,605 INFO L226 Difference]: Without dead ends: 45 [2023-11-19 08:01:32,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=494, Invalid=2056, Unknown=0, NotChecked=0, Total=2550 [2023-11-19 08:01:32,612 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:32,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 294 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 08:01:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-19 08:01:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-19 08:01:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 6 states have call successors, (6), 3 states have call predecessors, (6), 11 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-19 08:01:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-11-19 08:01:32,621 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 60 [2023-11-19 08:01:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:32,622 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-11-19 08:01:32,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.90625) internal successors, (61), 35 states have internal predecessors, (61), 12 states have call successors, (21), 9 states have call predecessors, (21), 15 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2023-11-19 08:01:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-11-19 08:01:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-19 08:01:32,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:32,624 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 1, 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-19 08:01:32,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 08:01:32,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:32,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:32,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1379145196, now seen corresponding path program 5 times [2023-11-19 08:01:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694901465] [2023-11-19 08:01:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:34,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:01:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:35,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:01:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:35,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:01:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-19 08:01:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694901465] [2023-11-19 08:01:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694901465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:01:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642127768] [2023-11-19 08:01:35,728 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-19 08:01:35,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:35,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:35,730 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:01:35,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03b88bf4-5d79-4f49-ac01-b860239f624b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 08:01:35,985 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-11-19 08:01:35,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:01:35,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 101 conjunts are in the unsatisfiable core [2023-11-19 08:01:35,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:01:36,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 08:01:38,318 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_62|) (= (store |v_#memory_int_BEFORE_CALL_62| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-19 08:01:40,326 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_62|) (= (store |v_#memory_int_BEFORE_CALL_62| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-19 08:01:42,416 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_63| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_63| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_63| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_63|) (= (store |v_#memory_int_BEFORE_CALL_63| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2023-11-19 08:01:44,417 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_63| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_63| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_63| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_63|) (= (store |v_#memory_int_BEFORE_CALL_63| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2023-11-19 08:01:46,460 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-19 08:01:48,462 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-19 08:01:50,502 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_65| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_65| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_65|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-19 08:01:52,504 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_65| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_65| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_65|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-19 08:01:54,552 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_66| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_66| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_66| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_66| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_66|) (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) is different from false [2023-11-19 08:01:56,554 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_66| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_66| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_66| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_66| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_66|) (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) is different from true [2023-11-19 08:01:58,600 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (or (exists ((|v_#memory_int_638| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int_BEFORE_CALL_66| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_66| |v_#memory_int_638|))) (and (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store |v_#memory_int_BEFORE_CALL_66| .cse0 (select |v_#memory_int_638| .cse0)) |v_#memory_int_638|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_66| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_66|)))) (= (store |v_#memory_int_638| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse1 (select |v_#memory_int_638| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)))) |c_#memory_int|))) (exists ((v_DerPreprocessor_1 (Array Int Int))) (= (let ((.cse2 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_1))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-19 08:01:58,607 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (or (exists ((|v_#memory_int_638| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int_BEFORE_CALL_66| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_66| |v_#memory_int_638|))) (and (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store |v_#memory_int_BEFORE_CALL_66| .cse0 (select |v_#memory_int_638| .cse0)) |v_#memory_int_638|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_66| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_66|)))) (= (store |v_#memory_int_638| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse1 (select |v_#memory_int_638| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)))) |c_#memory_int|))) (exists ((v_DerPreprocessor_1 (Array Int Int))) (= (let ((.cse2 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_1))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true