./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-mul-div-a046e57-m [2024-10-12 19:48:14,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:48:14,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:48:14,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:48:14,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:48:14,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:48:14,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:48:14,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:48:14,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:48:14,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:48:14,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:48:14,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:48:14,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:48:14,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:48:14,979 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:48:14,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:48:14,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:48:14,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:48:14,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:48:14,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:48:14,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:48:14,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:48:14,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:48:14,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:48:14,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:48:14,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:48:14,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:48:14,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:48:14,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:48:14,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:48:14,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:48:14,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:48:14,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:48:14,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:48:14,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:48:14,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:48:14,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:48:14,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:48:14,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:48:14,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:48:14,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:48:14,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:48:14,993 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-10-12 19:48:15,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:48:15,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:48:15,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:48:15,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:48:15,269 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:48:15,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c [2024-10-12 19:48:16,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:48:16,870 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:48:16,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c [2024-10-12 19:48:16,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4e794ab/d773f805650c46788b204f9fcbadd552/FLAG5e9b907d4 [2024-10-12 19:48:17,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4e794ab/d773f805650c46788b204f9fcbadd552 [2024-10-12 19:48:17,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:48:17,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:48:17,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:48:17,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:48:17,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:48:17,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462068f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17, skipping insertion in model container [2024-10-12 19:48:17,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:48:17,436 WARN L248 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-10-12 19:48:17,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:48:17,459 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:48:17,470 WARN L248 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-10-12 19:48:17,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:48:17,496 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:48:17,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17 WrapperNode [2024-10-12 19:48:17,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:48:17,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:48:17,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:48:17,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:48:17,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,530 INFO L138 Inliner]: procedures = 14, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-10-12 19:48:17,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:48:17,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:48:17,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:48:17,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:48:17,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,555 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-10-12 19:48:17,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:48:17,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:48:17,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:48:17,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:48:17,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (1/1) ... [2024-10-12 19:48:17,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:48:17,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:48:17,608 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-10-12 19:48:17,614 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-10-12 19:48:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:48:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:48:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:48:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:48:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:48:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 19:48:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 19:48:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 19:48:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 19:48:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 19:48:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:48:17,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:48:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 19:48:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 19:48:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 19:48:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 19:48:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_24_0 [2024-10-12 19:48:17,662 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_24_0 [2024-10-12 19:48:17,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 19:48:17,774 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:48:17,776 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:48:17,913 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-12 19:48:17,914 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:48:17,946 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:48:17,946 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 19:48:17,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:48:17 BoogieIcfgContainer [2024-10-12 19:48:17,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:48:17,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:48:17,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:48:17,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:48:17,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:48:17" (1/3) ... [2024-10-12 19:48:17,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dcd15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:48:17, skipping insertion in model container [2024-10-12 19:48:17,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:17" (2/3) ... [2024-10-12 19:48:17,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dcd15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:48:17, skipping insertion in model container [2024-10-12 19:48:17,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:48:17" (3/3) ... [2024-10-12 19:48:17,956 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_2.c [2024-10-12 19:48:17,974 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:48:17,974 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:48:18,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:48:18,060 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;@2cde2599, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:48:18,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:48:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 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-10-12 19:48:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-12 19:48:18,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:18,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:18,075 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-10-12 19:48:18,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1319783804, now seen corresponding path program 1 times [2024-10-12 19:48:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:18,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658451091] [2024-10-12 19:48:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:48:19,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:19,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658451091] [2024-10-12 19:48:19,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658451091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:48:19,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:48:19,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:48:19,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181002480] [2024-10-12 19:48:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:48:19,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:48:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:48:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:48:19,066 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 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.4) internal successors, (7), 4 states have internal predecessors, (7), 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-10-12 19:48:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:19,178 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-10-12 19:48:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:48:19,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2024-10-12 19:48:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:19,187 INFO L225 Difference]: With dead ends: 34 [2024-10-12 19:48:19,188 INFO L226 Difference]: Without dead ends: 14 [2024-10-12 19:48:19,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-12 19:48:19,196 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:19,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:48:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-12 19:48:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-12 19:48:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-10-12 19:48:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-12 19:48:19,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 8 [2024-10-12 19:48:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:19,230 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-12 19:48:19,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-10-12 19:48:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-12 19:48:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-12 19:48:19,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:19,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:19,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:48:19,232 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-10-12 19:48:19,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:19,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1319843386, now seen corresponding path program 1 times [2024-10-12 19:48:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:19,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751240679] [2024-10-12 19:48:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:19,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:48:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751240679] [2024-10-12 19:48:19,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751240679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:48:19,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:48:19,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:48:19,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098788691] [2024-10-12 19:48:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:48:19,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:48:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:19,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:48:19,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:48:19,744 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 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-10-12 19:48:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:19,853 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-10-12 19:48:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:48:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 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 8 [2024-10-12 19:48:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:19,856 INFO L225 Difference]: With dead ends: 20 [2024-10-12 19:48:19,856 INFO L226 Difference]: Without dead ends: 18 [2024-10-12 19:48:19,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-10-12 19:48:19,857 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:19,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 32 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:48:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-12 19:48:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-10-12 19:48:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-10-12 19:48:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-10-12 19:48:19,865 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2024-10-12 19:48:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-10-12 19:48:19,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 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-10-12 19:48:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-10-12 19:48:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 19:48:19,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:19,867 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:19,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:48:19,867 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-10-12 19:48:19,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash 347924421, now seen corresponding path program 1 times [2024-10-12 19:48:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637187637] [2024-10-12 19:48:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:19,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:48:20,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:20,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637187637] [2024-10-12 19:48:20,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637187637] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:48:20,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582883791] [2024-10-12 19:48:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:20,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:48:20,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:48:20,519 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-10-12 19:48:20,520 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-10-12 19:48:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:20,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-12 19:48:20,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:48:20,941 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-10-12 19:48:20,958 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-10-12 19:48:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:48:21,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:48:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:48:21,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582883791] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:48:21,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:48:21,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 17 [2024-10-12 19:48:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869517134] [2024-10-12 19:48:21,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:48:21,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 19:48:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:21,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 19:48:21,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:48:21,274 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 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-10-12 19:48:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:21,451 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-10-12 19:48:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:48:21,452 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 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 15 [2024-10-12 19:48:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:21,452 INFO L225 Difference]: With dead ends: 29 [2024-10-12 19:48:21,453 INFO L226 Difference]: Without dead ends: 20 [2024-10-12 19:48:21,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:48:21,454 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:21,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:48:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-12 19:48:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2024-10-12 19:48:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-12 19:48:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-10-12 19:48:21,459 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2024-10-12 19:48:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:21,460 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-10-12 19:48:21,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 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-10-12 19:48:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-10-12 19:48:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 19:48:21,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:21,461 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:21,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:48:21,661 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-10-12 19:48:21,662 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-10-12 19:48:21,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash 347864839, now seen corresponding path program 1 times [2024-10-12 19:48:21,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:21,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165354384] [2024-10-12 19:48:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:48:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:22,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165354384] [2024-10-12 19:48:22,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165354384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:48:22,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132021509] [2024-10-12 19:48:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:22,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:48:22,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:48:22,280 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-10-12 19:48:22,282 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-10-12 19:48:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:22,668 WARN L253 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-10-12 19:48:22,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:48:22,836 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-10-12 19:48:22,847 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-10-12 19:48:22,854 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-10-12 19:48:23,132 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-10-12 19:48:23,146 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-10-12 19:48:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:48:23,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:48:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:48:39,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132021509] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:48:39,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:48:39,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 23 [2024-10-12 19:48:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883973849] [2024-10-12 19:48:39,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:48:39,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 19:48:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:39,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 19:48:39,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=412, Unknown=4, NotChecked=0, Total=506 [2024-10-12 19:48:39,512 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 23 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 18 states have internal predecessors, (35), 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-10-12 19:48:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:39,735 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-10-12 19:48:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:48:39,735 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 18 states have internal predecessors, (35), 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 15 [2024-10-12 19:48:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:39,735 INFO L225 Difference]: With dead ends: 22 [2024-10-12 19:48:39,736 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:48:39,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=145, Invalid=607, Unknown=4, NotChecked=0, Total=756 [2024-10-12 19:48:39,737 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:39,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 13 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:48:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:48:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:48:39,740 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-10-12 19:48:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:48:39,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-10-12 19:48:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:39,741 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:48:39,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 18 states have internal predecessors, (35), 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-10-12 19:48:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:48:39,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:48:39,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:48:39,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:48:39,945 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-10-12 19:48:39,949 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-12 19:48:39,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:48:40,374 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:48:40,403 WARN L155 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_24_0 contained old-variable. Original clause: (let ((.cse13 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|)) (.cse1 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse14 (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~k#1.base|)) (.cse4 (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~k#1.base|)) (.cse3 (select |#memory_int#2| |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|))) (let ((.cse2 (select .cse15 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse7 (select .cse15 0)) (.cse5 (select .cse3 0)) (.cse6 (select .cse4 0)) (.cse8 (not (= |func_to_recursive_line_20_to_24_0_#in~i#1.offset| 0))) (.cse9 (not (= |func_to_recursive_line_20_to_24_0_#in~k#1.offset| 0))) (.cse11 (select .cse14 0)) (.cse10 (not (= |func_to_recursive_line_20_to_24_0_#in~j#1.offset| 0))) (.cse12 (select .cse1 0)) (.cse0 (select .cse13 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|))) (and (<= (mod (+ (* 4294967294 .cse0) (select .cse1 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|)) 4294967296) 0) (<= (mod (+ (* 4294967294 .cse2) (select .cse3 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|)) 4294967296) 0) (= (mod (+ 3 (select .cse4 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296) (mod (+ 3 (* 3 .cse2)) 4294967296)) (or (and (= .cse5 0) (= .cse6 0) (= .cse7 0)) (not (= .cse0 0)) .cse8 .cse9 .cse10 (not (= .cse11 0)) (not (= .cse12 0))) (or (and (= .cse7 1) (= .cse5 2) (= 3 .cse6)) (not (= (select .cse13 0) 1)) .cse8 .cse9 (not (= 3 .cse11)) .cse10 (not (= 2 .cse12))) (= (mod (+ (* 3 .cse0) 3) 4294967296) (mod (+ 3 (select .cse14 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296))))) Eliminated clause: (let ((.cse12 (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse14 (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse13 (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~k#1.base|)) (.cse16 (select .cse12 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|))) (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 ((.cse1 (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~k#1.base|)) (.cse15 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse0 (select .cse15 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse5 (select .cse15 0)) (.cse3 (select .cse14 0)) (.cse4 (select .cse13 0)) (.cse2 (select .cse12 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))) (.cse9 (not (= |func_to_recursive_line_20_to_24_0_#in~j#1.offset| 0))) (.cse8 (select .cse11 0)) (.cse10 (select .cse1 0))) (and (<= (mod (+ (* 4294967294 .cse0) (select .cse1 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|)) 4294967296) 0) (or (and (= .cse2 1) (= .cse3 2) (= 3 .cse4)) (not (= .cse5 1)) .cse6 .cse7 (not (= 3 .cse8)) .cse9 (not (= 2 .cse10))) (= (mod (+ (* 3 .cse0) 3) 4294967296) (mod (+ 3 (select .cse11 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296)) (or (not (= .cse5 0)) (and (= .cse3 0) (= .cse4 0) (= .cse2 0)) .cse6 .cse7 .cse9 (not (= .cse8 0)) (not (= .cse10 0))))))) (<= (mod (+ (* 4294967294 .cse16) (select .cse14 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|)) 4294967296) 0) (= (mod (+ 3 (select .cse13 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296) (mod (+ 3 (* 3 .cse16)) 4294967296))))) [2024-10-12 19:48:40,410 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:48:40,413 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 19:48:40,415 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 19:48:40,416 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~i!base,]]] [2024-10-12 19:48:40,416 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 19:48:40,416 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 19:48:40,416 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~j!base,]]] [2024-10-12 19:48:40,417 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-12 19:48:40,417 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-12 19:48:40,417 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~k!base,]]] [2024-10-12 19:48:40,417 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 19:48:40,417 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 19:48:40,417 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~i!base,]]] [2024-10-12 19:48:40,420 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 19:48:40,420 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-10-12 19:48:40,420 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~i!base,]]] [2024-10-12 19:48:40,420 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 19:48:40,422 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-10-12 19:48:40,422 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~j!base,]]] [2024-10-12 19:48:40,422 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 19:48:40,423 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-10-12 19:48:40,423 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~i!base,]]] [2024-10-12 19:48:40,423 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-12 19:48:40,423 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-10-12 19:48:40,423 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~k!base,]]] [2024-10-12 19:48:40,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:48:40 BoogieIcfgContainer [2024-10-12 19:48:40,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:48:40,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:48:40,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:48:40,424 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:48:40,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:48:17" (3/4) ... [2024-10-12 19:48:40,428 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:48:40,431 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_24_0 [2024-10-12 19:48:40,436 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-12 19:48:40,436 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-12 19:48:40,436 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 19:48:40,437 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:48:40,520 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:48:40,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:48:40,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:48:40,524 INFO L158 Benchmark]: Toolchain (without parser) took 23271.49ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 120.1MB in the beginning and 114.4MB in the end (delta: 5.7MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2024-10-12 19:48:40,524 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:48:40,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.16ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 107.9MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 19:48:40,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.06ms. Allocated memory is still 176.2MB. Free memory was 107.9MB in the beginning and 106.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:48:40,525 INFO L158 Benchmark]: Boogie Preprocessor took 33.78ms. Allocated memory is still 176.2MB. Free memory was 106.3MB in the beginning and 104.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:48:40,525 INFO L158 Benchmark]: RCFGBuilder took 381.44ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 90.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 19:48:40,525 INFO L158 Benchmark]: TraceAbstraction took 22474.18ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 90.0MB in the beginning and 119.6MB in the end (delta: -29.7MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2024-10-12 19:48:40,526 INFO L158 Benchmark]: Witness Printer took 99.31ms. Allocated memory is still 255.9MB. Free memory was 119.6MB in the beginning and 114.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 19:48:40,527 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.17ms. Allocated memory is still 176.2MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.16ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 107.9MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.06ms. Allocated memory is still 176.2MB. Free memory was 107.9MB in the beginning and 106.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.78ms. Allocated memory is still 176.2MB. Free memory was 106.3MB in the beginning and 104.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 381.44ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 90.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22474.18ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 90.0MB in the beginning and 119.6MB in the end (delta: -29.7MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * Witness Printer took 99.31ms. Allocated memory is still 255.9MB. Free memory was 119.6MB in the beginning and 114.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. 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#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~k!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#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~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#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~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, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 237 IncrementalHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 27 mSDtfsCounter, 237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=2, InterpolantAutomatonStates: 43, 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, 19.8s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 1597 SizeOfPredicates, 47 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 12/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-10-12 19:48:40,554 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