./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-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/fibo_2calls_6-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 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:20:05,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:20:05,884 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:05,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:20:05,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:20:05,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:20:05,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:20:05,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:20:05,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:20:05,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:20:05,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:20:05,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:20:05,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:20:05,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:20:05,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:20:05,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:20:05,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:20:05,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:20:05,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:20:05,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:20:05,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:20:05,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:20:05,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:20:05,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:20:05,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:20:05,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:20:05,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:20:05,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:20:05,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:20:05,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:20:05,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:20:05,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:20:05,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:05,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:20:05,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:20:05,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:20:05,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:20:05,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:20:05,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:20:05,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:20:05,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:20:05,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:20:05,928 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 -> 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a [2024-11-08 15:20:06,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:20:06,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:20:06,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:20:06,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:20:06,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:20:06,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2024-11-08 15:20:07,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:20:07,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:20:07,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2024-11-08 15:20:07,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99f40982/a4d2b0a56cd74e81bded9e8d1629691d/FLAG4b504d077 [2024-11-08 15:20:07,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99f40982/a4d2b0a56cd74e81bded9e8d1629691d [2024-11-08 15:20:07,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:20:07,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:20:07,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:07,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:20:07,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:20:07,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:07" (1/1) ... [2024-11-08 15:20:07,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e645b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:07, skipping insertion in model container [2024-11-08 15:20:07,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:20:07" (1/1) ... [2024-11-08 15:20:07,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:20:08,047 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/fibo_2calls_6-2.c[946,959] [2024-11-08 15:20:08,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:08,058 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:20:08,076 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/fibo_2calls_6-2.c[946,959] [2024-11-08 15:20:08,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:20:08,091 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:20:08,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:08 WrapperNode [2024-11-08 15:20:08,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:20:08,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:08,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:20:08,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:20:08,099 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:08" (1/1) ... [2024-11-08 15:20:08,106 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:08" (1/1) ... [2024-11-08 15:20:08,119 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-08 15:20:08,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:20:08,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:20:08,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:20:08,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:20:08,127 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:08" (1/1) ... [2024-11-08 15:20:08,128 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:08" (1/1) ... [2024-11-08 15:20:08,129 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:08" (1/1) ... [2024-11-08 15:20:08,139 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:08,139 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:08" (1/1) ... [2024-11-08 15:20:08,139 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:08" (1/1) ... [2024-11-08 15:20:08,142 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:08" (1/1) ... [2024-11-08 15:20:08,143 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:08" (1/1) ... [2024-11-08 15:20:08,144 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:08" (1/1) ... [2024-11-08 15:20:08,145 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:08" (1/1) ... [2024-11-08 15:20:08,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:20:08,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:20:08,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:20:08,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:20:08,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:08" (1/1) ... [2024-11-08 15:20:08,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:20:08,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:08,176 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:08,178 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:08,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:20:08,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:20:08,216 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-08 15:20:08,217 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-08 15:20:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-08 15:20:08,217 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-08 15:20:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:20:08,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:20:08,269 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:20:08,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:20:08,362 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 15:20:08,362 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:20:08,376 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:20:08,376 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:20:08,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:08 BoogieIcfgContainer [2024-11-08 15:20:08,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:20:08,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:20:08,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:20:08,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:20:08,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:20:07" (1/3) ... [2024-11-08 15:20:08,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1f2bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:08, skipping insertion in model container [2024-11-08 15:20:08,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:20:08" (2/3) ... [2024-11-08 15:20:08,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1f2bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:20:08, skipping insertion in model container [2024-11-08 15:20:08,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:20:08" (3/3) ... [2024-11-08 15:20:08,384 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2024-11-08 15:20:08,396 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:20:08,396 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:20:08,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:20:08,460 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;@4ec662a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:20:08,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:20:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 15:20:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 15:20:08,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:08,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:08,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:08,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2024-11-08 15:20:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515461517] [2024-11-08 15:20:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:08,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:08,826 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:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515461517] [2024-11-08 15:20:08,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515461517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:08,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:20:08,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:20:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622070981] [2024-11-08 15:20:08,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:08,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:20:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:08,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:20:08,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:20:08,865 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:08,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:08,924 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-08 15:20:08,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:20:08,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:08,937 INFO L225 Difference]: With dead ends: 39 [2024-11-08 15:20:08,937 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 15:20:08,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:08,945 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:08,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 15:20:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 15:20:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 15:20:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-08 15:20:08,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2024-11-08 15:20:08,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:08,992 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-08 15:20:08,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-08 15:20:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 15:20:08,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:08,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:08,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:20:08,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:08,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2024-11-08 15:20:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:08,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878230] [2024-11-08 15:20:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:08,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:09,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:09,150 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:09,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:09,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878230] [2024-11-08 15:20:09,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:20:09,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:20:09,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:20:09,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565779590] [2024-11-08 15:20:09,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:20:09,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:20:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:09,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:20:09,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:20:09,154 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:09,181 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-08 15:20:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:20:09,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-11-08 15:20:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:09,183 INFO L225 Difference]: With dead ends: 33 [2024-11-08 15:20:09,183 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 15:20:09,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:09,185 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:09,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:20:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 15:20:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-08 15:20:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 15:20:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-08 15:20:09,197 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2024-11-08 15:20:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:09,198 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-08 15:20:09,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-08 15:20:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 15:20:09,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:09,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:09,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:20:09,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:09,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2024-11-08 15:20:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:09,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332252664] [2024-11-08 15:20:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:09,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:09,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 15:20:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:09,366 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:09,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:09,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332252664] [2024-11-08 15:20:09,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332252664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:09,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273282128] [2024-11-08 15:20:09,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:09,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:09,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:09,373 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:09,374 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:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:09,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:20:09,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:09,563 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:09,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:09,820 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:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273282128] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:09,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-08 15:20:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340350729] [2024-11-08 15:20:09,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:09,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:20:09,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:20:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:20:09,827 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:20:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:10,003 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2024-11-08 15:20:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:20:10,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2024-11-08 15:20:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:10,005 INFO L225 Difference]: With dead ends: 55 [2024-11-08 15:20:10,006 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 15:20:10,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:20:10,009 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:10,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 15:20:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-08 15:20:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-08 15:20:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-08 15:20:10,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2024-11-08 15:20:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:10,026 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-08 15:20:10,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:20:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-08 15:20:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 15:20:10,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:10,030 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:10,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:20:10,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:10,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:10,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:10,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2024-11-08 15:20:10,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:10,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939383150] [2024-11-08 15:20:10,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:10,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:10,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:10,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:10,424 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:10,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939383150] [2024-11-08 15:20:10,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939383150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917682991] [2024-11-08 15:20:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:10,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:10,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:10,427 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:10,430 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:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:10,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:20:10,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:10,533 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:10,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:10,749 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:10,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917682991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:10,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:10,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-11-08 15:20:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229984123] [2024-11-08 15:20:10,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:10,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:20:10,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:10,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:20:10,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:20:10,756 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:20:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:10,938 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2024-11-08 15:20:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:20:10,939 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2024-11-08 15:20:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:10,942 INFO L225 Difference]: With dead ends: 53 [2024-11-08 15:20:10,942 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 15:20:10,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:20:10,943 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:10,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 120 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:20:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 15:20:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-08 15:20:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-08 15:20:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-08 15:20:10,955 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 24 [2024-11-08 15:20:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:10,956 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-08 15:20:10,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:20:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-08 15:20:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 15:20:10,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:10,958 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:10,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 15:20:11,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 15:20:11,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:11,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:11,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2024-11-08 15:20:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:11,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885842556] [2024-11-08 15:20:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:11,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 15:20:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:11,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 15:20:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:20:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:11,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885842556] [2024-11-08 15:20:11,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885842556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:11,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517306018] [2024-11-08 15:20:11,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:11,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:11,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:11,321 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:11,322 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:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:11,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:20:11,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 15:20:11,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:20:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517306018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:11,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:11,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-11-08 15:20:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448479856] [2024-11-08 15:20:11,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:11,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:20:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:11,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:20:11,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:20:11,772 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 15:20:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:12,008 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2024-11-08 15:20:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:20:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2024-11-08 15:20:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:12,012 INFO L225 Difference]: With dead ends: 109 [2024-11-08 15:20:12,012 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 15:20:12,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:20:12,014 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:12,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 164 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:20:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 15:20:12,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-08 15:20:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2024-11-08 15:20:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2024-11-08 15:20:12,028 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2024-11-08 15:20:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:12,028 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2024-11-08 15:20:12,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 15:20:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2024-11-08 15:20:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:20:12,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:12,030 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:12,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:20:12,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:12,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:12,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:12,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2024-11-08 15:20:12,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:12,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838771913] [2024-11-08 15:20:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:12,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:20:12,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838771913] [2024-11-08 15:20:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838771913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:12,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487694565] [2024-11-08 15:20:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:12,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:12,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:12,435 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:12,436 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:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:12,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:20:12,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:20:12,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:20:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487694565] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:12,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:12,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-11-08 15:20:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747529539] [2024-11-08 15:20:12,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:12,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 15:20:12,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:12,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 15:20:12,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:20:12,887 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 15:20:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:13,169 INFO L93 Difference]: Finished difference Result 179 states and 325 transitions. [2024-11-08 15:20:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 15:20:13,170 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2024-11-08 15:20:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:13,173 INFO L225 Difference]: With dead ends: 179 [2024-11-08 15:20:13,173 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 15:20:13,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:20:13,175 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:13,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 255 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:20:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 15:20:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2024-11-08 15:20:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 64 states have (on average 1.21875) internal successors, (78), 67 states have internal predecessors, (78), 21 states have call successors, (21), 7 states have call predecessors, (21), 14 states have return successors, (63), 25 states have call predecessors, (63), 21 states have call successors, (63) [2024-11-08 15:20:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2024-11-08 15:20:13,197 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 37 [2024-11-08 15:20:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:13,197 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2024-11-08 15:20:13,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 15:20:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2024-11-08 15:20:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 15:20:13,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:13,200 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:13,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:20:13,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:13,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:13,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:13,402 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2024-11-08 15:20:13,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:13,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623555979] [2024-11-08 15:20:13,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:13,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:13,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:13,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:13,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:20:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 15:20:13,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:13,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623555979] [2024-11-08 15:20:13,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623555979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:13,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249810062] [2024-11-08 15:20:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:13,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:13,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:13,602 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:13,604 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:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:13,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:20:13,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 15:20:13,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:20:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249810062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:14,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2024-11-08 15:20:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795004332] [2024-11-08 15:20:14,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 15:20:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:14,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 15:20:14,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:20:14,264 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-08 15:20:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:14,597 INFO L93 Difference]: Finished difference Result 249 states and 486 transitions. [2024-11-08 15:20:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 15:20:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2024-11-08 15:20:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:14,601 INFO L225 Difference]: With dead ends: 249 [2024-11-08 15:20:14,601 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 15:20:14,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2024-11-08 15:20:14,603 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:14,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 223 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:20:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 15:20:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2024-11-08 15:20:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2024-11-08 15:20:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2024-11-08 15:20:14,625 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2024-11-08 15:20:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:14,625 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2024-11-08 15:20:14,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-08 15:20:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2024-11-08 15:20:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 15:20:14,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:14,629 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:14,646 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:14,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:14,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:14,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1851863125, now seen corresponding path program 1 times [2024-11-08 15:20:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:14,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767661233] [2024-11-08 15:20:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:20:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-08 15:20:15,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:15,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767661233] [2024-11-08 15:20:15,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767661233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:15,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364678203] [2024-11-08 15:20:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:15,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:15,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:15,090 INFO L229 MonitoredProcess]: Starting monitored process 7 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:15,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:20:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:15,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 15:20:15,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 15:20:15,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-08 15:20:16,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364678203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:16,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:16,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2024-11-08 15:20:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108365044] [2024-11-08 15:20:16,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:16,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:20:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:20:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:20:16,068 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-08 15:20:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:16,530 INFO L93 Difference]: Finished difference Result 253 states and 491 transitions. [2024-11-08 15:20:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 15:20:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) Word has length 79 [2024-11-08 15:20:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:16,533 INFO L225 Difference]: With dead ends: 253 [2024-11-08 15:20:16,533 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 15:20:16,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 15:20:16,535 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:16,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 287 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:20:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 15:20:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2024-11-08 15:20:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 60 states have internal predecessors, (70), 16 states have call successors, (16), 8 states have call predecessors, (16), 12 states have return successors, (38), 19 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-08 15:20:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2024-11-08 15:20:16,549 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 79 [2024-11-08 15:20:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:16,550 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2024-11-08 15:20:16,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-08 15:20:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2024-11-08 15:20:16,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 15:20:16,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:16,557 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 14, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:16,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 15:20:16,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:16,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:16,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1233220201, now seen corresponding path program 1 times [2024-11-08 15:20:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922668543] [2024-11-08 15:20:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:16,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:20:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 15:20:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:20:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 84 proven. 258 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-11-08 15:20:17,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:17,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922668543] [2024-11-08 15:20:17,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922668543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:17,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408879730] [2024-11-08 15:20:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:17,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:17,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:17,328 INFO L229 MonitoredProcess]: Starting monitored process 8 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:17,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 15:20:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:17,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:20:17,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 71 proven. 220 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2024-11-08 15:20:17,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 71 proven. 225 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2024-11-08 15:20:18,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408879730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:18,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:18,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 21 [2024-11-08 15:20:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327830709] [2024-11-08 15:20:18,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:18,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 15:20:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:18,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 15:20:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:20:18,378 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2024-11-08 15:20:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:18,671 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2024-11-08 15:20:18,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 15:20:18,671 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) Word has length 217 [2024-11-08 15:20:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:18,673 INFO L225 Difference]: With dead ends: 179 [2024-11-08 15:20:18,673 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 15:20:18,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 483 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-11-08 15:20:18,675 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:18,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 206 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:20:18,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 15:20:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-08 15:20:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 64 states have internal predecessors, (73), 16 states have call successors, (16), 8 states have call predecessors, (16), 14 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) [2024-11-08 15:20:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2024-11-08 15:20:18,704 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 217 [2024-11-08 15:20:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:18,705 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2024-11-08 15:20:18,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2024-11-08 15:20:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2024-11-08 15:20:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:20:18,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:18,710 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 11, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:18,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 15:20:18,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:18,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:18,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1768656719, now seen corresponding path program 1 times [2024-11-08 15:20:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743673440] [2024-11-08 15:20:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:20:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 121 proven. 185 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2024-11-08 15:20:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743673440] [2024-11-08 15:20:19,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743673440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295702093] [2024-11-08 15:20:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:19,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:19,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:19,447 INFO L229 MonitoredProcess]: Starting monitored process 9 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:19,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 15:20:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:19,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:20:19,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 89 proven. 150 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2024-11-08 15:20:19,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 89 proven. 155 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-11-08 15:20:20,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295702093] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:20,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:20,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 22 [2024-11-08 15:20:20,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658769091] [2024-11-08 15:20:20,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:20,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:20:20,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:20,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:20:20,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:20:20,377 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 22 states, 20 states have (on average 3.65) internal successors, (73), 22 states have internal predecessors, (73), 15 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-08 15:20:20,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:20,740 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-11-08 15:20:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 15:20:20,741 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.65) internal successors, (73), 22 states have internal predecessors, (73), 15 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 187 [2024-11-08 15:20:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:20,742 INFO L225 Difference]: With dead ends: 196 [2024-11-08 15:20:20,742 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 15:20:20,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 414 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:20:20,744 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:20,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 279 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:20:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 15:20:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2024-11-08 15:20:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 64 states have internal predecessors, (73), 16 states have call successors, (16), 8 states have call predecessors, (16), 14 states have return successors, (38), 20 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-08 15:20:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2024-11-08 15:20:20,767 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 187 [2024-11-08 15:20:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:20,768 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2024-11-08 15:20:20,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.65) internal successors, (73), 22 states have internal predecessors, (73), 15 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-08 15:20:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2024-11-08 15:20:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 15:20:20,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:20,770 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:20,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 15:20:20,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:20:20,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:20,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1714989091, now seen corresponding path program 2 times [2024-11-08 15:20:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:20,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15119504] [2024-11-08 15:20:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 193 proven. 340 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-11-08 15:20:21,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:21,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15119504] [2024-11-08 15:20:21,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15119504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:21,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618909639] [2024-11-08 15:20:21,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:20:21,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:21,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:21,777 INFO L229 MonitoredProcess]: Starting monitored process 10 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:21,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 15:20:21,898 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:20:21,899 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:21,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 15:20:21,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 275 proven. 129 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2024-11-08 15:20:22,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 275 proven. 143 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2024-11-08 15:20:23,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618909639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:23,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 15] total 33 [2024-11-08 15:20:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038814084] [2024-11-08 15:20:23,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:23,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-08 15:20:23,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:23,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-08 15:20:23,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 15:20:23,381 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 33 states, 32 states have (on average 2.90625) internal successors, (93), 33 states have internal predecessors, (93), 22 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (38), 22 states have call predecessors, (38), 22 states have call successors, (38) [2024-11-08 15:20:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:24,098 INFO L93 Difference]: Finished difference Result 239 states and 409 transitions. [2024-11-08 15:20:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 15:20:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 33 states have internal predecessors, (93), 22 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (38), 22 states have call predecessors, (38), 22 states have call successors, (38) Word has length 215 [2024-11-08 15:20:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:24,101 INFO L225 Difference]: With dead ends: 239 [2024-11-08 15:20:24,101 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 15:20:24,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 472 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=2339, Unknown=0, NotChecked=0, Total=2756 [2024-11-08 15:20:24,104 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 91 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:24,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 545 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 15:20:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 15:20:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2024-11-08 15:20:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 85 states have internal predecessors, (100), 22 states have call successors, (22), 17 states have call predecessors, (22), 14 states have return successors, (52), 22 states have call predecessors, (52), 22 states have call successors, (52) [2024-11-08 15:20:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 174 transitions. [2024-11-08 15:20:24,122 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 174 transitions. Word has length 215 [2024-11-08 15:20:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:24,122 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 174 transitions. [2024-11-08 15:20:24,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 33 states have internal predecessors, (93), 22 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (38), 22 states have call predecessors, (38), 22 states have call successors, (38) [2024-11-08 15:20:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 174 transitions. [2024-11-08 15:20:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 15:20:24,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:24,127 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:24,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 15:20:24,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:24,327 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:24,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1967848152, now seen corresponding path program 3 times [2024-11-08 15:20:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501402873] [2024-11-08 15:20:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:20:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 165 proven. 92 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-08 15:20:24,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:24,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501402873] [2024-11-08 15:20:24,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501402873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:24,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217136228] [2024-11-08 15:20:24,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 15:20:24,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:24,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:24,762 INFO L229 MonitoredProcess]: Starting monitored process 11 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:24,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 15:20:24,845 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 15:20:24,845 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:24,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:20:24,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 27 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-08 15:20:24,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 29 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2024-11-08 15:20:25,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217136228] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:25,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:25,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 9] total 24 [2024-11-08 15:20:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215296734] [2024-11-08 15:20:25,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:25,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 15:20:25,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:25,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 15:20:25,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:20:25,334 INFO L87 Difference]: Start difference. First operand 125 states and 174 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2024-11-08 15:20:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:25,602 INFO L93 Difference]: Finished difference Result 256 states and 365 transitions. [2024-11-08 15:20:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 15:20:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) Word has length 147 [2024-11-08 15:20:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:25,605 INFO L225 Difference]: With dead ends: 256 [2024-11-08 15:20:25,605 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 15:20:25,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 324 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:20:25,606 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 52 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:25,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 272 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:20:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 15:20:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2024-11-08 15:20:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 85 states have internal predecessors, (100), 22 states have call successors, (22), 17 states have call predecessors, (22), 14 states have return successors, (45), 22 states have call predecessors, (45), 22 states have call successors, (45) [2024-11-08 15:20:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2024-11-08 15:20:25,620 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 147 [2024-11-08 15:20:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:25,621 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2024-11-08 15:20:25,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2024-11-08 15:20:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2024-11-08 15:20:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 15:20:25,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:25,624 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:25,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 15:20:25,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 15:20:25,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:25,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1744569602, now seen corresponding path program 4 times [2024-11-08 15:20:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:25,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785672247] [2024-11-08 15:20:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:25,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:20:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:20:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:20:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 15:20:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:20:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:20:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:20:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:20:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:20:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 167 proven. 260 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2024-11-08 15:20:26,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:20:26,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785672247] [2024-11-08 15:20:26,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785672247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:20:26,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027012993] [2024-11-08 15:20:26,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 15:20:26,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:20:26,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:20:26,341 INFO L229 MonitoredProcess]: Starting monitored process 12 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:26,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 15:20:26,456 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 15:20:26,456 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:20:26,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:20:26,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:20:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 113 proven. 385 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-08 15:20:26,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:20:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 113 proven. 406 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-11-08 15:20:28,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027012993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:20:28,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:20:28,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2024-11-08 15:20:28,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770108489] [2024-11-08 15:20:28,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:20:28,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 15:20:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:20:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 15:20:28,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2024-11-08 15:20:28,391 INFO L87 Difference]: Start difference. First operand 125 states and 167 transitions. Second operand has 28 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2024-11-08 15:20:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:20:28,806 INFO L93 Difference]: Finished difference Result 269 states and 424 transitions. [2024-11-08 15:20:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 15:20:28,807 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) Word has length 228 [2024-11-08 15:20:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:20:28,808 INFO L225 Difference]: With dead ends: 269 [2024-11-08 15:20:28,808 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 15:20:28,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 500 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=1170, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 15:20:28,810 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 34 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:20:28,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 469 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:20:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 15:20:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-08 15:20:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.12) internal successors, (84), 72 states have internal predecessors, (84), 17 states have call successors, (17), 15 states have call predecessors, (17), 12 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-11-08 15:20:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2024-11-08 15:20:28,818 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 228 [2024-11-08 15:20:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:20:28,819 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2024-11-08 15:20:28,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 28 states have internal predecessors, (91), 21 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2024-11-08 15:20:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2024-11-08 15:20:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 15:20:28,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:20:28,821 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:28,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 15:20:29,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 15:20:29,025 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:20:29,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:20:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash 521886258, now seen corresponding path program 5 times [2024-11-08 15:20:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:20:29,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843227617] [2024-11-08 15:20:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:20:29,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:20:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:20:29,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:20:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:20:29,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:20:29,131 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:20:29,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:20:29,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:20:29,137 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:20:29,199 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:20:29,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:20:29 BoogieIcfgContainer [2024-11-08 15:20:29,202 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:20:29,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:20:29,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:20:29,203 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:20:29,204 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:08" (3/4) ... [2024-11-08 15:20:29,204 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:20:29,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:20:29,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:20:29,275 INFO L158 Benchmark]: Toolchain (without parser) took 21423.11ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 134.0MB in the beginning and 291.2MB in the end (delta: -157.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 15:20:29,276 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 130.0MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:20:29,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.31ms. Allocated memory is still 163.6MB. Free memory was 133.3MB in the beginning and 121.4MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:20:29,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.58ms. Allocated memory is still 163.6MB. Free memory was 121.4MB in the beginning and 119.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:20:29,276 INFO L158 Benchmark]: Boogie Preprocessor took 26.61ms. Allocated memory is still 163.6MB. Free memory was 119.8MB in the beginning and 118.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:20:29,277 INFO L158 Benchmark]: RCFGBuilder took 230.29ms. Allocated memory is still 163.6MB. Free memory was 118.6MB in the beginning and 107.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 15:20:29,277 INFO L158 Benchmark]: TraceAbstraction took 20823.84ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 106.7MB in the beginning and 295.4MB in the end (delta: -188.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:20:29,277 INFO L158 Benchmark]: Witness Printer took 72.11ms. Allocated memory is still 343.9MB. Free memory was 295.4MB in the beginning and 291.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:20:29,278 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.24ms. Allocated memory is still 130.0MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.31ms. Allocated memory is still 163.6MB. Free memory was 133.3MB in the beginning and 121.4MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.58ms. Allocated memory is still 163.6MB. Free memory was 121.4MB in the beginning and 119.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.61ms. Allocated memory is still 163.6MB. Free memory was 119.8MB in the beginning and 118.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 230.29ms. Allocated memory is still 163.6MB. Free memory was 118.6MB in the beginning and 107.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20823.84ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 106.7MB in the beginning and 295.4MB in the end (delta: -188.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.11ms. Allocated memory is still 343.9MB. Free memory was 295.4MB in the beginning and 291.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [x=6] [L41] reach_error() VAL [x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.7s, OverallIterations: 14, TraceHistogramMax: 18, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 529 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 3232 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2837 mSDsCounter, 470 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4488 IncrementalHoareTripleChecker+Invalid, 4958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 470 mSolverCounterUnsat, 395 mSDtfsCounter, 4488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3072 GetRequests, 2718 SyntacticMatches, 49 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2469 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=11, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 142 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 2683 NumberOfCodeBlocks, 2553 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3718 ConstructedInterpolants, 0 QuantifiedInterpolants, 6232 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2648 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 13607/16914 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:29,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE