./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_loop-crafted/recursified_simple_vardep_2.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 53d776429169be2026863283cb18a34602ad7ee3b29f4a2a38a6e26dad3008de --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:27:48,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:27:48,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:27:48,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:27:48,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:27:48,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:27:48,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:27:48,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:27:48,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:27:48,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:27:48,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:27:48,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:27:48,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:27:48,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:27:48,961 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:27:48,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:27:48,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:27:48,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:27:48,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:27:48,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:27:48,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:27:48,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:27:48,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:27:48,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:27:48,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:27:48,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:27:48,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:27:48,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:27:48,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:27:48,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:27:48,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:27:48,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:27:48,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:27:48,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:27:48,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:27:48,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:27:48,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:27:48,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:27:48,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:27:48,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:27:48,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:27:48,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:27:48,969 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 -> 53d776429169be2026863283cb18a34602ad7ee3b29f4a2a38a6e26dad3008de [2024-11-18 14:27:49,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:27:49,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:27:49,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:27:49,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:27:49,241 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:27:49,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c [2024-11-18 14:27:50,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:27:50,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:27:50,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c [2024-11-18 14:27:50,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57c53302f/e05e3c75a9ea4eebbd47279923dcb261/FLAG177c8f2cb [2024-11-18 14:27:51,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57c53302f/e05e3c75a9ea4eebbd47279923dcb261 [2024-11-18 14:27:51,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:27:51,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:27:51,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:27:51,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:27:51,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:27:51,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ad29e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51, skipping insertion in model container [2024-11-18 14:27:51,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:27:51,409 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_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2024-11-18 14:27:51,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:27:51,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:27:51,440 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_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2024-11-18 14:27:51,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:27:51,460 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:27:51,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51 WrapperNode [2024-11-18 14:27:51,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:27:51,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:27:51,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:27:51,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:27:51,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,487 INFO L138 Inliner]: procedures = 14, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-11-18 14:27:51,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:27:51,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:27:51,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:27:51,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:27:51,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,514 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 5, 4, 5]. 31 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-11-18 14:27:51,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:27:51,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:27:51,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:27:51,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:27:51,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (1/1) ... [2024-11-18 14:27:51,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:27:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:27:51,558 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-18 14:27:51,561 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-18 14:27:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:27:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:27:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 14:27:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 14:27:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-18 14:27:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 14:27:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 14:27:51,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 14:27:51,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 14:27:51,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-18 14:27:51,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:27:51,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:27:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 14:27:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 14:27:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 14:27:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-18 14:27:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_24_0 [2024-11-18 14:27:51,616 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_24_0 [2024-11-18 14:27:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 14:27:51,709 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:27:51,711 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:27:51,889 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-18 14:27:51,889 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:27:51,903 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:27:51,903 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-18 14:27:51,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:27:51 BoogieIcfgContainer [2024-11-18 14:27:51,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:27:51,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:27:51,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:27:51,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:27:51,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:27:51" (1/3) ... [2024-11-18 14:27:51,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121ddb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:27:51, skipping insertion in model container [2024-11-18 14:27:51,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:51" (2/3) ... [2024-11-18 14:27:51,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121ddb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:27:51, skipping insertion in model container [2024-11-18 14:27:51,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:27:51" (3/3) ... [2024-11-18 14:27:51,916 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_2.c [2024-11-18 14:27:51,937 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:27:51,937 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:27:52,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:27:52,020 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;@2563fc0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:27:52,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:27:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 14:27:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-18 14:27:52,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:27:52,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:27:52,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:27:52,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:27:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 231684199, now seen corresponding path program 1 times [2024-11-18 14:27:52,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:27:52,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365845287] [2024-11-18 14:27:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:27:52,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:27:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:27:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:27:52,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:27:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365845287] [2024-11-18 14:27:52,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365845287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:27:52,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:27:52,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:27:52,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751983678] [2024-11-18 14:27:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:27:52,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:27:52,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:27:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:27:52,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:27:52,894 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:27:53,010 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-18 14:27:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:27:53,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-18 14:27:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:27:53,017 INFO L225 Difference]: With dead ends: 39 [2024-11-18 14:27:53,018 INFO L226 Difference]: Without dead ends: 15 [2024-11-18 14:27:53,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:27:53,025 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:27:53,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:27:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-18 14:27:53,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-18 14:27:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-18 14:27:53,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 9 [2024-11-18 14:27:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:27:53,067 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-18 14:27:53,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-18 14:27:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-18 14:27:53,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:27:53,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:27:53,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:27:53,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:27:53,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:27:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 231624617, now seen corresponding path program 1 times [2024-11-18 14:27:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:27:53,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987898986] [2024-11-18 14:27:53,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:27:53,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:27:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:27:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:27:53,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:27:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987898986] [2024-11-18 14:27:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987898986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:27:53,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:27:53,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 14:27:53,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978450709] [2024-11-18 14:27:53,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:27:53,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 14:27:53,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:27:53,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 14:27:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-18 14:27:53,547 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:27:53,670 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-18 14:27:53,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 14:27:53,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-18 14:27:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:27:53,673 INFO L225 Difference]: With dead ends: 21 [2024-11-18 14:27:53,674 INFO L226 Difference]: Without dead ends: 19 [2024-11-18 14:27:53,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-18 14:27:53,677 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:27:53,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:27:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-18 14:27:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-11-18 14:27:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-18 14:27:53,685 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2024-11-18 14:27:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:27:53,685 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-18 14:27:53,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-18 14:27:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 14:27:53,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:27:53,686 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:27:53,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:27:53,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:27:53,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:27:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2028041086, now seen corresponding path program 1 times [2024-11-18 14:27:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:27:53,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182392330] [2024-11-18 14:27:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:27:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:27:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:27:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:27:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:27:54,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182392330] [2024-11-18 14:27:54,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182392330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:27:54,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049104281] [2024-11-18 14:27:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:27:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:27:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:27:54,440 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-18 14:27:54,442 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-18 14:27:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:27:54,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-18 14:27:54,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:27:54,921 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 19 treesize of output 11 [2024-11-18 14:27:54,938 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 19 treesize of output 11 [2024-11-18 14:27:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:27:55,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:27:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:27:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049104281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:27:55,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:27:55,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2024-11-18 14:27:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334856942] [2024-11-18 14:27:55,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:27:55,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 14:27:55,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:27:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 14:27:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-18 14:27:55,386 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:27:55,552 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-18 14:27:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 14:27:55,552 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-18 14:27:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:27:55,553 INFO L225 Difference]: With dead ends: 30 [2024-11-18 14:27:55,553 INFO L226 Difference]: Without dead ends: 21 [2024-11-18 14:27:55,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2024-11-18 14:27:55,554 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:27:55,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:27:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-18 14:27:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-11-18 14:27:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-11-18 14:27:55,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 16 [2024-11-18 14:27:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:27:55,559 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-11-18 14:27:55,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-11-18 14:27:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 14:27:55,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:27:55,560 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:27:55,578 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-18 14:27:55,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:27:55,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:27:55,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:27:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2028100668, now seen corresponding path program 1 times [2024-11-18 14:27:55,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:27:55,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618065554] [2024-11-18 14:27:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:27:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:27:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:27:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:27:56,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:27:56,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618065554] [2024-11-18 14:27:56,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618065554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:27:56,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996243092] [2024-11-18 14:27:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:27:56,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:27:56,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:27:56,472 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-18 14:27:56,473 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-18 14:27:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:27:56,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-18 14:27:56,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:27:57,004 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 19 treesize of output 11 [2024-11-18 14:27:57,015 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 19 treesize of output 11 [2024-11-18 14:27:57,168 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 19 treesize of output 11 [2024-11-18 14:27:57,174 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 19 treesize of output 11 [2024-11-18 14:27:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:27:57,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:27:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:27:57,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996243092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:27:57,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:27:57,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 21 [2024-11-18 14:27:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884433590] [2024-11-18 14:27:57,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:27:57,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 14:27:57,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:27:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 14:27:57,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-18 14:27:57,621 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 21 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:27:58,092 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2024-11-18 14:27:58,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 14:27:58,093 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-18 14:27:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:27:58,093 INFO L225 Difference]: With dead ends: 26 [2024-11-18 14:27:58,093 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 14:27:58,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2024-11-18 14:27:58,095 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:27:58,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:27:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 14:27:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 14:27:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 14:27:58,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-11-18 14:27:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:27:58,099 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 14:27:58,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:27:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 14:27:58,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 14:27:58,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:27:58,120 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-18 14:27:58,307 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,SelfDestructingSolverStorable3 [2024-11-18 14:27:58,311 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-18 14:27:58,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 14:27:58,716 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:27:58,739 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_24_0 contained old-variable. Original clause: (let ((.cse7 (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_#in~k#1.base|)) (.cse1 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse2 (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse10 (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse0 (select .cse10 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse6 (select .cse2 0)) (.cse4 (not (= |func_to_recursive_line_20_to_24_0_#in~i#1.offset| 0))) (.cse5 (not (= |func_to_recursive_line_20_to_24_0_#in~j#1.offset| 0))) (.cse8 (select .cse1 0)) (.cse3 (select (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~i#1.base|) |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse9 (select .cse7 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|))) (and (= (select (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~k#1.base|) |func_to_recursive_line_20_to_24_0_#in~k#1.offset|) (* .cse0 3)) (= (* 2 (mod .cse0 2147483648)) (mod (select .cse1 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|) 4294967296)) (= (mod (select .cse2 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|) 4294967296) (* (mod .cse3 2147483648) 2)) (or .cse4 (not (= |func_to_recursive_line_20_to_24_0_#in~k#1.offset| 0)) .cse5 (and (= .cse6 0) (= (select .cse7 0) 0)) (not (= .cse8 0)) (not (= .cse0 0))) (or (and (= .cse6 2) (= .cse9 3)) .cse4 .cse5 (not (= 2 .cse8)) (not (= (select .cse10 0) 1))) (= (* .cse3 3) .cse9)))) Eliminated clause: (let ((.cse10 (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (let ((.cse1 (select (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~i#1.base|) |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse2 (select .cse10 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) (.cse0 (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_#in~j#1.base|))) (and (= (mod (select .cse0 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|) 4294967296) (* (mod .cse1 2147483648) 2)) (= (* .cse1 3) .cse2) (exists ((|old(#memory_int#1)| (Array Int (Array Int Int))) (|old(#memory_int#3)| (Array Int (Array Int Int))) (|old(#memory_int#2)| (Array Int (Array Int Int)))) (let ((.cse4 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse11 (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse3 (select .cse11 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse9 (select .cse11 0)) (.cse6 (not (= |func_to_recursive_line_20_to_24_0_#in~i#1.offset| 0))) (.cse7 (not (= |func_to_recursive_line_20_to_24_0_#in~j#1.offset| 0))) (.cse5 (select .cse0 0)) (.cse8 (select .cse4 0))) (and (= (select (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~k#1.base|) |func_to_recursive_line_20_to_24_0_#in~k#1.offset|) (* .cse3 3)) (= (* 2 (mod .cse3 2147483648)) (mod (select .cse4 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|) 4294967296)) (or (and (= .cse5 2) (= .cse2 3)) .cse6 .cse7 (not (= 2 .cse8)) (not (= .cse9 1))) (or (not (= .cse9 0)) .cse6 (not (= |func_to_recursive_line_20_to_24_0_#in~k#1.offset| 0)) .cse7 (and (= .cse5 0) (= (select .cse10 0) 0)) (not (= .cse8 0)))))))))) [2024-11-18 14:27:58,756 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-18 14:27:58,759 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-18 14:27:58,759 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~j!base,]]] [2024-11-18 14:27:58,761 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-18 14:27:58,761 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-18 14:27:58,761 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] [2024-11-18 14:27:58,763 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-18 14:27:58,763 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-18 14:27:58,763 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] [2024-11-18 14:27:58,763 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-18 14:27:58,763 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-18 14:27:58,781 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~k!base,]]] [2024-11-18 14:27:58,781 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 14:27:58,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-18 14:27:58,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-18 14:27:58,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~k!base,]]] [2024-11-18 14:27:58,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-18 14:27:58,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-11-18 14:27:58,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!base,]]] [2024-11-18 14:27:58,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-18 14:27:58,782 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-11-18 14:27:58,783 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!base,]]] [2024-11-18 14:27:58,783 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-18 14:27:58,783 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-18 14:27:58,783 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~j!base,]]] [2024-11-18 14:27:58,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:27:58 BoogieIcfgContainer [2024-11-18 14:27:58,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:27:58,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:27:58,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:27:58,792 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:27:58,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:27:51" (3/4) ... [2024-11-18 14:27:58,795 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 14:27:58,798 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_24_0 [2024-11-18 14:27:58,801 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-18 14:27:58,802 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-18 14:27:58,803 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 14:27:58,803 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 14:27:58,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:27:58,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 14:27:58,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:27:58,884 INFO L158 Benchmark]: Toolchain (without parser) took 7678.23ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 129.8MB in the beginning and 197.5MB in the end (delta: -67.7MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-18 14:27:58,885 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:27:58,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.89ms. Allocated memory is still 159.4MB. Free memory was 128.7MB in the beginning and 117.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 14:27:58,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.75ms. Allocated memory is still 159.4MB. Free memory was 117.2MB in the beginning and 115.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:27:58,885 INFO L158 Benchmark]: Boogie Preprocessor took 35.52ms. Allocated memory is still 159.4MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:27:58,886 INFO L158 Benchmark]: RCFGBuilder took 375.72ms. Allocated memory is still 159.4MB. Free memory was 113.0MB in the beginning and 100.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 14:27:58,886 INFO L158 Benchmark]: TraceAbstraction took 6880.30ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 99.4MB in the beginning and 201.7MB in the end (delta: -102.3MB). Peak memory consumption was 104.3MB. Max. memory is 16.1GB. [2024-11-18 14:27:58,886 INFO L158 Benchmark]: Witness Printer took 94.71ms. Allocated memory is still 232.8MB. Free memory was 201.7MB in the beginning and 197.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:27:58,888 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.89ms. Allocated memory is still 159.4MB. Free memory was 128.7MB in the beginning and 117.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.75ms. Allocated memory is still 159.4MB. Free memory was 117.2MB in the beginning and 115.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.52ms. Allocated memory is still 159.4MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.72ms. Allocated memory is still 159.4MB. Free memory was 113.0MB in the beginning and 100.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6880.30ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 99.4MB in the beginning and 201.7MB in the end (delta: -102.3MB). Peak memory consumption was 104.3MB. Max. memory is 16.1GB. * Witness Printer took 94.71ms. Allocated memory is still 232.8MB. Free memory was 201.7MB in the beginning and 197.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~j!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~i!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~k!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~k!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~i!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~j!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 300 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 39 mSDtfsCounter, 300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 1325 SizeOfPredicates, 40 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 11/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-18 14:27:58,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE