./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i15_o15-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 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:20:45,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:20:45,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:20:45,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:20:45,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:20:45,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:20:45,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:20:45,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:20:45,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:20:45,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:20:45,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:20:45,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:20:45,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:20:45,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:20:45,941 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:20:45,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:20:45,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:20:45,942 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:20:45,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:20:45,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:20:45,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:20:45,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:20:45,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:20:45,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:20:45,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:20:45,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:20:45,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:20:45,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:20:45,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:20:45,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:20:45,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:20:45,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:20:45,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:45,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:20:45,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:20:45,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:20:45,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:20:45,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:20:45,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:20:45,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:20:45,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:20:45,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:20:45,949 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 -> 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 [2024-11-08 15:20:46,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:20:46,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:20:46,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:20:46,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:20:46,143 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:20:46,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2024-11-08 15:20:47,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:20:47,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:20:47,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2024-11-08 15:20:47,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1d9f6b9/c847b0f5399247059c122b41ebbc9ac0/FLAG6caa7271c [2024-11-08 15:20:47,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1d9f6b9/c847b0f5399247059c122b41ebbc9ac0 [2024-11-08 15:20:47,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:20:47,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:20:47,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:47,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:20:47,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:20:47,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:47" (1/1) ... [2024-11-08 15:20:47,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e82639c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:47, skipping insertion in model container [2024-11-08 15:20:47,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:47" (1/1) ... [2024-11-08 15:20:47,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:20:47,988 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-simple/id_i15_o15-2.c[454,467] [2024-11-08 15:20:47,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:47,997 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:20:48,006 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-simple/id_i15_o15-2.c[454,467] [2024-11-08 15:20:48,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:48,018 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:20:48,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48 WrapperNode [2024-11-08 15:20:48,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:48,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:48,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:20:48,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:20:48,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,039 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2024-11-08 15:20:48,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:48,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:20:48,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:20:48,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:20:48,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,053 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:20:48,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:20:48,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:20:48,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:20:48,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:20:48,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (1/1) ... [2024-11-08 15:20:48,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:48,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:48,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:20:48,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:20:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:20:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:20:48,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:20:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:20:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-08 15:20:48,155 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-08 15:20:48,202 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:20:48,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:20:48,286 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-08 15:20:48,286 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:20:48,301 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:20:48,302 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:20:48,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:48 BoogieIcfgContainer [2024-11-08 15:20:48,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:20:48,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:20:48,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:20:48,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:20:48,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:20:47" (1/3) ... [2024-11-08 15:20:48,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676c7406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:48, skipping insertion in model container [2024-11-08 15:20:48,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:48" (2/3) ... [2024-11-08 15:20:48,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676c7406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:48, skipping insertion in model container [2024-11-08 15:20:48,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:48" (3/3) ... [2024-11-08 15:20:48,310 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2024-11-08 15:20:48,323 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:20:48,323 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:20:48,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:20:48,377 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;@42fb671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:20:48,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:20:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) 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-11-08 15:20:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 15:20:48,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:48,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:48,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:48,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-08 15:20:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971585939] [2024-11-08 15:20:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:48,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:20:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971585939] [2024-11-08 15:20:48,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971585939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:48,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:20:48,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:20:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86464392] [2024-11-08 15:20:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:48,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:20:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:48,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:20:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:20:48,599 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) 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 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:20:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:48,644 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-08 15:20:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:20:48,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-08 15:20:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:48,652 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:20:48,652 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 15:20:48,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:20:48,657 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:48,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:48,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 15:20:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 15:20:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:20:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-08 15:20:48,685 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-08 15:20:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:48,686 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-08 15:20:48,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:20:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-08 15:20:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:20:48,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:48,688 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:20:48,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:48,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:48,689 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-08 15:20:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:48,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033966504] [2024-11-08 15:20:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:48,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:20:48,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033966504] [2024-11-08 15:20:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033966504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:48,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615140923] [2024-11-08 15:20:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:48,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:48,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:48,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:48,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:20:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:49,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:20:49,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:20:49,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:20:49,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615140923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:49,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:49,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-11-08 15:20:49,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889815054] [2024-11-08 15:20:49,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:49,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:20:49,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:49,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:20:49,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:20:49,318 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 13 states, 10 states have (on average 2.2) internal successors, (22), 13 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 15:20:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:49,366 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-08 15:20:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:20:49,367 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 13 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 16 [2024-11-08 15:20:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:49,368 INFO L225 Difference]: With dead ends: 22 [2024-11-08 15:20:49,368 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 15:20:49,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:20:49,369 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:49,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 15:20:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 15:20:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:20:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-08 15:20:49,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-08 15:20:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:49,376 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-08 15:20:49,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 13 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 15:20:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-08 15:20:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:20:49,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:49,378 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:49,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:20:49,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:49,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:49,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2024-11-08 15:20:49,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:49,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63595974] [2024-11-08 15:20:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:49,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:49,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 15:20:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:49,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63595974] [2024-11-08 15:20:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63595974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779651132] [2024-11-08 15:20:49,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:20:49,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:49,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:49,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:49,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:20:49,766 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:20:49,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:49,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:20:49,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:20:49,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:20:50,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779651132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:50,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:50,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 15 [2024-11-08 15:20:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831810873] [2024-11-08 15:20:50,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:50,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:20:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:20:50,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:20:50,092 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 15 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 15:20:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:50,142 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-08 15:20:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:20:50,143 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 15 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2024-11-08 15:20:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:50,144 INFO L225 Difference]: With dead ends: 25 [2024-11-08 15:20:50,144 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 15:20:50,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:20:50,145 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:50,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 57 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 15:20:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 15:20:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:20:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-08 15:20:50,149 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2024-11-08 15:20:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:50,149 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-08 15:20:50,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 15 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 15:20:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-08 15:20:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 15:20:50,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:50,150 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:50,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:20:50,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 15:20:50,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:50,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:50,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2024-11-08 15:20:50,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:50,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007643193] [2024-11-08 15:20:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:50,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:50,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:20:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:50,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007643193] [2024-11-08 15:20:50,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007643193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:50,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476305100] [2024-11-08 15:20:50,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:20:50,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:50,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:50,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:50,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:20:50,587 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 15:20:50,587 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:50,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:20:50,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:20:50,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:20:51,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476305100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:51,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:51,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-11-08 15:20:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347892249] [2024-11-08 15:20:51,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:51,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 15:20:51,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:51,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 15:20:51,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-08 15:20:51,005 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 15:20:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:51,240 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-08 15:20:51,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 15:20:51,240 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2024-11-08 15:20:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:51,241 INFO L225 Difference]: With dead ends: 39 [2024-11-08 15:20:51,241 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 15:20:51,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 15:20:51,243 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:51,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 101 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 15:20:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 15:20:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 15:20:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-08 15:20:51,248 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2024-11-08 15:20:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:51,248 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-08 15:20:51,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 15:20:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-08 15:20:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:20:51,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:51,250 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:51,262 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-08 15:20:51,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:51,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2024-11-08 15:20:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:51,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995647876] [2024-11-08 15:20:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 15:20:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995647876] [2024-11-08 15:20:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995647876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304474715] [2024-11-08 15:20:51,870 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:20:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:51,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:51,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:20:51,917 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:20:51,918 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:51,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:20:51,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 15:20:52,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 15:20:53,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304474715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:53,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:53,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 19] total 25 [2024-11-08 15:20:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160891344] [2024-11-08 15:20:53,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:53,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 15:20:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:53,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 15:20:53,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-11-08 15:20:53,782 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 25 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-08 15:20:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:53,868 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-08 15:20:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:20:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 25 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) Word has length 52 [2024-11-08 15:20:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:53,869 INFO L225 Difference]: With dead ends: 40 [2024-11-08 15:20:53,870 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 15:20:53,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=297, Invalid=695, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:20:53,871 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:53,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 90 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:53,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 15:20:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 15:20:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 15:20:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-08 15:20:53,875 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2024-11-08 15:20:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:53,876 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-08 15:20:53,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.090909090909091) internal successors, (46), 25 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-08 15:20:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-08 15:20:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 15:20:53,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:53,877 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:53,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 15:20:54,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:54,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:54,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2024-11-08 15:20:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010217947] [2024-11-08 15:20:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-08 15:20:54,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010217947] [2024-11-08 15:20:54,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010217947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144326462] [2024-11-08 15:20:54,454 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 15:20:54,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:54,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:54,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:20:54,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:20:54,514 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-08 15:20:54,514 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:54,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 15:20:54,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 15:20:54,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 15:20:56,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144326462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:56,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:56,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 21] total 47 [2024-11-08 15:20:56,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369894561] [2024-11-08 15:20:56,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:56,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 15:20:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 15:20:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1835, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 15:20:56,662 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 31 states have internal predecessors, (64), 3 states have call successors, (4), 1 states have call predecessors, (4), 24 states have return successors, (25), 25 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-08 15:20:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:57,088 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-11-08 15:20:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-08 15:20:57,088 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 31 states have internal predecessors, (64), 3 states have call successors, (4), 1 states have call predecessors, (4), 24 states have return successors, (25), 25 states have call predecessors, (25), 3 states have call successors, (25) Word has length 58 [2024-11-08 15:20:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:57,089 INFO L225 Difference]: With dead ends: 63 [2024-11-08 15:20:57,090 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 15:20:57,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=938, Invalid=5068, Unknown=0, NotChecked=0, Total=6006 [2024-11-08 15:20:57,092 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:57,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 147 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 15:20:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-08 15:20:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 15:20:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-08 15:20:57,106 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 58 [2024-11-08 15:20:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:57,107 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-08 15:20:57,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 31 states have internal predecessors, (64), 3 states have call successors, (4), 1 states have call predecessors, (4), 24 states have return successors, (25), 25 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-08 15:20:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-08 15:20:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:20:57,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:57,111 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:57,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 15:20:57,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:57,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:57,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 6 times [2024-11-08 15:20:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495267431] [2024-11-08 15:20:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:20:57,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:20:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:20:57,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:20:57,366 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:20:57,367 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:20:57,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:20:57,371 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1] [2024-11-08 15:20:57,402 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:20:57,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:20:57 BoogieIcfgContainer [2024-11-08 15:20:57,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:20:57,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:20:57,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:20:57,405 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:20:57,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:48" (3/4) ... [2024-11-08 15:20:57,406 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:20:57,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:20:57,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:20:57,453 INFO L158 Benchmark]: Toolchain (without parser) took 9611.27ms. Allocated memory was 134.2MB in the beginning and 224.4MB in the end (delta: 90.2MB). Free memory was 63.6MB in the beginning and 147.2MB in the end (delta: -83.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-08 15:20:57,453 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:20:57,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.94ms. Allocated memory is still 134.2MB. Free memory was 63.6MB in the beginning and 51.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 15:20:57,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.89ms. Allocated memory is still 134.2MB. Free memory was 51.5MB in the beginning and 50.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:20:57,453 INFO L158 Benchmark]: Boogie Preprocessor took 27.27ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 50.1MB in the beginning and 157.3MB in the end (delta: -107.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-08 15:20:57,453 INFO L158 Benchmark]: RCFGBuilder took 236.18ms. Allocated memory is still 186.6MB. Free memory was 157.3MB in the beginning and 150.9MB in the end (delta: 6.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-08 15:20:57,454 INFO L158 Benchmark]: TraceAbstraction took 9099.03ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 150.0MB in the beginning and 150.4MB in the end (delta: -407.0kB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-11-08 15:20:57,454 INFO L158 Benchmark]: Witness Printer took 47.63ms. Allocated memory is still 224.4MB. Free memory was 150.4MB in the beginning and 147.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:20:57,455 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.15ms. Allocated memory is still 134.2MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.94ms. Allocated memory is still 134.2MB. Free memory was 63.6MB in the beginning and 51.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.89ms. Allocated memory is still 134.2MB. Free memory was 51.5MB in the beginning and 50.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.27ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 50.1MB in the beginning and 157.3MB in the end (delta: -107.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 236.18ms. Allocated memory is still 186.6MB. Free memory was 157.3MB in the beginning and 150.9MB in the end (delta: 6.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9099.03ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 150.0MB in the beginning and 150.4MB in the end (delta: -407.0kB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Witness Printer took 47.63ms. Allocated memory is still 224.4MB. Free memory was 150.4MB in the beginning and 147.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 15; VAL [input=15] [L13] CALL, EXPR id(input) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, x=15] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=15] [L13] int result = id(input); [L14] COND TRUE result == 15 VAL [input=15] [L15] reach_error() VAL [input=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 222 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 484 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 419 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 65 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 303 SyntacticMatches, 18 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2355 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=6, InterpolantAutomatonStates: 84, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 1304 SizeOfPredicates, 10 NumberOfNonLiveVariables, 509 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 528/1206 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:20:57,477 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE