./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-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 eb57cc67b4a5d1052a722feccb00a81098424cf4bc0bbd7bfe756405ab740d43 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:13:40,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:13:40,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:13:40,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:13:40,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:13:40,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:13:40,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:13:40,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:13:40,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:13:40,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:13:40,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:13:40,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:13:40,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:13:40,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:13:40,912 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:13:40,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:13:40,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:13:40,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:13:40,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:13:40,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:13:40,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:13:40,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:13:40,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:13:40,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:13:40,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:13:40,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:13:40,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:13:40,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:13:40,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:13:40,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:13:40,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:13:40,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:13:40,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:13:40,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:13:40,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:13:40,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:13:40,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:13:40,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:13:40,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:13:40,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:13:40,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:13:40,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:13:40,918 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 -> eb57cc67b4a5d1052a722feccb00a81098424cf4bc0bbd7bfe756405ab740d43 [2024-10-14 03:13:41,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:13:41,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:13:41,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:13:41,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:13:41,151 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:13:41,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2024-10-14 03:13:42,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:13:42,568 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:13:42,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2024-10-14 03:13:42,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3c4925d/2bbb62713ceb41f2b90ca82e27d87c06/FLAG4df88212b [2024-10-14 03:13:42,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3c4925d/2bbb62713ceb41f2b90ca82e27d87c06 [2024-10-14 03:13:42,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:13:42,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:13:42,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:13:42,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:13:42,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:13:42,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482a8450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42, skipping insertion in model container [2024-10-14 03:13:42,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:13:42,759 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c[946,959] [2024-10-14 03:13:42,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:13:42,781 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:13:42,794 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c[946,959] [2024-10-14 03:13:42,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:13:42,815 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:13:42,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42 WrapperNode [2024-10-14 03:13:42,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:13:42,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:13:42,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:13:42,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:13:42,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,842 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-10-14 03:13:42,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:13:42,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:13:42,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:13:42,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:13:42,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,865 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-10-14 03:13:42,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:13:42,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:13:42,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:13:42,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:13:42,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (1/1) ... [2024-10-14 03:13:42,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:13:42,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:42,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:13:42,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:13:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:13:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:13:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-10-14 03:13:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-10-14 03:13:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-10-14 03:13:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-10-14 03:13:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:13:42,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:13:43,039 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:13:43,041 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:13:43,128 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 03:13:43,129 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:13:43,145 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:13:43,146 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:13:43,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:13:43 BoogieIcfgContainer [2024-10-14 03:13:43,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:13:43,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:13:43,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:13:43,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:13:43,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:13:42" (1/3) ... [2024-10-14 03:13:43,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6416792b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:13:43, skipping insertion in model container [2024-10-14 03:13:43,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:13:42" (2/3) ... [2024-10-14 03:13:43,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6416792b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:13:43, skipping insertion in model container [2024-10-14 03:13:43,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:13:43" (3/3) ... [2024-10-14 03:13:43,153 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2024-10-14 03:13:43,165 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:13:43,165 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:13:43,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:13:43,207 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;@19fc2666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:13:43,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:13:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-10-14 03:13:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 03:13:43,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:43,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:13:43,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:43,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2024-10-14 03:13:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:43,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359865061] [2024-10-14 03:13:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:43,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:13:43,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:43,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359865061] [2024-10-14 03:13:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359865061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:13:43,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:13:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:13:43,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283198835] [2024-10-14 03:13:43,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:13:43,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:13:43,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:13:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:13:43,424 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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.4) internal successors, (7), 4 states have internal predecessors, (7), 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-10-14 03:13:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:43,458 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-10-14 03:13:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:13:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-14 03:13:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:43,471 INFO L225 Difference]: With dead ends: 34 [2024-10-14 03:13:43,472 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 03:13:43,475 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-10-14 03:13:43,477 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:43,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:13:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 03:13:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-14 03:13:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-10-14 03:13:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-14 03:13:43,561 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2024-10-14 03:13:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:43,561 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-14 03:13:43,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:13:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-14 03:13:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 03:13:43,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:43,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:13:43,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:13:43,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:43,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2024-10-14 03:13:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:43,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405503435] [2024-10-14 03:13:43,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:43,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:43,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:13:43,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:43,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405503435] [2024-10-14 03:13:43,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405503435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:13:43,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:13:43,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:13:43,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586117003] [2024-10-14 03:13:43,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:13:43,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:13:43,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:43,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:13:43,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:13:43,682 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. 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-10-14 03:13:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:43,704 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-14 03:13:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:13:43,704 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-10-14 03:13:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:43,706 INFO L225 Difference]: With dead ends: 32 [2024-10-14 03:13:43,707 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 03:13:43,707 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-10-14 03:13:43,708 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:43,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:13:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 03:13:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-14 03:13:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-10-14 03:13:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-14 03:13:43,717 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2024-10-14 03:13:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:43,718 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-14 03:13:43,718 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-10-14 03:13:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-14 03:13:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 03:13:43,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:43,720 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:13:43,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:13:43,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:43,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2024-10-14 03:13:43,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:43,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210218530] [2024-10-14 03:13:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:43,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:43,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:13:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:13:43,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:43,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210218530] [2024-10-14 03:13:43,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210218530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:13:43,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693371354] [2024-10-14 03:13:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:43,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:43,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:13:43,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:13:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:43,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:13:43,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:13:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:13:43,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:13:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:13:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693371354] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:13:44,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:13:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-10-14 03:13:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228830353] [2024-10-14 03:13:44,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:13:44,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:13:44,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:13:44,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:13:44,140 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 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-10-14 03:13:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:44,234 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-10-14 03:13:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:13:44,235 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 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 22 [2024-10-14 03:13:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:44,236 INFO L225 Difference]: With dead ends: 54 [2024-10-14 03:13:44,236 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 03:13:44,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 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-10-14 03:13:44,237 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:44,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 82 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:13:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 03:13:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-14 03:13:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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-10-14 03:13:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-14 03:13:44,243 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2024-10-14 03:13:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:44,243 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-14 03:13:44,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 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-10-14 03:13:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-14 03:13:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:13:44,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:44,245 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] [2024-10-14 03:13:44,259 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-10-14 03:13:44,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:44,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:44,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2024-10-14 03:13:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:44,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733641434] [2024-10-14 03:13:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:44,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:44,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:13:44,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733641434] [2024-10-14 03:13:44,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733641434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:13:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083243603] [2024-10-14 03:13:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:44,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:44,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:44,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:13:44,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:13:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:44,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:13:44,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:13:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:13:44,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:13:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:13:44,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083243603] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:13:44,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:13:44,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-10-14 03:13:44,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947656079] [2024-10-14 03:13:44,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:13:44,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:13:44,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:44,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:13:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:13:44,943 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 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-10-14 03:13:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:45,126 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2024-10-14 03:13:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:13:45,127 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 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 23 [2024-10-14 03:13:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:45,129 INFO L225 Difference]: With dead ends: 52 [2024-10-14 03:13:45,131 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 03:13:45,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 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-10-14 03:13:45,132 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:45,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 108 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:13:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 03:13:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-10-14 03:13:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 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-10-14 03:13:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-10-14 03:13:45,149 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2024-10-14 03:13:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:45,149 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-10-14 03:13:45,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 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-10-14 03:13:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-10-14 03:13:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 03:13:45,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:45,152 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] [2024-10-14 03:13:45,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:13:45,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 03:13:45,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:45,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2024-10-14 03:13:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:45,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323598685] [2024-10-14 03:13:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:45,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:45,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:45,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:45,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:13:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:45,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 03:13:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:13:45,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323598685] [2024-10-14 03:13:45,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323598685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:13:45,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239031023] [2024-10-14 03:13:45,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:45,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:45,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:45,497 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-10-14 03:13:45,499 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-10-14 03:13:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:45,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 03:13:45,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:13:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 03:13:45,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:13:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:13:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239031023] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:13:45,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:13:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-10-14 03:13:45,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245412455] [2024-10-14 03:13:45,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:13:45,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:13:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:45,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:13:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:13:45,899 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 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-10-14 03:13:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:46,086 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2024-10-14 03:13:46,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:13:46,086 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 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 35 [2024-10-14 03:13:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:46,088 INFO L225 Difference]: With dead ends: 108 [2024-10-14 03:13:46,089 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 03:13:46,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:13:46,092 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:46,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 123 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:13:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 03:13:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-14 03:13:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 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-10-14 03:13:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-10-14 03:13:46,102 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 35 [2024-10-14 03:13:46,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:46,102 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-10-14 03:13:46,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 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-10-14 03:13:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-10-14 03:13:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 03:13:46,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:46,104 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-10-14 03:13:46,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:13:46,304 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-10-14 03:13:46,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:46,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2024-10-14 03:13:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341907971] [2024-10-14 03:13:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:46,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:46,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:46,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:13:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:13:46,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:46,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341907971] [2024-10-14 03:13:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341907971] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:13:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431087422] [2024-10-14 03:13:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:46,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:46,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:46,405 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-10-14 03:13:46,406 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-10-14 03:13:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:46,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 03:13:46,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:13:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:13:46,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:13:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:13:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431087422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:13:46,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:13:46,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-10-14 03:13:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869968318] [2024-10-14 03:13:46,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:13:46,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 03:13:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 03:13:46,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:13:46,745 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 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-10-14 03:13:46,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:46,978 INFO L93 Difference]: Finished difference Result 178 states and 324 transitions. [2024-10-14 03:13:46,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:13:46,979 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 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 36 [2024-10-14 03:13:46,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:46,981 INFO L225 Difference]: With dead ends: 178 [2024-10-14 03:13:46,981 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 03:13:46,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 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-10-14 03:13:46,983 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:46,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 268 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:13:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 03:13:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-10-14 03:13:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 states have internal predecessors, (77), 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-10-14 03:13:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 161 transitions. [2024-10-14 03:13:46,998 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 161 transitions. Word has length 36 [2024-10-14 03:13:46,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:46,998 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 161 transitions. [2024-10-14 03:13:46,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 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-10-14 03:13:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 161 transitions. [2024-10-14 03:13:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:13:47,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:47,001 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] [2024-10-14 03:13:47,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:13:47,201 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-10-14 03:13:47,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:47,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2024-10-14 03:13:47,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:47,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804221078] [2024-10-14 03:13:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:47,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:47,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:47,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:13:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:13:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 03:13:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804221078] [2024-10-14 03:13:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804221078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:13:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991687894] [2024-10-14 03:13:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:47,332 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-10-14 03:13:47,333 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-10-14 03:13:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:47,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 03:13:47,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:13:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 03:13:47,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:13:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:13:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991687894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:13:47,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:13:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 19 [2024-10-14 03:13:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990906707] [2024-10-14 03:13:47,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:13:47,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 03:13:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:47,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 03:13:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:13:47,873 INFO L87 Difference]: Start difference. First operand 99 states and 161 transitions. Second operand has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-14 03:13:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:48,142 INFO L93 Difference]: Finished difference Result 248 states and 485 transitions. [2024-10-14 03:13:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:13:48,143 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) Word has length 50 [2024-10-14 03:13:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:48,145 INFO L225 Difference]: With dead ends: 248 [2024-10-14 03:13:48,145 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 03:13:48,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:13:48,146 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:48,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 225 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:13:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 03:13:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2024-10-14 03:13:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 71 states have internal predecessors, (86), 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-10-14 03:13:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 176 transitions. [2024-10-14 03:13:48,166 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 176 transitions. Word has length 50 [2024-10-14 03:13:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:48,166 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 176 transitions. [2024-10-14 03:13:48,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-14 03:13:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 176 transitions. [2024-10-14 03:13:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:13:48,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:48,173 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] [2024-10-14 03:13:48,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 03:13:48,373 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-10-14 03:13:48,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:48,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash 18580375, now seen corresponding path program 1 times [2024-10-14 03:13:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:48,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687532180] [2024-10-14 03:13:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:13:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:13:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 03:13:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-14 03:13:48,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687532180] [2024-10-14 03:13:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687532180] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:13:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353227096] [2024-10-14 03:13:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:48,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:48,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:48,677 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-10-14 03:13:48,678 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-10-14 03:13:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:48,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 03:13:48,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:13:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 31 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-14 03:13:48,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:13:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-14 03:13:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353227096] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:13:49,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:13:49,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 19 [2024-10-14 03:13:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874290640] [2024-10-14 03:13:49,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:13:49,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 03:13:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:49,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 03:13:49,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:13:49,120 INFO L87 Difference]: Start difference. First operand 108 states and 176 transitions. Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2024-10-14 03:13:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:49,422 INFO L93 Difference]: Finished difference Result 250 states and 492 transitions. [2024-10-14 03:13:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 03:13:49,423 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 78 [2024-10-14 03:13:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:49,424 INFO L225 Difference]: With dead ends: 250 [2024-10-14 03:13:49,424 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 03:13:49,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 166 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:13:49,426 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 47 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:49,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 291 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:13:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 03:13:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2024-10-14 03:13:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 74 states have internal predecessors, (90), 23 states have call successors, (23), 11 states have call predecessors, (23), 13 states have return successors, (60), 24 states have call predecessors, (60), 23 states have call successors, (60) [2024-10-14 03:13:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 173 transitions. [2024-10-14 03:13:49,449 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 173 transitions. Word has length 78 [2024-10-14 03:13:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:49,452 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 173 transitions. [2024-10-14 03:13:49,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2024-10-14 03:13:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 173 transitions. [2024-10-14 03:13:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 03:13:49,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:49,454 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-10-14 03:13:49,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 03:13:49,658 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-10-14 03:13:49,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:49,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:49,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1844149995, now seen corresponding path program 2 times [2024-10-14 03:13:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:49,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142902807] [2024-10-14 03:13:49,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:49,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:49,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:13:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:13:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:13:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:13:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:13:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 119 proven. 210 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-10-14 03:13:50,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142902807] [2024-10-14 03:13:50,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142902807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:13:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620214157] [2024-10-14 03:13:50,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 03:13:50,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:50,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:50,245 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-10-14 03:13:50,253 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-10-14 03:13:50,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 03:13:50,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:13:50,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 03:13:50,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:13:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 77 proven. 135 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2024-10-14 03:13:50,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:13:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 79 proven. 137 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-10-14 03:13:50,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620214157] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:13:50,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:13:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 11] total 29 [2024-10-14 03:13:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227369135] [2024-10-14 03:13:50,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:13:50,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:13:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:13:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:13:50,942 INFO L87 Difference]: Start difference. First operand 110 states and 173 transitions. Second operand has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 29 states have internal predecessors, (81), 18 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (33), 22 states have call predecessors, (33), 18 states have call successors, (33) [2024-10-14 03:13:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:51,406 INFO L93 Difference]: Finished difference Result 284 states and 554 transitions. [2024-10-14 03:13:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-14 03:13:51,406 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 29 states have internal predecessors, (81), 18 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (33), 22 states have call predecessors, (33), 18 states have call successors, (33) Word has length 160 [2024-10-14 03:13:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:51,408 INFO L225 Difference]: With dead ends: 284 [2024-10-14 03:13:51,408 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 03:13:51,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 350 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1372, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 03:13:51,410 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 103 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:51,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 393 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:13:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 03:13:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2024-10-14 03:13:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 12 states have call predecessors, (21), 16 states have return successors, (50), 26 states have call predecessors, (50), 21 states have call successors, (50) [2024-10-14 03:13:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 162 transitions. [2024-10-14 03:13:51,432 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 162 transitions. Word has length 160 [2024-10-14 03:13:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:51,433 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 162 transitions. [2024-10-14 03:13:51,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 29 states have internal predecessors, (81), 18 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (33), 22 states have call predecessors, (33), 18 states have call successors, (33) [2024-10-14 03:13:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 162 transitions. [2024-10-14 03:13:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 03:13:51,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:51,434 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:13:51,453 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-10-14 03:13:51,635 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-10-14 03:13:51,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:51,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash 453542388, now seen corresponding path program 1 times [2024-10-14 03:13:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:51,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810287558] [2024-10-14 03:13:51,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:51,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:13:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:13:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:13:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 79 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-14 03:13:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:51,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810287558] [2024-10-14 03:13:51,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810287558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:13:51,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713018504] [2024-10-14 03:13:51,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:51,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:51,965 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-10-14 03:13:51,967 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-10-14 03:13:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:52,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 03:13:52,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:13:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-14 03:13:52,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:13:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-14 03:13:52,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713018504] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:13:52,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:13:52,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 19 [2024-10-14 03:13:52,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146863152] [2024-10-14 03:13:52,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:13:52,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 03:13:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:52,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 03:13:52,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:13:52,356 INFO L87 Difference]: Start difference. First operand 117 states and 162 transitions. Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2024-10-14 03:13:52,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:52,544 INFO L93 Difference]: Finished difference Result 242 states and 338 transitions. [2024-10-14 03:13:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:13:52,545 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) Word has length 91 [2024-10-14 03:13:52,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:52,546 INFO L225 Difference]: With dead ends: 242 [2024-10-14 03:13:52,546 INFO L226 Difference]: Without dead ends: 134 [2024-10-14 03:13:52,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2024-10-14 03:13:52,547 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:52,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 214 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:13:52,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-14 03:13:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2024-10-14 03:13:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 85 states have internal predecessors, (99), 22 states have call successors, (22), 13 states have call predecessors, (22), 18 states have return successors, (46), 29 states have call predecessors, (46), 22 states have call successors, (46) [2024-10-14 03:13:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2024-10-14 03:13:52,556 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 91 [2024-10-14 03:13:52,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:52,556 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2024-10-14 03:13:52,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2024-10-14 03:13:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2024-10-14 03:13:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 03:13:52,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:52,557 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:13:52,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 03:13:52,758 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-10-14 03:13:52,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:52,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:52,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1604070482, now seen corresponding path program 2 times [2024-10-14 03:13:52,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:52,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334568607] [2024-10-14 03:13:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:52,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:13:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:13:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:13:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:13:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:13:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:13:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:13:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:13:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 108 proven. 97 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-14 03:13:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:13:53,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334568607] [2024-10-14 03:13:53,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334568607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:13:53,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218306407] [2024-10-14 03:13:53,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 03:13:53,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:13:53,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:13:53,218 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-10-14 03:13:53,219 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-10-14 03:13:53,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 03:13:53,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:13:53,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 03:13:53,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:13:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 112 proven. 24 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-10-14 03:13:53,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:13:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 112 proven. 28 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-10-14 03:13:53,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218306407] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:13:53,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:13:53,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 11] total 29 [2024-10-14 03:13:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720082596] [2024-10-14 03:13:53,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:13:53,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:13:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:13:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:13:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:13:53,924 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. Second operand has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (31), 20 states have call predecessors, (31), 17 states have call successors, (31) [2024-10-14 03:13:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:13:54,299 INFO L93 Difference]: Finished difference Result 259 states and 386 transitions. [2024-10-14 03:13:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 03:13:54,299 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (31), 20 states have call predecessors, (31), 17 states have call successors, (31) Word has length 118 [2024-10-14 03:13:54,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:13:54,300 INFO L225 Difference]: With dead ends: 259 [2024-10-14 03:13:54,300 INFO L226 Difference]: Without dead ends: 136 [2024-10-14 03:13:54,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 255 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=1666, Unknown=0, NotChecked=0, Total=1980 [2024-10-14 03:13:54,302 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 77 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:13:54,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 246 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:13:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-14 03:13:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2024-10-14 03:13:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 62 states have internal predecessors, (72), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (27), 17 states have call predecessors, (27), 16 states have call successors, (27) [2024-10-14 03:13:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2024-10-14 03:13:54,309 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 118 [2024-10-14 03:13:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:13:54,309 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2024-10-14 03:13:54,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 17 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (31), 20 states have call predecessors, (31), 17 states have call successors, (31) [2024-10-14 03:13:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2024-10-14 03:13:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:13:54,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:13:54,310 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:13:54,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 03:13:54,510 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-10-14 03:13:54,511 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:13:54,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:13:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1780776373, now seen corresponding path program 3 times [2024-10-14 03:13:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:13:54,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860658945] [2024-10-14 03:13:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:13:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:13:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:13:54,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:13:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:13:54,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:13:54,581 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:13:54,582 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:13:54,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:13:54,586 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:13:54,661 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:13:54,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:13:54 BoogieIcfgContainer [2024-10-14 03:13:54,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:13:54,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:13:54,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:13:54,668 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:13:54,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:13:43" (3/4) ... [2024-10-14 03:13:54,669 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:13:54,757 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:13:54,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:13:54,758 INFO L158 Benchmark]: Toolchain (without parser) took 12168.39ms. Allocated memory was 172.0MB in the beginning and 388.0MB in the end (delta: 216.0MB). Free memory was 103.4MB in the beginning and 352.8MB in the end (delta: -249.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:13:54,758 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory was 129.0MB in the beginning and 128.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:13:54,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.34ms. Allocated memory is still 172.0MB. Free memory was 103.2MB in the beginning and 91.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 03:13:54,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.40ms. Allocated memory is still 172.0MB. Free memory was 91.8MB in the beginning and 90.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:13:54,759 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 172.0MB. Free memory was 90.4MB in the beginning and 88.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:13:54,759 INFO L158 Benchmark]: RCFGBuilder took 269.29ms. Allocated memory is still 172.0MB. Free memory was 88.8MB in the beginning and 134.9MB in the end (delta: -46.1MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-10-14 03:13:54,759 INFO L158 Benchmark]: TraceAbstraction took 11519.60ms. Allocated memory was 172.0MB in the beginning and 388.0MB in the end (delta: 216.0MB). Free memory was 134.1MB in the beginning and 357.0MB in the end (delta: -222.9MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. [2024-10-14 03:13:54,759 INFO L158 Benchmark]: Witness Printer took 89.94ms. Allocated memory is still 388.0MB. Free memory was 357.0MB in the beginning and 352.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 03:13:54,761 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.13ms. Allocated memory is still 172.0MB. Free memory was 129.0MB in the beginning and 128.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.34ms. Allocated memory is still 172.0MB. Free memory was 103.2MB in the beginning and 91.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.40ms. Allocated memory is still 172.0MB. Free memory was 91.8MB in the beginning and 90.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 172.0MB. Free memory was 90.4MB in the beginning and 88.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 269.29ms. Allocated memory is still 172.0MB. Free memory was 88.8MB in the beginning and 134.9MB in the end (delta: -46.1MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11519.60ms. Allocated memory was 172.0MB in the beginning and 388.0MB in the end (delta: 216.0MB). Free memory was 134.1MB in the beginning and 357.0MB in the end (delta: -222.9MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. * Witness Printer took 89.94ms. Allocated memory is still 388.0MB. Free memory was 357.0MB in the beginning and 352.8MB 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 = 5; VAL [x=5] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=5] [L39] int result = fibo1(x); [L40] COND TRUE result == 5 VAL [x=5] [L41] reach_error() VAL [x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 12, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 424 mSDsluCounter, 2177 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1882 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3302 IncrementalHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 295 mSDtfsCounter, 3302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1571 GetRequests, 1314 SyntacticMatches, 33 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=10, InterpolantAutomatonStates: 174, 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, 11 MinimizatonAttempts, 162 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1350 NumberOfCodeBlocks, 1350 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1829 ConstructedInterpolants, 0 QuantifiedInterpolants, 3589 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1559 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 3408/4314 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-10-14 03:13:54,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE