./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.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 e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 02:12:12,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 02:12:12,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 02:12:12,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 02:12:12,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 02:12:12,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 02:12:12,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 02:12:12,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 02:12:12,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 02:12:12,201 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 02:12:12,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 02:12:12,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 02:12:12,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 02:12:12,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 02:12:12,202 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 02:12:12,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 02:12:12,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 02:12:12,203 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 02:12:12,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 02:12:12,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 02:12:12,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 02:12:12,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 02:12:12,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 02:12:12,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 02:12:12,205 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 02:12:12,205 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 02:12:12,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 02:12:12,205 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 02:12:12,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 02:12:12,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 02:12:12,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 02:12:12,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 02:12:12,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:12:12,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 02:12:12,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 02:12:12,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 02:12:12,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 02:12:12,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 02:12:12,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 02:12:12,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 02:12:12,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 02:12:12,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 02:12:12,210 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 -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 [2024-11-22 02:12:12,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 02:12:12,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 02:12:12,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 02:12:12,473 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 02:12:12,474 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 02:12:12,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-11-22 02:12:13,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 02:12:13,849 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 02:12:13,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-11-22 02:12:13,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b7ee2c13/fac6fe34a6414cdbb915c64beddb7a01/FLAGd89dac17c [2024-11-22 02:12:14,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b7ee2c13/fac6fe34a6414cdbb915c64beddb7a01 [2024-11-22 02:12:14,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 02:12:14,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 02:12:14,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 02:12:14,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 02:12:14,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 02:12:14,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7bb9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14, skipping insertion in model container [2024-11-22 02:12:14,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 02:12:14,455 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/recursive-with-pointer/simple-recursive.c[439,452] [2024-11-22 02:12:14,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:12:14,466 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 02:12:14,475 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/recursive-with-pointer/simple-recursive.c[439,452] [2024-11-22 02:12:14,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:12:14,490 INFO L204 MainTranslator]: Completed translation [2024-11-22 02:12:14,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14 WrapperNode [2024-11-22 02:12:14,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 02:12:14,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 02:12:14,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 02:12:14,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 02:12:14,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,523 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2024-11-22 02:12:14,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 02:12:14,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 02:12:14,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 02:12:14,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 02:12:14,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,541 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2024-11-22 02:12:14,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 02:12:14,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 02:12:14,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 02:12:14,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 02:12:14,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (1/1) ... [2024-11-22 02:12:14,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:12:14,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:12:14,583 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-22 02:12:14,584 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-22 02:12:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 02:12:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2024-11-22 02:12:14,622 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2024-11-22 02:12:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 02:12:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 02:12:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 02:12:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2024-11-22 02:12:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2024-11-22 02:12:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 02:12:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 02:12:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 02:12:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 02:12:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 02:12:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 02:12:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 02:12:14,694 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 02:12:14,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 02:12:14,841 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-22 02:12:14,841 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 02:12:14,849 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 02:12:14,849 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 02:12:14,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:12:14 BoogieIcfgContainer [2024-11-22 02:12:14,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 02:12:14,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 02:12:14,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 02:12:14,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 02:12:14,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:12:14" (1/3) ... [2024-11-22 02:12:14,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7c83a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:12:14, skipping insertion in model container [2024-11-22 02:12:14,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:14" (2/3) ... [2024-11-22 02:12:14,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7c83a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:12:14, skipping insertion in model container [2024-11-22 02:12:14,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:12:14" (3/3) ... [2024-11-22 02:12:14,857 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2024-11-22 02:12:14,869 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 02:12:14,870 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 02:12:14,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 02:12:14,919 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;@44c9fb4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 02:12:14,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 02:12:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 02:12:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 02:12:14,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:14,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:14,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:14,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash -694887038, now seen corresponding path program 1 times [2024-11-22 02:12:14,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317261269] [2024-11-22 02:12:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:15,246 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-22 02:12:15,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317261269] [2024-11-22 02:12:15,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317261269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:12:15,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:12:15,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:12:15,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449401619] [2024-11-22 02:12:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:12:15,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:12:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:15,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:12:15,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:12:15,280 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-22 02:12:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:15,339 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-22 02:12:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:12:15,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2024-11-22 02:12:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:15,346 INFO L225 Difference]: With dead ends: 33 [2024-11-22 02:12:15,346 INFO L226 Difference]: Without dead ends: 14 [2024-11-22 02:12:15,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 02:12:15,351 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:15,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:12:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-22 02:12:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-22 02:12:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:12:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-22 02:12:15,376 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2024-11-22 02:12:15,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:15,376 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-22 02:12:15,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-22 02:12:15,376 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-22 02:12:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 02:12:15,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:15,377 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:15,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 02:12:15,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:15,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:15,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2070363059, now seen corresponding path program 1 times [2024-11-22 02:12:15,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:15,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180754485] [2024-11-22 02:12:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:12:15,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180754485] [2024-11-22 02:12:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180754485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:12:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643037162] [2024-11-22 02:12:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:15,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:12:15,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:12:15,628 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-22 02:12:15,634 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-22 02:12:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:15,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 02:12:15,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:12:15,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 02:12:15,800 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 36 treesize of output 13 [2024-11-22 02:12:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:12:15,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:12:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:12:16,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643037162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:12:16,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:12:16,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2024-11-22 02:12:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763648407] [2024-11-22 02:12:16,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:12:16,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 02:12:16,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:16,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 02:12:16,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-22 02:12:16,057 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 12 states have internal predecessors, (18), 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-22 02:12:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:16,257 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-22 02:12:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 02:12:16,258 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 12 states have internal predecessors, (18), 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 12 [2024-11-22 02:12:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:16,259 INFO L225 Difference]: With dead ends: 28 [2024-11-22 02:12:16,259 INFO L226 Difference]: Without dead ends: 24 [2024-11-22 02:12:16,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-22 02:12:16,262 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:16,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:12:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-22 02:12:16,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-22 02:12:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:12:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-22 02:12:16,271 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2024-11-22 02:12:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:16,271 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-22 02:12:16,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 12 states have internal predecessors, (18), 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-22 02:12:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-22 02:12:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 02:12:16,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:16,273 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:16,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 02:12:16,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:12:16,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:16,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash -978155155, now seen corresponding path program 2 times [2024-11-22 02:12:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:16,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717607522] [2024-11-22 02:12:16,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 02:12:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:16,510 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 02:12:16,510 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:12:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:12:17,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717607522] [2024-11-22 02:12:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717607522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:12:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235597695] [2024-11-22 02:12:17,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 02:12:17,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:12:17,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:12:17,018 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-22 02:12:17,022 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-22 02:12:17,064 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 02:12:17,065 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:12:17,067 WARN L253 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-22 02:12:17,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:12:17,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 02:12:17,185 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 36 treesize of output 13 [2024-11-22 02:12:17,277 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 36 treesize of output 13 [2024-11-22 02:12:17,377 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 36 treesize of output 13 [2024-11-22 02:12:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:12:17,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:12:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:12:17,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235597695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:12:17,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:12:17,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 48 [2024-11-22 02:12:17,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635182757] [2024-11-22 02:12:17,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:12:17,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-22 02:12:17,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:17,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-22 02:12:17,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1995, Unknown=0, NotChecked=0, Total=2256 [2024-11-22 02:12:17,780 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 48 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 27 states have internal predecessors, (40), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:12:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:18,244 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-22 02:12:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-22 02:12:18,244 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 27 states have internal predecessors, (40), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 02:12:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:18,245 INFO L225 Difference]: With dead ends: 48 [2024-11-22 02:12:18,245 INFO L226 Difference]: Without dead ends: 44 [2024-11-22 02:12:18,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=564, Invalid=3858, Unknown=0, NotChecked=0, Total=4422 [2024-11-22 02:12:18,247 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:18,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 69 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:12:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-22 02:12:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-22 02:12:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:12:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2024-11-22 02:12:18,253 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 22 [2024-11-22 02:12:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:18,254 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2024-11-22 02:12:18,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 27 states have internal predecessors, (40), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:12:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2024-11-22 02:12:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 02:12:18,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:18,255 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:18,262 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-22 02:12:18,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 02:12:18,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:18,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash -665560147, now seen corresponding path program 3 times [2024-11-22 02:12:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:18,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109724536] [2024-11-22 02:12:18,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 02:12:18,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:18,481 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 02:12:18,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:12:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-22 02:12:18,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:18,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109724536] [2024-11-22 02:12:18,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109724536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:12:18,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970826209] [2024-11-22 02:12:18,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 02:12:18,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:12:18,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:12:18,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 02:12:18,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 02:12:18,668 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 02:12:18,668 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:12:18,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-22 02:12:18,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:12:18,703 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 36 treesize of output 13 [2024-11-22 02:12:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-22 02:12:18,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:12:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-22 02:12:18,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970826209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:12:18,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:12:18,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-22 02:12:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755340271] [2024-11-22 02:12:18,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:12:18,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 02:12:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 02:12:18,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-22 02:12:18,803 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:12:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:18,859 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2024-11-22 02:12:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 02:12:18,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-22 02:12:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:18,860 INFO L225 Difference]: With dead ends: 43 [2024-11-22 02:12:18,860 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 02:12:18,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-22 02:12:18,861 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:18,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 27 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:12:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 02:12:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 02:12:18,862 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-22 02:12:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 02:12:18,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-11-22 02:12:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:18,862 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 02:12:18,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:12:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 02:12:18,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 02:12:18,864 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 02:12:18,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 02:12:19,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:12:19,068 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-22 02:12:19,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 02:12:19,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 02:12:19,529 WARN L156 FloydHoareUtils]: Requires clause for foo contained old-variable. Original clause: (let ((.cse5 (select |#memory_int#1| |foo_#in~p.base|)) (.cse6 (select |old(#memory_int#1)| |foo_#in~p.base|))) (let ((.cse1 (select .cse6 |foo_#in~p.offset|)) (.cse0 (select .cse5 |foo_#in~p.offset|)) (.cse4 (select .cse6 0)) (.cse2 (not (= |foo_#in~p.offset| 0))) (.cse3 (select .cse5 0))) (and (or (<= .cse0 18) (<= 19 .cse1)) (or .cse2 (<= .cse3 12) (< 12 .cse4)) (or (<= 20 .cse1) (<= .cse0 19)) (or (<= .cse3 10) .cse2 (< 10 .cse4)) (or .cse2 (<= .cse3 11) (< 11 .cse4)) (or (= .cse1 20) (< .cse1 20)) (<= .cse0 20) (or (< 13 .cse4) .cse2 (<= .cse3 13))))) Eliminated clause: (let ((.cse6 (select |#memory_int#1| |foo_#in~p.base|))) (let ((.cse4 (select .cse6 |foo_#in~p.offset|))) (and (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse5 (select |old(#memory_int#1)| |foo_#in~p.base|))) (let ((.cse3 (select .cse5 |foo_#in~p.offset|)) (.cse2 (not (= |foo_#in~p.offset| 0))) (.cse1 (select .cse6 0)) (.cse0 (select .cse5 0))) (and (or (< 13 .cse0) (< .cse1 14) .cse2) (or .cse2 (< .cse1 12) (< 11 .cse0)) (or (= .cse3 20) (< .cse3 20)) (or (< .cse4 20) (< 19 .cse3)) (or (< 18 .cse3) (< .cse4 19)) (or .cse2 (< 10 .cse0) (< .cse1 11)) (or .cse2 (< .cse1 13) (< 12 .cse0)))))) (<= .cse4 20)))) [2024-11-22 02:12:19,538 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 02:12:19,539 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-22 02:12:19,539 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-22 02:12:19,539 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-11-22 02:12:19,540 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-22 02:12:19,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-22 02:12:19,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-11-22 02:12:19,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-22 02:12:19,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-22 02:12:19,541 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-11-22 02:12:19,547 WARN L156 FloydHoareUtils]: Requires clause for plus contained old-variable. Original clause: (let ((.cse5 (select |old(#memory_int#1)| |plus_#in~p.base|)) (.cse6 (select |#memory_int#1| |plus_#in~p.base|))) (let ((.cse1 (not (= |plus_#in~p.offset| 0))) (.cse0 (select .cse6 0)) (.cse3 (select .cse5 0)) (.cse4 (select .cse6 |plus_#in~p.offset|)) (.cse2 (select .cse5 |plus_#in~p.offset|))) (and (or (<= .cse0 10) .cse1 (< 10 .cse2)) (or .cse1 (< 12 .cse3) (<= .cse0 12)) (<= .cse2 19) (or (<= 18 .cse2) (<= .cse4 17)) (or .cse1 (<= .cse0 11) (< 11 .cse3)) (<= .cse4 19) (or (<= .cse4 18) (<= 19 .cse2))))) Eliminated clause: (let ((.cse6 (select |#memory_int#1| |plus_#in~p.base|))) (let ((.cse3 (select .cse6 |plus_#in~p.offset|))) (and (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse5 (select |old(#memory_int#1)| |plus_#in~p.base|))) (let ((.cse4 (select .cse5 |plus_#in~p.offset|)) (.cse2 (select .cse6 0)) (.cse1 (not (= |plus_#in~p.offset| 0))) (.cse0 (select .cse5 0))) (and (or (< 10 .cse0) .cse1 (< .cse2 11)) (or (< .cse2 13) .cse1 (< 12 .cse0)) (or (< .cse3 19) (= 19 .cse4)) (<= .cse4 19) (or (< .cse3 18) (< 17 .cse4)) (or (< .cse2 12) .cse1 (< 11 .cse0)))))) (<= .cse3 19)))) [2024-11-22 02:12:19,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 02:12:19,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-22 02:12:19,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-22 02:12:19,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-11-22 02:12:19,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-22 02:12:19,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-22 02:12:19,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-11-22 02:12:19,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:12:19 BoogieIcfgContainer [2024-11-22 02:12:19,550 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 02:12:19,550 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 02:12:19,550 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 02:12:19,552 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 02:12:19,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:12:14" (3/4) ... [2024-11-22 02:12:19,554 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 02:12:19,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2024-11-22 02:12:19,560 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure plus [2024-11-22 02:12:19,562 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-22 02:12:19,562 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 02:12:19,563 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 02:12:19,563 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 02:12:19,626 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 02:12:19,626 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 02:12:19,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 02:12:19,626 INFO L158 Benchmark]: Toolchain (without parser) took 5356.76ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 105.7MB in the beginning and 148.5MB in the end (delta: -42.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:12:19,627 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 188.7MB. Free memory was 152.9MB in the beginning and 152.6MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:12:19,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.15ms. Allocated memory is still 188.7MB. Free memory was 105.6MB in the beginning and 150.8MB in the end (delta: -45.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-11-22 02:12:19,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.02ms. Allocated memory is still 188.7MB. Free memory was 150.7MB in the beginning and 159.1MB in the end (delta: -8.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 02:12:19,627 INFO L158 Benchmark]: Boogie Preprocessor took 30.70ms. Allocated memory is still 188.7MB. Free memory was 159.1MB in the beginning and 157.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 02:12:19,627 INFO L158 Benchmark]: RCFGBuilder took 295.17ms. Allocated memory is still 188.7MB. Free memory was 157.0MB in the beginning and 153.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 02:12:19,628 INFO L158 Benchmark]: TraceAbstraction took 4698.11ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 153.8MB in the beginning and 152.7MB in the end (delta: 1.2MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. [2024-11-22 02:12:19,628 INFO L158 Benchmark]: Witness Printer took 75.97ms. Allocated memory is still 226.5MB. Free memory was 152.7MB in the beginning and 148.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 02:12:19,629 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 188.7MB. Free memory was 152.9MB in the beginning and 152.6MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.15ms. Allocated memory is still 188.7MB. Free memory was 105.6MB in the beginning and 150.8MB in the end (delta: -45.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.02ms. Allocated memory is still 188.7MB. Free memory was 150.7MB in the beginning and 159.1MB in the end (delta: -8.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.70ms. Allocated memory is still 188.7MB. Free memory was 159.1MB in the beginning and 157.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 295.17ms. Allocated memory is still 188.7MB. Free memory was 157.0MB in the beginning and 153.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4698.11ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 153.8MB in the beginning and 152.7MB in the end (delta: 1.2MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. * Witness Printer took 75.97ms. Allocated memory is still 226.5MB. Free memory was 152.7MB in the beginning and 148.5MB 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~p!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~p!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~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!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~p!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: 18]: 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 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 39 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=3, InterpolantAutomatonStates: 67, 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, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 159 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 969 SizeOfPredicates, 39 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 354/426 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-22 02:12:19,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE