./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 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_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-?-c7c6ca5-m [2024-11-08 15:22:31,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:22:31,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:22:31,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:22:31,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:22:31,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:22:31,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:22:31,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:22:32,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:22:32,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:22:32,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:22:32,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:22:32,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:22:32,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:22:32,002 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:22:32,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:22:32,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:22:32,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:22:32,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:22:32,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:22:32,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:22:32,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:22:32,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:22:32,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:22:32,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:22:32,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:22:32,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:22:32,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:22:32,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:22:32,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:22:32,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:22:32,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:22:32,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:22:32,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:22:32,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:22:32,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:22:32,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:22:32,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:22:32,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:22:32,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:22:32,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:22:32,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:22:32,015 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-08 15:22:32,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:22:32,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:22:32,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:22:32,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:22:32,290 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:22:32,291 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-08 15:22:33,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:22:33,849 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:22:33,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c [2024-11-08 15:22:33,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a99e89/815d661760d24b1a8caea56fcd2bf844/FLAGf56310554 [2024-11-08 15:22:34,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a99e89/815d661760d24b1a8caea56fcd2bf844 [2024-11-08 15:22:34,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:22:34,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:22:34,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:22:34,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:22:34,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:22:34,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21129dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34, skipping insertion in model container [2024-11-08 15:22:34,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:22:34,449 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-08 15:22:34,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:22:34,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:22:34,512 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-08 15:22:34,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:22:34,537 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:22:34,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34 WrapperNode [2024-11-08 15:22:34,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:22:34,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:22:34,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:22:34,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:22:34,565 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:22:34" (1/1) ... [2024-11-08 15:22:34,573 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:22:34" (1/1) ... [2024-11-08 15:22:34,592 INFO L138 Inliner]: procedures = 14, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-11-08 15:22:34,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:22:34,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:22:34,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:22:34,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:22:34,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,625 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 5, 5, 4]. 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-08 15:22:34,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:22:34,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:22:34,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:22:34,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:22:34,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (1/1) ... [2024-11-08 15:22:34,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:22:34,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:22:34,686 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:22:34,689 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:22:34,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:22:34,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:22:34,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 15:22:34,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 15:22:34,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 15:22:34,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 15:22:34,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 15:22:34,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 15:22:34,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 15:22:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 15:22:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:22:34,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:22:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 15:22:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 15:22:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 15:22:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 15:22:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_24_0 [2024-11-08 15:22:34,738 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_24_0 [2024-11-08 15:22:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 15:22:34,830 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:22:34,833 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:22:35,017 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 15:22:35,017 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:22:35,032 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:22:35,033 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:22:35,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:22:35 BoogieIcfgContainer [2024-11-08 15:22:35,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:22:35,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:22:35,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:22:35,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:22:35,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:22:34" (1/3) ... [2024-11-08 15:22:35,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6d7996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:22:35, skipping insertion in model container [2024-11-08 15:22:35,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:22:34" (2/3) ... [2024-11-08 15:22:35,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6d7996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:22:35, skipping insertion in model container [2024-11-08 15:22:35,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:22:35" (3/3) ... [2024-11-08 15:22:35,044 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_2.c [2024-11-08 15:22:35,059 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:22:35,059 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:22:35,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:22:35,126 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;@7e91e47c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:22:35,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:22:35,131 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-08 15:22:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 15:22:35,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:35,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:35,139 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-08 15:22:35,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash 231684199, now seen corresponding path program 1 times [2024-11-08 15:22:35,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:35,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266910334] [2024-11-08 15:22:35,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:36,005 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-08 15:22:36,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:36,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266910334] [2024-11-08 15:22:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266910334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:22:36,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:22:36,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:22:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200248533] [2024-11-08 15:22:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:22:36,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:22:36,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:36,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:22:36,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:22:36,034 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-08 15:22:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:36,140 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-08 15:22:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:22:36,142 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-08 15:22:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:36,149 INFO L225 Difference]: With dead ends: 39 [2024-11-08 15:22:36,150 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 15:22:36,153 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-08 15:22:36,156 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-08 15:22:36,157 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-08 15:22:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 15:22:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 15:22:36,195 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-08 15:22:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-08 15:22:36,200 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 9 [2024-11-08 15:22:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:36,201 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-08 15:22:36,201 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-08 15:22:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-08 15:22:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 15:22:36,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:36,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:36,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:22:36,202 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-08 15:22:36,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash 231624617, now seen corresponding path program 1 times [2024-11-08 15:22:36,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:36,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008380712] [2024-11-08 15:22:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:36,646 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-08 15:22:36,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:36,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008380712] [2024-11-08 15:22:36,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008380712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:22:36,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:22:36,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:22:36,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252981024] [2024-11-08 15:22:36,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:22:36,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:22:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:36,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:22:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:22:36,653 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-08 15:22:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:36,789 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-08 15:22:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:22:36,791 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-08 15:22:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:36,792 INFO L225 Difference]: With dead ends: 21 [2024-11-08 15:22:36,792 INFO L226 Difference]: Without dead ends: 19 [2024-11-08 15:22:36,793 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-08 15:22:36,795 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-08 15:22:36,796 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-08 15:22:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-08 15:22:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-11-08 15:22:36,801 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-08 15:22:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-08 15:22:36,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2024-11-08 15:22:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:36,802 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-08 15:22:36,803 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-08 15:22:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-08 15:22:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:22:36,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:36,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:36,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:22:36,804 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-08 15:22:36,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2028041086, now seen corresponding path program 1 times [2024-11-08 15:22:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:36,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50158017] [2024-11-08 15:22:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:37,507 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-08 15:22:37,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:37,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50158017] [2024-11-08 15:22:37,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50158017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:22:37,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183599265] [2024-11-08 15:22:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:37,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:37,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:22:37,514 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:22:37,515 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:22:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:37,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-08 15:22:37,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:22:38,133 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-08 15:22:38,173 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-08 15:22:38,393 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-08 15:22:38,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:22:38,531 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-08 15:22:38,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183599265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:22:38,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:22:38,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 18 [2024-11-08 15:22:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753825840] [2024-11-08 15:22:38,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:22:38,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 15:22:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 15:22:38,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:22:38,537 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 13 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-08 15:22:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:38,736 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-08 15:22:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 15:22:38,736 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 13 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-08 15:22:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:38,737 INFO L225 Difference]: With dead ends: 30 [2024-11-08 15:22:38,737 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 15:22:38,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:22:38,739 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:22:38,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 63 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:22:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 15:22:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-11-08 15:22:38,742 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-08 15:22:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-11-08 15:22:38,745 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 16 [2024-11-08 15:22:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:38,745 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-11-08 15:22:38,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 13 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-08 15:22:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-11-08 15:22:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:22:38,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:22:38,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:22:38,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:22:38,951 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-08 15:22:38,952 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-08 15:22:38,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:22:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2028100668, now seen corresponding path program 1 times [2024-11-08 15:22:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:22:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443485551] [2024-11-08 15:22:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:22:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:39,624 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-08 15:22:39,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:22:39,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443485551] [2024-11-08 15:22:39,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443485551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:22:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969498961] [2024-11-08 15:22:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:22:39,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:22:39,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:22:39,630 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:22:39,633 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:22:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:22:40,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-08 15:22:40,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:22:40,155 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-08 15:22:40,165 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-08 15:22:40,353 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-08 15:22:40,358 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-08 15:22:40,466 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-08 15:22:40,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:22:40,931 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-08 15:22:40,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969498961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:22:40,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:22:40,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 7] total 22 [2024-11-08 15:22:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380824466] [2024-11-08 15:22:40,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:22:40,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:22:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:22:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:22:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:22:40,935 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 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-08 15:22:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:22:41,442 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2024-11-08 15:22:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 15:22:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 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-08 15:22:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:22:41,443 INFO L225 Difference]: With dead ends: 26 [2024-11-08 15:22:41,443 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:22:41,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 15:22:41,446 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:22:41,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:22:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:22:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:22:41,447 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-08 15:22:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:22:41,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-11-08 15:22:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:22:41,448 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:22:41,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 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-08 15:22:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:22:41,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:22:41,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:22:41,470 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:22:41,653 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-08 15:22:41,657 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 15:22:41,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:22:42,140 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:22:42,177 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_24_0 contained old-variable. Original clause: (let ((.cse1 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~k#1.base|)) (.cse5 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|)) (.cse0 (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse15 (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_#in~i#1.base|)) (.cse13 (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse14 (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (let ((.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~k#1.offset| 0))) (.cse8 (not (= |func_to_recursive_line_20_to_24_0_#in~j#1.offset| 0))) (.cse4 (select .cse14 0)) (.cse3 (select .cse13 0)) (.cse2 (select .cse15 0)) (.cse11 (select .cse0 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|)) (.cse10 (select .cse5 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse9 (select .cse1 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) (.cse12 (select .cse15 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|))) (and (or (not (= (select .cse0 0) 2)) (not (= (select .cse1 0) 3)) (and (= .cse2 1) (= .cse3 2) (= .cse4 3)) (not (= (select .cse5 0) 1)) .cse6 .cse7 .cse8) (or (not (= .cse9 0)) (not (= .cse10 0)) .cse6 .cse7 (not (= .cse11 0)) .cse8 (and (= .cse4 0) (= .cse3 0) (= .cse2 0))) (= (mod .cse11 4294967296) (* (mod .cse10 2147483648) 2)) (= (* (mod .cse12 2147483648) 2) (mod (select .cse13 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|) 4294967296)) (= (mod (+ (* 3 .cse10) 3) 4294967296) (mod (+ 3 .cse9) 4294967296)) (= (mod (+ 3 (* 3 .cse12)) 4294967296) (mod (+ 3 (select .cse14 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296))))) Eliminated clause: (let ((.cse13 (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse14 (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse16 (select .cse13 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse15 (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (and (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 ((.cse9 (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse12 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|)) (.cse11 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (let ((.cse1 (select .cse11 0)) (.cse5 (select .cse12 0)) (.cse0 (select .cse9 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~k#1.offset| 0))) (.cse8 (not (= |func_to_recursive_line_20_to_24_0_#in~j#1.offset| 0))) (.cse4 (select .cse15 0)) (.cse3 (select .cse14 0)) (.cse2 (select .cse13 0)) (.cse10 (select .cse12 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|))) (and (or (not (= .cse0 2)) (not (= .cse1 3)) (and (= .cse2 1) (= .cse3 2) (= .cse4 3)) (not (= .cse5 1)) .cse6 .cse7 .cse8) (= (mod (select .cse9 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|) 4294967296) (* (mod .cse10 2147483648) 2)) (or (not (= .cse1 0)) (not (= .cse5 0)) (not (= .cse0 0)) .cse6 .cse7 .cse8 (and (= .cse4 0) (= .cse3 0) (= .cse2 0))) (= (mod (+ (* 3 .cse10) 3) 4294967296) (mod (+ 3 (select .cse11 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296)))))) (= (* (mod .cse16 2147483648) 2) (mod (select .cse14 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|) 4294967296)) (= (mod (+ 3 (* 3 .cse16)) 4294967296) (mod (+ 3 (select .cse15 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296))))) [2024-11-08 15:22:42,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 15:22:42,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 15:22:42,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 15:22:42,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~i!base,]]] [2024-11-08 15:22:42,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-08 15:22:42,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-08 15:22:42,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~j!base,]]] [2024-11-08 15:22:42,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 15:22:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-08 15:22:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~i!base,]]] [2024-11-08 15:22:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-08 15:22:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-08 15:22:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~k!base,]]] [2024-11-08 15:22:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-08 15:22:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-11-08 15:22:42,198 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~j!base,]]] [2024-11-08 15:22:42,198 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 15:22:42,198 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-08 15:22:42,199 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~i!base,]]] [2024-11-08 15:22:42,201 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-08 15:22:42,201 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-08 15:22:42,201 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~i!base,]]] [2024-11-08 15:22:42,201 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-08 15:22:42,202 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-08 15:22:42,202 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~k!base,]]] [2024-11-08 15:22:42,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:22:42 BoogieIcfgContainer [2024-11-08 15:22:42,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:22:42,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:22:42,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:22:42,205 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:22:42,206 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:22:35" (3/4) ... [2024-11-08 15:22:42,210 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:22:42,214 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_24_0 [2024-11-08 15:22:42,218 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-08 15:22:42,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 15:22:42,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 15:22:42,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:22:42,304 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:22:42,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:22:42,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:22:42,305 INFO L158 Benchmark]: Toolchain (without parser) took 8053.25ms. Allocated memory was 180.4MB in the beginning and 264.2MB in the end (delta: 83.9MB). Free memory was 112.0MB in the beginning and 91.1MB in the end (delta: 21.0MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. [2024-11-08 15:22:42,306 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 104.9MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:22:42,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.14ms. Allocated memory is still 180.4MB. Free memory was 111.7MB in the beginning and 151.5MB in the end (delta: -39.7MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-08 15:22:42,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.98ms. Allocated memory is still 180.4MB. Free memory was 151.5MB in the beginning and 150.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:22:42,306 INFO L158 Benchmark]: Boogie Preprocessor took 51.51ms. Allocated memory is still 180.4MB. Free memory was 150.1MB in the beginning and 148.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:22:42,307 INFO L158 Benchmark]: RCFGBuilder took 388.07ms. Allocated memory is still 180.4MB. Free memory was 148.0MB in the beginning and 134.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 15:22:42,307 INFO L158 Benchmark]: TraceAbstraction took 7168.95ms. Allocated memory was 180.4MB in the beginning and 264.2MB in the end (delta: 83.9MB). Free memory was 134.0MB in the beginning and 95.3MB in the end (delta: 38.7MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. [2024-11-08 15:22:42,307 INFO L158 Benchmark]: Witness Printer took 99.93ms. Allocated memory is still 264.2MB. Free memory was 95.3MB in the beginning and 91.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:22:42,309 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.22ms. Allocated memory is still 104.9MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.14ms. Allocated memory is still 180.4MB. Free memory was 111.7MB in the beginning and 151.5MB in the end (delta: -39.7MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.98ms. Allocated memory is still 180.4MB. Free memory was 151.5MB in the beginning and 150.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.51ms. Allocated memory is still 180.4MB. Free memory was 150.1MB in the beginning and 148.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.07ms. Allocated memory is still 180.4MB. Free memory was 148.0MB in the beginning and 134.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7168.95ms. Allocated memory was 180.4MB in the beginning and 264.2MB in the end (delta: 83.9MB). Free memory was 134.0MB in the beginning and 95.3MB in the end (delta: 38.7MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. * Witness Printer took 99.93ms. Allocated memory is still 264.2MB. Free memory was 95.3MB in the beginning and 91.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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~j!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~i!base,]]] - 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~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~j!base,]]] - 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~i!base,]]] - 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~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~k!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.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 39 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.6s 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.7s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 SizeOfPredicates, 42 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 164 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-08 15:22:42,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE