./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i --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_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/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_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/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_fefd066d-2d8e-426d-bac8-ad214c36caf1/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 7a78b2f82c5c523b03c70ba898547797b8578723f2b367d871b1e6ef867cb4b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:32:47,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:32:48,019 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:32:48,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:32:48,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:32:48,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:32:48,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:32:48,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:32:48,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:32:48,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:32:48,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:32:48,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:32:48,051 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:32:48,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:32:48,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:32:48,053 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:32:48,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:32:48,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:32:48,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:32:48,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:32:48,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:32:48,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:32:48,058 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:32:48,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:32:48,059 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:32:48,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:32:48,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:32:48,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:32:48,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:48,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:32:48,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:32:48,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:32:48,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:32:48,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:32:48,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:32:48,064 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:32:48,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:32:48,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:32:48,065 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:32:48,066 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_fefd066d-2d8e-426d-bac8-ad214c36caf1/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_fefd066d-2d8e-426d-bac8-ad214c36caf1/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 -> 7a78b2f82c5c523b03c70ba898547797b8578723f2b367d871b1e6ef867cb4b5 [2023-11-19 07:32:48,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:32:48,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:32:48,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:32:48,422 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:32:48,423 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:32:48,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i [2023-11-19 07:32:51,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:32:51,779 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:32:51,779 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i [2023-11-19 07:32:51,787 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/data/fb29553c3/571bfe8a7b764325a4cb41f16e62063e/FLAG74537cadf [2023-11-19 07:32:51,802 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/data/fb29553c3/571bfe8a7b764325a4cb41f16e62063e [2023-11-19 07:32:51,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:32:51,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:32:51,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:51,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:32:51,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:32:51,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:51" (1/1) ... [2023-11-19 07:32:51,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1d8215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:51, skipping insertion in model container [2023-11-19 07:32:51,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:51" (1/1) ... [2023-11-19 07:32:51,848 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:32:52,025 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_fefd066d-2d8e-426d-bac8-ad214c36caf1/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i[1898,1911] [2023-11-19 07:32:52,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:52,074 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:32:52,088 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_fefd066d-2d8e-426d-bac8-ad214c36caf1/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i[1898,1911] [2023-11-19 07:32:52,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:52,121 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:32:52,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52 WrapperNode [2023-11-19 07:32:52,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:52,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:52,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:32:52,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:32:52,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,160 INFO L138 Inliner]: procedures = 18, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2023-11-19 07:32:52,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:52,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:32:52,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:32:52,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:32:52,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:32:52,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:32:52,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:32:52,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:32:52,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (1/1) ... [2023-11-19 07:32:52,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:52,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:32:52,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:32:52,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:32:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:32:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:32:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:32:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:32:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_41_0 [2023-11-19 07:32:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_41_0 [2023-11-19 07:32:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_44_to_45_0 [2023-11-19 07:32:52,270 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_44_to_45_0 [2023-11-19 07:32:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:32:52,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:32:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:32:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:32:52,368 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:32:52,371 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:32:52,595 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:32:52,604 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:32:52,604 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:32:52,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:52 BoogieIcfgContainer [2023-11-19 07:32:52,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:32:52,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:32:52,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:32:52,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:32:52,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:32:51" (1/3) ... [2023-11-19 07:32:52,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64258f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:32:52, skipping insertion in model container [2023-11-19 07:32:52,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:52" (2/3) ... [2023-11-19 07:32:52,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64258f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:32:52, skipping insertion in model container [2023-11-19 07:32:52,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:52" (3/3) ... [2023-11-19 07:32:52,624 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_3.i [2023-11-19 07:32:52,644 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:32:52,645 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:32:52,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:32:52,699 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;@70274f43, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:32:52,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:32:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:32:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 07:32:52,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:32:52,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:32:52,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:32:52,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1413062803, now seen corresponding path program 1 times [2023-11-19 07:32:52,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:52,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191845077] [2023-11-19 07:32:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:52,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:53,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:32:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:53,700 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 07:32:53,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:53,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191845077] [2023-11-19 07:32:53,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191845077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:32:53,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:32:53,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:32:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77025191] [2023-11-19 07:32:53,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:32:53,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:32:53,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:32:53,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:32:53,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:32:53,740 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:32:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:32:53,932 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2023-11-19 07:32:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:32:53,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-19 07:32:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:32:53,949 INFO L225 Difference]: With dead ends: 47 [2023-11-19 07:32:53,949 INFO L226 Difference]: Without dead ends: 21 [2023-11-19 07:32:53,953 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 07:32:53,961 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:32:53,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:32:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-19 07:32:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-19 07:32:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:32:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-11-19 07:32:54,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2023-11-19 07:32:54,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:32:54,033 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-11-19 07:32:54,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:32:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-11-19 07:32:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 07:32:54,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:32:54,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:32:54,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:32:54,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:32:54,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1244657017, now seen corresponding path program 1 times [2023-11-19 07:32:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:54,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098736144] [2023-11-19 07:32:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:54,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:54,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:32:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:55,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:32:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:32:55,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098736144] [2023-11-19 07:32:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098736144] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:32:55,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866748250] [2023-11-19 07:32:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:55,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:32:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:32:55,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:32:55,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:32:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:55,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-19 07:32:55,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:32:55,635 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:32:55,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-19 07:32:56,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:32:56,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2023-11-19 07:32:56,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:32:56,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:32:56,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:32:56,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2023-11-19 07:32:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:32:56,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:32:57,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866748250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:32:57,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:32:57,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-11-19 07:32:57,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595781752] [2023-11-19 07:32:57,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:32:57,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 07:32:57,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:32:57,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 07:32:57,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:32:57,247 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 15 states, 11 states have (on average 2.0) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:32:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:32:59,627 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-11-19 07:32:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:32:59,627 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.0) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2023-11-19 07:32:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:32:59,629 INFO L225 Difference]: With dead ends: 41 [2023-11-19 07:32:59,629 INFO L226 Difference]: Without dead ends: 28 [2023-11-19 07:32:59,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2023-11-19 07:32:59,631 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:32:59,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 85 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:32:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-19 07:32:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-11-19 07:32:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:32:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-19 07:32:59,642 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2023-11-19 07:32:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:32:59,643 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-19 07:32:59,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.0) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:32:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-19 07:32:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 07:32:59,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:32:59,645 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:32:59,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:32:59,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:32:59,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:32:59,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash -851271167, now seen corresponding path program 2 times [2023-11-19 07:32:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:59,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578674526] [2023-11-19 07:32:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:33:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:01,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:33:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:33:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:33:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578674526] [2023-11-19 07:33:01,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578674526] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:33:01,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585756713] [2023-11-19 07:33:01,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:33:01,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:33:01,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:01,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:33:01,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fefd066d-2d8e-426d-bac8-ad214c36caf1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:33:01,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:33:01,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:33:01,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-19 07:33:02,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:02,019 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:33:02,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-11-19 07:33:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 07:33:11,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:33:13,300 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_main_~#array~0#1.base| |c_ULTIMATE.start_main_~#tmp~0#1.base|)) (.cse37 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296)) (.cse9 (= |c_ULTIMATE.start_main_~#array~0#1.base| |c_ULTIMATE.start_main_~#index~0#1.base|))) (let ((.cse16 (not .cse9)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse6 (* .cse37 4)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#tmp~0#1.base|)) (.cse8 (not .cse10))) (and (or (and (or (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse1 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse1) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse3 (mod (select (select .cse2 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse1) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse3 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000) (< .cse3 2147483648)))))) .cse8) (or .cse9 .cse10 (forall ((v_ArrVal_138 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse12 (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse12) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse14 (mod (select (select .cse13 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< (mod (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse12) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse14 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000) (< .cse14 2147483648))))))) (or .cse16 (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_DerPreprocessor_34 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse19 (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse21 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse19) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse17 (mod (select (select .cse20 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< 2147483647 .cse17) (< (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse19) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse17 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000))))))) (or .cse8 (forall ((v_ArrVal_138 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse24 (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse26 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse26 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse24) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse22 (mod (select (select .cse25 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< 2147483647 .cse22) (< (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse24) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse22 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse23 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000))))))) (or (forall ((v_ArrVal_138 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse28 (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse31 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse31 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse28) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse30 (mod (select (select .cse29 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse28) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse30 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse27 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse27 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000) (< .cse30 2147483648)))))) .cse16) (or (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse34 (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse36 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse36 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse34) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse32 (mod (select (select .cse35 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< 2147483647 .cse32) (< (mod (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse34) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse32 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse33 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse33 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000)))))) .cse9 .cse10)) (< 2147483647 .cse37)) (or (< .cse37 2147483648) (and (or .cse9 .cse10 (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse39 (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ (- 17179869184) .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse42 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse42 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse39) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse41 (mod (select (select .cse40 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< (mod (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse38 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse39) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse41 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse38 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse38 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000) (< .cse41 2147483648))))))) (or .cse16 (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_DerPreprocessor_29 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse45 (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ (- 17179869184) .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse47 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse47 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse45) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse43 (mod (select (select .cse46 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< 2147483647 .cse43) (< (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse45) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse46 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse43 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse44 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ 1 (select .cse44 |c_ULTIMATE.start_main_~#index~0#1.offset|))))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000))))))) (or (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse49 (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ (- 17179869184) .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse52 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse52 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse49) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse51 (mod (select (select .cse50 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse49) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse50 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse51 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse48 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ 1 (select .cse48 |c_ULTIMATE.start_main_~#index~0#1.offset|))))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000) (< 2147483647 .cse51)))))) .cse8) (or .cse16 (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse54 (let ((.cse57 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ (- 17179869184) .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse57 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse57 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse54) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse56 (mod (select (select .cse55 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse53 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse54) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse55 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse56 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse53 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse53 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000) (< .cse56 2147483648))))))) (or (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_DerPreprocessor_24 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse60 (let ((.cse62 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ (- 17179869184) .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse62 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse62 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse60) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse58 (mod (select (select .cse61 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< 2147483647 .cse58) (< (mod (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse59 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse60) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse61 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse58 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse59 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ 1 (select .cse59 |c_ULTIMATE.start_main_~#index~0#1.offset|))))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000)))))) .cse9 .cse10) (or (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~array.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_21 Int) (v_func_to_recursive_line_38_to_41_0_~array.offset_22 Int) (v_DerPreprocessor_22 (Array Int Int)) (v_func_to_recursive_line_38_to_41_0_~tmp.offset_22 Int)) (let ((.cse64 (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| (store .cse5 (+ (- 17179869184) .cse6 v_func_to_recursive_line_38_to_41_0_~array.offset_21) (select .cse7 v_func_to_recursive_line_38_to_41_0_~tmp.offset_21))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse67 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse67 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1))))) (let ((.cse65 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base| v_ArrVal_140) |c_ULTIMATE.start_main_~#index~0#1.base| .cse64) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138))) (let ((.cse66 (mod (select (select .cse65 |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296))) (or (< (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| (let ((.cse63 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#index~0#1.base| .cse64) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#array~0#1.base| (store (select .cse65 |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (- 17179869184) v_func_to_recursive_line_38_to_41_0_~array.offset_22 (* .cse66 4)) (select v_ArrVal_138 v_func_to_recursive_line_38_to_41_0_~tmp.offset_22))) |c_ULTIMATE.start_main_~#index~0#1.base|))) (store .cse63 |c_ULTIMATE.start_main_~#index~0#1.offset| (+ (select .cse63 |c_ULTIMATE.start_main_~#index~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#tmp~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#index~0#1.base|) |c_ULTIMATE.start_main_~#index~0#1.offset|) 4294967296) 10000) (< .cse66 2147483648)))))) .cse8)))))) is different from false [2023-11-19 07:33:14,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585756713] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:33:14,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:33:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-11-19 07:33:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842735484] [2023-11-19 07:33:14,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:33:14,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-19 07:33:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-19 07:33:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=325, Unknown=3, NotChecked=36, Total=420 [2023-11-19 07:33:14,060 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 20 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:33:16,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:33:32,196 WARN L293 SmtUtils]: Spent 11.14s on a formula simplification. DAG size of input: 235 DAG size of output: 226 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-19 07:33:47,047 WARN L293 SmtUtils]: Spent 10.26s on a formula simplification. DAG size of input: 233 DAG size of output: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-19 07:33:48,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:33:49,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]