./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:25:41,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:25:41,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:25:41,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:25:41,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:25:41,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:25:41,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:25:41,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:25:41,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:25:41,645 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:25:41,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:25:41,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:25:41,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:25:41,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:25:41,649 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:25:41,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:25:41,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:25:41,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:25:41,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:25:41,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:25:41,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:25:41,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:25:41,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:25:41,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:25:41,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:25:41,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:25:41,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:25:41,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:25:41,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:25:41,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:25:41,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:25:41,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:25:41,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:25:41,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:25:41,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:25:41,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:25:41,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:25:41,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:25:41,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:25:41,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:25:41,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:25:41,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:25:41,662 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 [2024-11-08 15:25:41,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:25:41,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:25:41,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:25:41,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:25:41,954 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:25:41,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-11-08 15:25:43,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:25:43,692 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:25:43,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-11-08 15:25:43,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e1abe08/baabecd7f45645c6a47f33eb0b69d682/FLAGa7112e023 [2024-11-08 15:25:43,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e1abe08/baabecd7f45645c6a47f33eb0b69d682 [2024-11-08 15:25:43,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:25:43,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:25:43,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:25:43,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:25:43,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:25:43,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:25:43" (1/1) ... [2024-11-08 15:25:43,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711b88a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:43, skipping insertion in model container [2024-11-08 15:25:43,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:25:43" (1/1) ... [2024-11-08 15:25:43,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:25:43,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c[1061,1074] [2024-11-08 15:25:43,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:25:43,999 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:25:44,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c[1061,1074] [2024-11-08 15:25:44,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:25:44,035 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:25:44,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44 WrapperNode [2024-11-08 15:25:44,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:25:44,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:25:44,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:25:44,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:25:44,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,066 INFO L138 Inliner]: procedures = 16, calls = 82, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 92 [2024-11-08 15:25:44,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:25:44,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:25:44,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:25:44,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:25:44,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,096 INFO L175 MemorySlicer]: Split 51 memory accesses to 8 slices as follows [2, 8, 7, 8, 6, 6, 7, 7]. 16 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 2, 0, 2, 2, 2, 1, 1]. [2024-11-08 15:25:44,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:25:44,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:25:44,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:25:44,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:25:44,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (1/1) ... [2024-11-08 15:25:44,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:25:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:25:44,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:25:44,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:25:44,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:25:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 15:25:44,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 15:25:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:25:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 15:25:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 15:25:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 15:25:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 15:25:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 15:25:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 15:25:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-08 15:25:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 15:25:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 15:25:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 15:25:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 15:25:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 15:25:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 15:25:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 15:25:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 15:25:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-08 15:25:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:25:44,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:25:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 15:25:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 15:25:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 15:25:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 15:25:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 15:25:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 15:25:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 15:25:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-08 15:25:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 15:25:44,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 15:25:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 15:25:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_35_to_46_0 [2024-11-08 15:25:44,206 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_35_to_46_0 [2024-11-08 15:25:44,328 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:25:44,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:25:44,553 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 15:25:44,553 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:25:44,569 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:25:44,569 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 15:25:44,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:25:44 BoogieIcfgContainer [2024-11-08 15:25:44,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:25:44,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:25:44,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:25:44,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:25:44,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:25:43" (1/3) ... [2024-11-08 15:25:44,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18be137f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:25:44, skipping insertion in model container [2024-11-08 15:25:44,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:25:44" (2/3) ... [2024-11-08 15:25:44,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18be137f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:25:44, skipping insertion in model container [2024-11-08 15:25:44,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:25:44" (3/3) ... [2024-11-08 15:25:44,579 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_lcm2.c [2024-11-08 15:25:44,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:25:44,596 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:25:44,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:25:44,661 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40e4e5d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:25:44,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:25:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:25:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 15:25:44,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:25:44,671 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:25:44,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:25:44,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:25:44,676 INFO L85 PathProgramCache]: Analyzing trace with hash -680392680, now seen corresponding path program 1 times [2024-11-08 15:25:44,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:25:44,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079524469] [2024-11-08 15:25:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:25:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:25:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:25:44,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:25:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:25:44,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:25:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:25:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:25:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:25:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:25:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:25:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 15:25:44,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:25:44,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079524469] [2024-11-08 15:25:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079524469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:25:44,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:25:44,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:25:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479052014] [2024-11-08 15:25:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:25:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:25:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:25:45,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:25:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:25:45,013 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:25:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:25:45,030 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2024-11-08 15:25:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:25:45,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-08 15:25:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:25:45,038 INFO L225 Difference]: With dead ends: 69 [2024-11-08 15:25:45,038 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 15:25:45,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:25:45,045 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:25:45,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:25:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 15:25:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-08 15:25:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:25:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-08 15:25:45,082 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 33 [2024-11-08 15:25:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:25:45,082 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-08 15:25:45,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:25:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-08 15:25:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 15:25:45,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:25:45,085 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:25:45,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:25:45,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:25:45,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:25:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1986910944, now seen corresponding path program 1 times [2024-11-08 15:25:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:25:45,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320684217] [2024-11-08 15:25:45,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:25:45,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:25:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 15:25:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730362878] [2024-11-08 15:25:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:25:45,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:25:45,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:25:45,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:25:45,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:25:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:25:45,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-08 15:25:45,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:25:45,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 15:25:45,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 15:25:45,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:45,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:45,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:45,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:45,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-08 15:25:45,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 15:25:45,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 15:25:45,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 15:25:45,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 15:25:45,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 15:25:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 15:25:45,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:25:45,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:25:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320684217] [2024-11-08 15:25:45,951 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 15:25:45,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730362878] [2024-11-08 15:25:45,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730362878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:25:45,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:25:45,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:25:45,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071302842] [2024-11-08 15:25:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:25:45,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:25:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:25:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:25:45,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:25:45,955 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:25:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:25:46,279 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-11-08 15:25:46,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:25:46,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2024-11-08 15:25:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:25:46,282 INFO L225 Difference]: With dead ends: 47 [2024-11-08 15:25:46,282 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 15:25:46,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:25:46,283 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:25:46,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 168 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:25:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 15:25:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-11-08 15:25:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-08 15:25:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-11-08 15:25:46,294 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 33 [2024-11-08 15:25:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:25:46,295 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-11-08 15:25:46,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:25:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-11-08 15:25:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 15:25:46,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:25:46,296 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2024-11-08 15:25:46,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:25:46,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:25:46,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:25:46,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:25:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2056489384, now seen corresponding path program 1 times [2024-11-08 15:25:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:25:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403071825] [2024-11-08 15:25:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:25:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:25:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 15:25:46,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786333801] [2024-11-08 15:25:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:25:46,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:25:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:25:46,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:25:46,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:25:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:25:46,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-08 15:25:47,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:25:47,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 15:25:47,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 15:25:47,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:47,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:47,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:47,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:47,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 15:25:47,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 15:25:47,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 15:25:47,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 15:25:47,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-08 15:25:47,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 15:25:47,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 15:25:47,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-08 15:25:47,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 15:25:47,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 15:25:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 15:25:47,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:25:47,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:25:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403071825] [2024-11-08 15:25:47,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 15:25:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786333801] [2024-11-08 15:25:47,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786333801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:25:47,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:25:47,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:25:47,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719225931] [2024-11-08 15:25:47,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:25:47,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:25:47,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:25:47,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:25:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:25:47,467 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 15:25:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:25:47,699 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-11-08 15:25:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:25:47,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2024-11-08 15:25:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:25:47,703 INFO L225 Difference]: With dead ends: 53 [2024-11-08 15:25:47,704 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 15:25:47,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:25:47,705 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:25:47,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:25:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 15:25:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-08 15:25:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-08 15:25:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-08 15:25:47,716 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 43 [2024-11-08 15:25:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:25:47,716 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-08 15:25:47,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 15:25:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-08 15:25:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 15:25:47,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:25:47,721 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:25:47,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:25:47,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 15:25:47,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:25:47,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:25:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1587000741, now seen corresponding path program 1 times [2024-11-08 15:25:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:25:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037184303] [2024-11-08 15:25:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:25:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:25:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 15:25:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723919306] [2024-11-08 15:25:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:25:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:25:48,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:25:48,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:25:48,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:25:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:25:48,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 161 conjuncts are in the unsatisfiable core [2024-11-08 15:25:48,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:25:48,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 15:25:48,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 15:25:48,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:48,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:49,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:49,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:25:53,126 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1 Int)) (let ((.cse0 (select (select |c_#memory_int#7| v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1))) (and (= .cse0 (select (select |c_#memory_int#4| v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1)) (= (select (select |c_#memory_int#1| v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1) .cse0)))) (exists ((v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select (select |c_#memory_int#6| v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1))) (and (= .cse1 (select (select |c_#memory_int#3| v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1)) (= .cse1 (select (select |c_#memory_int#5| v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1)))))) is different from true [2024-11-08 15:25:53,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2024-11-08 15:25:53,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-08 15:25:53,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-08 15:25:53,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-08 15:25:53,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-08 15:25:53,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2024-11-08 15:25:53,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2024-11-08 15:25:53,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 15:25:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2024-11-08 15:25:53,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:25:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 15:25:55,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:25:55,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037184303] [2024-11-08 15:25:55,422 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 15:25:55,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723919306] [2024-11-08 15:25:55,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723919306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:25:55,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:25:55,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2024-11-08 15:25:55,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650726761] [2024-11-08 15:25:55,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 15:25:55,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:25:55,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:25:55,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:25:55,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2024-11-08 15:25:55,425 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 15 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 15:26:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:26:12,848 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2024-11-08 15:26:12,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 15:26:12,849 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-11-08 15:26:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:26:12,850 INFO L225 Difference]: With dead ends: 63 [2024-11-08 15:26:12,850 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 15:26:12,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=4, NotChecked=42, Total=552 [2024-11-08 15:26:12,851 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:26:12,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 230 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 211 Invalid, 0 Unknown, 69 Unchecked, 3.7s Time] [2024-11-08 15:26:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 15:26:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2024-11-08 15:26:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-08 15:26:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-11-08 15:26:12,876 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 44 [2024-11-08 15:26:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:26:12,876 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-08 15:26:12,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 15:26:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-08 15:26:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 15:26:12,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:26:12,878 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 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] [2024-11-08 15:26:12,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:26:13,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:26:13,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:26:13,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:26:13,080 INFO L85 PathProgramCache]: Analyzing trace with hash -575190941, now seen corresponding path program 1 times [2024-11-08 15:26:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:26:13,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138210061] [2024-11-08 15:26:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:26:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:26:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 15:26:13,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803793565] [2024-11-08 15:26:13,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:26:13,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:26:13,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:26:13,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:26:13,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:26:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:26:13,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 181 conjuncts are in the unsatisfiable core [2024-11-08 15:26:13,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:26:13,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 15:26:13,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 15:26:13,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:26:13,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:26:13,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:26:13,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 15:26:13,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 15:26:13,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 15:26:13,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 15:26:13,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 15:26:23,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_old(#memory_int#5)| |c_func_to_recursive_line_35_to_46_0_#in~v.base|)) (.cse4 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_35_to_46_0_#in~x.base|))) (let ((.cse0 (select .cse4 |c_func_to_recursive_line_35_to_46_0_#in~x.offset|)) (.cse3 (select (select |c_old(#memory_int#1)| |c_func_to_recursive_line_35_to_46_0_#in~y.base|) |c_func_to_recursive_line_35_to_46_0_#in~y.offset|)) (.cse1 (select (select |c_old(#memory_int#4)| |c_func_to_recursive_line_35_to_46_0_#in~u.base|) |c_func_to_recursive_line_35_to_46_0_#in~u.offset|)) (.cse2 (select .cse5 |c_func_to_recursive_line_35_to_46_0_#in~v.offset|))) (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|func_to_recursive_line_35_to_46_0_#t~mem9| Int) (|func_to_recursive_line_35_to_46_0_#t~mem8| Int)) (= (mod (+ (* .cse0 .cse1) (* .cse2 .cse3)) 4294967296) (* 2 (mod (* |func_to_recursive_line_35_to_46_0_#t~mem9| |func_to_recursive_line_35_to_46_0_#t~mem8|) 2147483648)))) (= (* 2 (mod (* (select (select |c_#memory_int#7| |c_func_to_recursive_line_35_to_46_0_#in~b.base|) |c_func_to_recursive_line_35_to_46_0_#in~b.offset|) (select (select |c_#memory_int#6| |c_func_to_recursive_line_35_to_46_0_#in~a.base|) |c_func_to_recursive_line_35_to_46_0_#in~a.offset|)) 2147483648)) (mod (+ (* (select (select |c_#memory_int#3| |c_func_to_recursive_line_35_to_46_0_#in~x.base|) |c_func_to_recursive_line_35_to_46_0_#in~x.offset|) (select (select |c_#memory_int#4| |c_func_to_recursive_line_35_to_46_0_#in~u.base|) |c_func_to_recursive_line_35_to_46_0_#in~u.offset|)) (* (select (select |c_#memory_int#5| |c_func_to_recursive_line_35_to_46_0_#in~v.base|) |c_func_to_recursive_line_35_to_46_0_#in~v.offset|) (select (select |c_#memory_int#1| |c_func_to_recursive_line_35_to_46_0_#in~y.base|) |c_func_to_recursive_line_35_to_46_0_#in~y.offset|))) 4294967296)) (= (store |c_old(#memory_int#3)| |c_func_to_recursive_line_35_to_46_0_#in~x.base| (store .cse4 |c_func_to_recursive_line_35_to_46_0_#in~x.offset| (+ .cse0 (* (- 1) .cse3)))) |c_#memory_int#3|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_#memory_int#5| (store |c_old(#memory_int#5)| |c_func_to_recursive_line_35_to_46_0_#in~v.base| (store .cse5 |c_func_to_recursive_line_35_to_46_0_#in~v.offset| (+ .cse1 .cse2))))))) is different from false [2024-11-08 15:26:24,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2024-11-08 15:26:24,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2024-11-08 15:26:24,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2024-11-08 15:26:24,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 53 [2024-11-08 15:26:24,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2024-11-08 15:26:24,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2024-11-08 15:26:24,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2024-11-08 15:26:24,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-11-08 15:26:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 2 not checked. [2024-11-08 15:26:24,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:26:36,325 WARN L286 SmtUtils]: Spent 10.30s on a formula simplification that was a NOOP. DAG size: 184 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-08 15:26:49,321 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-08 15:27:00,317 WARN L286 SmtUtils]: Spent 10.99s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-08 15:27:06,925 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4| Int)) (let ((.cse0 (* 2 (mod (* (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4|)) 2147483648)))) (or (= .cse0 (mod (+ (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4|)) (* (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#1| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4|))) 4294967296)) (not (= .cse0 (mod (+ (* (select (select |c_old(#memory_int#4)| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4|) (select (select |c_old(#memory_int#3)| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4|)) (* (select (select |c_old(#memory_int#1)| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4|) (select (select |c_old(#memory_int#5)| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4|))) 4294967296)))))) (or (= (* 2 (mod (* (select (select |c_#memory_int#7| |c_func_to_recursive_line_35_to_46_0_#in~b.base|) |c_func_to_recursive_line_35_to_46_0_#in~b.offset|) (select (select |c_#memory_int#6| |c_func_to_recursive_line_35_to_46_0_#in~a.base|) |c_func_to_recursive_line_35_to_46_0_#in~a.offset|)) 2147483648)) (mod (+ (* (select (select |c_old(#memory_int#3)| |c_func_to_recursive_line_35_to_46_0_#in~x.base|) |c_func_to_recursive_line_35_to_46_0_#in~x.offset|) (select (select |c_old(#memory_int#4)| |c_func_to_recursive_line_35_to_46_0_#in~u.base|) |c_func_to_recursive_line_35_to_46_0_#in~u.offset|)) (* (select (select |c_old(#memory_int#5)| |c_func_to_recursive_line_35_to_46_0_#in~v.base|) |c_func_to_recursive_line_35_to_46_0_#in~v.offset|) (select (select |c_old(#memory_int#1)| |c_func_to_recursive_line_35_to_46_0_#in~y.base|) |c_func_to_recursive_line_35_to_46_0_#in~y.offset|))) 4294967296)) (forall ((|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4| Int)) (= (* 2 (mod (* (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4|)) 2147483648)) (mod (+ (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_4|)) (* (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#1| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_4|))) 4294967296))))) is different from false [2024-11-08 15:27:11,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138210061] [2024-11-08 15:27:11,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 15:27:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803793565] [2024-11-08 15:27:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803793565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:27:11,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:27:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-08 15:27:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406103175] [2024-11-08 15:27:11,189 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 15:27:11,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 15:27:11,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:11,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 15:27:11,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=362, Unknown=3, NotChecked=78, Total=506 [2024-11-08 15:27:11,191 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 17 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 6 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8)