./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_6-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e0068f83ad7eb3861b59041e8ebf2a38df44c3a60c0fafaf2450f6b793a60fbe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:04:07,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:04:07,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:04:07,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:04:07,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:04:07,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:04:07,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:04:07,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:04:07,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:04:07,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:04:07,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:04:07,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:04:07,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:04:07,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:04:07,344 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:04:07,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:04:07,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:04:07,345 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:04:07,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:04:07,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:04:07,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:04:07,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:04:07,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:04:07,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:04:07,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:04:07,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:04:07,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:04:07,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:04:07,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:04:07,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:04:07,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:04:07,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:04:07,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:04:07,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:04:07,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:04:07,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:04:07,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:04:07,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:04:07,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:04:07,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:04:07,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:04:07,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:04:07,353 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-clean/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-clean/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 -> e0068f83ad7eb3861b59041e8ebf2a38df44c3a60c0fafaf2450f6b793a60fbe [2024-10-11 03:04:07,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:04:07,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:04:07,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:04:07,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:04:07,655 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:04:07,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2024-10-11 03:04:09,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:04:09,223 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:04:09,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2024-10-11 03:04:09,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b49ac98c1/4c321b874cad4d03b5d7fcbaf7371f91/FLAGa403a5e9b [2024-10-11 03:04:09,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b49ac98c1/4c321b874cad4d03b5d7fcbaf7371f91 [2024-10-11 03:04:09,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:04:09,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:04:09,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:04:09,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:04:09,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:04:09,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc820f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09, skipping insertion in model container [2024-10-11 03:04:09,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:04:09,822 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_6-1.c[946,959] [2024-10-11 03:04:09,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:04:09,840 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:04:09,856 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_6-1.c[946,959] [2024-10-11 03:04:09,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:04:09,873 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:04:09,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09 WrapperNode [2024-10-11 03:04:09,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:04:09,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:04:09,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:04:09,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:04:09,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,898 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-10-11 03:04:09,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:04:09,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:04:09,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:04:09,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:04:09,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,920 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-11 03:04:09,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:04:09,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:04:09,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:04:09,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:04:09,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (1/1) ... [2024-10-11 03:04:09,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:04:09,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:09,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:04:09,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:04:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:04:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:04:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-10-11 03:04:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-10-11 03:04:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-10-11 03:04:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-10-11 03:04:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:04:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:04:10,083 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:04:10,085 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:04:10,234 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 03:04:10,234 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:04:10,262 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:04:10,263 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:04:10,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:10 BoogieIcfgContainer [2024-10-11 03:04:10,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:04:10,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:04:10,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:04:10,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:04:10,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:04:09" (1/3) ... [2024-10-11 03:04:10,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124604a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:04:10, skipping insertion in model container [2024-10-11 03:04:10,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:09" (2/3) ... [2024-10-11 03:04:10,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124604a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:04:10, skipping insertion in model container [2024-10-11 03:04:10,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:10" (3/3) ... [2024-10-11 03:04:10,272 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2024-10-11 03:04:10,285 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:04:10,285 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:04:10,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:04:10,337 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;@33fd44d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:04:10,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:04:10,340 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-11 03:04:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 03:04:10,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:10,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:10,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:10,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2024-10-11 03:04:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342725687] [2024-10-11 03:04:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,587 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-11 03:04:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342725687] [2024-10-11 03:04:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342725687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:04:10,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:04:10,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:04:10,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101988011] [2024-10-11 03:04:10,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:04:10,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:04:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:10,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:04:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:10,630 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, 4 states have (on average 1.75) 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-11 03:04:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:10,736 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2024-10-11 03:04:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:04:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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-11 03:04:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:10,748 INFO L225 Difference]: With dead ends: 36 [2024-10-11 03:04:10,749 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 03:04:10,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11 03:04:10,754 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:10,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 03:04:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-11 03:04:10,797 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-11 03:04:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-11 03:04:10,799 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2024-10-11 03:04:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:10,799 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-11 03:04:10,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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-11 03:04:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-11 03:04:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 03:04:10,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:10,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:10,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:04:10,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:10,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2024-10-11 03:04:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276119448] [2024-10-11 03:04:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:10,924 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-11 03:04:10,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:10,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276119448] [2024-10-11 03:04:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276119448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:04:10,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:04:10,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:04:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767340102] [2024-10-11 03:04:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:04:10,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:04:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:10,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:04:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:10,929 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-11 03:04:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:10,999 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-11 03:04:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:04:11,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-11 03:04:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:11,001 INFO L225 Difference]: With dead ends: 32 [2024-10-11 03:04:11,001 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 03:04:11,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11 03:04:11,003 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:11,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 03:04:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-11 03:04:11,014 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-11 03:04:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-11 03:04:11,015 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2024-10-11 03:04:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:11,016 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-11 03:04:11,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-11 03:04:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-11 03:04:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 03:04:11,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:11,017 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-11 03:04:11,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:04:11,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:11,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:11,018 INFO L85 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2024-10-11 03:04:11,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968807096] [2024-10-11 03:04:11,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:11,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:11,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:04:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:11,250 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-11 03:04:11,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:11,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968807096] [2024-10-11 03:04:11,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968807096] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:11,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374301612] [2024-10-11 03:04:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:11,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:11,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:11,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:11,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:04:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:11,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:04:11,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:11,426 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-11 03:04:11,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:11,629 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-11 03:04:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374301612] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:11,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:11,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-10-11 03:04:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668231599] [2024-10-11 03:04:11,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:11,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:04:11,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:11,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:04:11,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:04:11,633 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-11 03:04:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:11,776 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-10-11 03:04:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:04:11,777 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-11 03:04:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:11,779 INFO L225 Difference]: With dead ends: 54 [2024-10-11 03:04:11,780 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 03:04:11,780 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-11 03:04:11,782 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:11,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 03:04:11,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-11 03:04:11,790 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-11 03:04:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-11 03:04:11,791 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2024-10-11 03:04:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:11,792 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-11 03:04:11,792 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-11 03:04:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-11 03:04:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:04:11,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:11,797 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-11 03:04:11,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:04:11,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:11,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:11,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2024-10-11 03:04:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004855641] [2024-10-11 03:04:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,160 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-11 03:04:12,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:12,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004855641] [2024-10-11 03:04:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004855641] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:12,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606543908] [2024-10-11 03:04:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:12,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:12,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:12,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:04:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:04:12,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:12,254 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-11 03:04:12,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:12,433 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-11 03:04:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606543908] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:12,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:12,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-10-11 03:04:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435118022] [2024-10-11 03:04:12,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:12,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:04:12,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:12,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:04:12,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:04:12,440 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-11 03:04:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:12,618 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2024-10-11 03:04:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:04:12,618 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-11 03:04:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:12,621 INFO L225 Difference]: With dead ends: 52 [2024-10-11 03:04:12,621 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 03:04:12,621 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-11 03:04:12,624 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:12,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 114 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 03:04:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-10-11 03:04:12,638 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-11 03:04:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-10-11 03:04:12,642 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2024-10-11 03:04:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:12,642 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-10-11 03:04:12,642 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-11 03:04:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-10-11 03:04:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 03:04:12,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:12,644 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-11 03:04:12,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:12,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:12,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:12,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2024-10-11 03:04:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:12,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586392830] [2024-10-11 03:04:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:12,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:04:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:13,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 03:04:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:13,016 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-11 03:04:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586392830] [2024-10-11 03:04:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586392830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134105114] [2024-10-11 03:04:13,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:13,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:13,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:13,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:13,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:04:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:13,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:13,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:13,154 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-11 03:04:13,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:13,515 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-11 03:04:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134105114] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:13,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:13,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-10-11 03:04:13,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586956464] [2024-10-11 03:04:13,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:13,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 03:04:13,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:13,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 03:04:13,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:04:13,519 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-11 03:04:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:13,757 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2024-10-11 03:04:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:04:13,758 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-11 03:04:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:13,760 INFO L225 Difference]: With dead ends: 108 [2024-10-11 03:04:13,763 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 03:04:13,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:04:13,766 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:13,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 119 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 03:04:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-11 03:04:13,787 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-11 03:04:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-10-11 03:04:13,790 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 35 [2024-10-11 03:04:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:13,791 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-10-11 03:04:13,791 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-11 03:04:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-10-11 03:04:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 03:04:13,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:13,795 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-11 03:04:13,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:04:13,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:14,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:14,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:14,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2024-10-11 03:04:14,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:14,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908585280] [2024-10-11 03:04:14,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,191 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-11 03:04:14,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908585280] [2024-10-11 03:04:14,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908585280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294208505] [2024-10-11 03:04:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:14,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:14,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:14,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:14,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:04:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:14,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:14,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:14,338 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-11 03:04:14,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:14,696 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-11 03:04:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294208505] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:14,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:14,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-10-11 03:04:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244284696] [2024-10-11 03:04:14,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:14,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:04:14,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:14,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:04:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:04:14,700 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-11 03:04:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:14,962 INFO L93 Difference]: Finished difference Result 178 states and 324 transitions. [2024-10-11 03:04:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:04:14,962 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-11 03:04:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:14,965 INFO L225 Difference]: With dead ends: 178 [2024-10-11 03:04:14,965 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 03:04:14,968 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-11 03:04:14,969 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:14,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 154 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 03:04:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-10-11 03:04:15,000 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-11 03:04:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 161 transitions. [2024-10-11 03:04:15,005 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 161 transitions. Word has length 36 [2024-10-11 03:04:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:15,005 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 161 transitions. [2024-10-11 03:04:15,005 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-11 03:04:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 161 transitions. [2024-10-11 03:04:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:04:15,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:15,012 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-11 03:04:15,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:04:15,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 03:04:15,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:15,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2024-10-11 03:04:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858373951] [2024-10-11 03:04:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:04:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,425 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-11 03:04:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858373951] [2024-10-11 03:04:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858373951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356666194] [2024-10-11 03:04:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:15,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:15,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:15,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:04:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:15,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:04:15,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:15,586 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-11 03:04:15,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:16,142 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-11 03:04:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356666194] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:16,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:16,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2024-10-11 03:04:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690701458] [2024-10-11 03:04:16,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:16,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 03:04:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:16,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 03:04:16,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:04:16,150 INFO L87 Difference]: Start difference. First operand 99 states and 161 transitions. Second operand has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2024-10-11 03:04:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:16,566 INFO L93 Difference]: Finished difference Result 248 states and 485 transitions. [2024-10-11 03:04:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:04:16,567 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 50 [2024-10-11 03:04:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:16,570 INFO L225 Difference]: With dead ends: 248 [2024-10-11 03:04:16,570 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 03:04:16,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:04:16,572 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:16,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 320 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:04:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 03:04:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2024-10-11 03:04:16,599 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-11 03:04:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 176 transitions. [2024-10-11 03:04:16,601 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 176 transitions. Word has length 50 [2024-10-11 03:04:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:16,602 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 176 transitions. [2024-10-11 03:04:16,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2024-10-11 03:04:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 176 transitions. [2024-10-11 03:04:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:04:16,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:16,607 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-11 03:04:16,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:04:16,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:16,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:16,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 18580375, now seen corresponding path program 1 times [2024-10-11 03:04:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353649332] [2024-10-11 03:04:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:16,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:16,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 03:04:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,100 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-11 03:04:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353649332] [2024-10-11 03:04:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353649332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33255469] [2024-10-11 03:04:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:17,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:17,103 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:17,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:04:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:17,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 03:04:17,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 03:04:17,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 03:04:18,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33255469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:18,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:18,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2024-10-11 03:04:18,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758145640] [2024-10-11 03:04:18,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:18,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:04:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:18,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:04:18,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:04:18,138 INFO L87 Difference]: Start difference. First operand 108 states and 176 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) [2024-10-11 03:04:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:18,657 INFO L93 Difference]: Finished difference Result 252 states and 490 transitions. [2024-10-11 03:04:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 03:04:18,658 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) Word has length 78 [2024-10-11 03:04:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:18,660 INFO L225 Difference]: With dead ends: 252 [2024-10-11 03:04:18,660 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 03:04:18,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 164 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:04:18,662 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:18,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 354 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:04:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 03:04:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2024-10-11 03:04:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 12 states have return successors, (38), 19 states have call predecessors, (38), 16 states have call successors, (38) [2024-10-11 03:04:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-10-11 03:04:18,684 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 78 [2024-10-11 03:04:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:18,685 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-10-11 03:04:18,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) [2024-10-11 03:04:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-10-11 03:04:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 03:04:18,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:18,690 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:18,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 03:04:18,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 03:04:18,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:18,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash -76471691, now seen corresponding path program 1 times [2024-10-11 03:04:18,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619490806] [2024-10-11 03:04:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 03:04:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:04:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 03:04:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 76 proven. 208 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2024-10-11 03:04:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619490806] [2024-10-11 03:04:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619490806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716316347] [2024-10-11 03:04:19,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:19,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:19,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:19,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:19,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:04:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:19,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:04:19,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 63 proven. 180 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2024-10-11 03:04:19,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 63 proven. 185 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2024-10-11 03:04:20,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716316347] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:20,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:20,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 21 [2024-10-11 03:04:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717233028] [2024-10-11 03:04:20,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:20,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 03:04:20,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 03:04:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:04:20,406 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2024-10-11 03:04:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:20,738 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2024-10-11 03:04:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 03:04:20,739 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) Word has length 188 [2024-10-11 03:04:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:20,740 INFO L225 Difference]: With dead ends: 178 [2024-10-11 03:04:20,740 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 03:04:20,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 416 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:04:20,742 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:20,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 238 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 03:04:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2024-10-11 03:04:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.180327868852459) internal successors, (72), 63 states have internal predecessors, (72), 16 states have call successors, (16), 8 states have call predecessors, (16), 14 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) [2024-10-11 03:04:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2024-10-11 03:04:20,751 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 188 [2024-10-11 03:04:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:20,752 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2024-10-11 03:04:20,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2024-10-11 03:04:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2024-10-11 03:04:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 03:04:20,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:20,754 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 15, 14, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:20,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:20,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:20,956 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:20,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash -196631365, now seen corresponding path program 2 times [2024-10-11 03:04:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:20,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691290435] [2024-10-11 03:04:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:04:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 03:04:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:04:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 230 proven. 409 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-11 03:04:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691290435] [2024-10-11 03:04:21,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691290435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229795346] [2024-10-11 03:04:21,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:04:21,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:21,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:21,865 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:21,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:04:21,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:04:21,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:21,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 03:04:21,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 114 proven. 312 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2024-10-11 03:04:22,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 118 proven. 316 refuted. 0 times theorem prover too weak. 1174 trivial. 0 not checked. [2024-10-11 03:04:23,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229795346] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:23,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:23,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 13] total 33 [2024-10-11 03:04:23,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502086862] [2024-10-11 03:04:23,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:23,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 03:04:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 03:04:23,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:04:23,295 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 33 states, 32 states have (on average 2.90625) internal successors, (93), 33 states have internal predecessors, (93), 20 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 26 states have call predecessors, (38), 20 states have call successors, (38) [2024-10-11 03:04:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:24,145 INFO L93 Difference]: Finished difference Result 265 states and 484 transitions. [2024-10-11 03:04:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-11 03:04:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 33 states have internal predecessors, (93), 20 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 26 states have call predecessors, (38), 20 states have call successors, (38) Word has length 242 [2024-10-11 03:04:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:24,147 INFO L225 Difference]: With dead ends: 265 [2024-10-11 03:04:24,147 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 03:04:24,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 534 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=444, Invalid=2748, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 03:04:24,150 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 100 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:24,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 573 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:04:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 03:04:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2024-10-11 03:04:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 80 states have internal predecessors, (90), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (39), 24 states have call predecessors, (39), 23 states have call successors, (39) [2024-10-11 03:04:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 152 transitions. [2024-10-11 03:04:24,162 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 152 transitions. Word has length 242 [2024-10-11 03:04:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:24,162 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 152 transitions. [2024-10-11 03:04:24,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 33 states have internal predecessors, (93), 20 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 26 states have call predecessors, (38), 20 states have call successors, (38) [2024-10-11 03:04:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2024-10-11 03:04:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:04:24,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:24,165 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:24,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 03:04:24,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:04:24,370 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:24,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1950574106, now seen corresponding path program 3 times [2024-10-11 03:04:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:24,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295044729] [2024-10-11 03:04:24,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:24,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 03:04:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 03:04:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 229 proven. 101 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2024-10-11 03:04:24,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295044729] [2024-10-11 03:04:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295044729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135543566] [2024-10-11 03:04:24,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:04:24,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:24,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:24,987 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:24,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 03:04:25,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 03:04:25,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:25,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:25,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 135 proven. 31 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2024-10-11 03:04:25,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 135 proven. 33 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-11 03:04:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135543566] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:25,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 9] total 25 [2024-10-11 03:04:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291112809] [2024-10-11 03:04:25,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:25,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 03:04:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 03:04:25,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:04:25,698 INFO L87 Difference]: Start difference. First operand 119 states and 152 transitions. Second operand has 25 states, 23 states have (on average 3.130434782608696) internal successors, (72), 25 states have internal predecessors, (72), 14 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (26), 18 states have call predecessors, (26), 14 states have call successors, (26) [2024-10-11 03:04:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:26,088 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2024-10-11 03:04:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 03:04:26,088 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.130434782608696) internal successors, (72), 25 states have internal predecessors, (72), 14 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (26), 18 states have call predecessors, (26), 14 states have call successors, (26) Word has length 173 [2024-10-11 03:04:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:26,090 INFO L225 Difference]: With dead ends: 151 [2024-10-11 03:04:26,090 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 03:04:26,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 382 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:04:26,091 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 75 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:26,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 358 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:04:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 03:04:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2024-10-11 03:04:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 87 states have internal predecessors, (100), 24 states have call successors, (24), 16 states have call predecessors, (24), 15 states have return successors, (35), 25 states have call predecessors, (35), 24 states have call successors, (35) [2024-10-11 03:04:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2024-10-11 03:04:26,105 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 173 [2024-10-11 03:04:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:26,105 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2024-10-11 03:04:26,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.130434782608696) internal successors, (72), 25 states have internal predecessors, (72), 14 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (26), 18 states have call predecessors, (26), 14 states have call successors, (26) [2024-10-11 03:04:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2024-10-11 03:04:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 03:04:26,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:26,108 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:26,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 03:04:26,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:26,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:26,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1995652508, now seen corresponding path program 4 times [2024-10-11 03:04:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:26,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762497818] [2024-10-11 03:04:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 03:04:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 03:04:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 155 proven. 209 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2024-10-11 03:04:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:26,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762497818] [2024-10-11 03:04:26,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762497818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:26,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603732543] [2024-10-11 03:04:26,878 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:04:26,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:26,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:26,880 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:26,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 03:04:26,984 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:04:26,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:26,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:04:26,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 632 proven. 68 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-10-11 03:04:27,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 137 proven. 324 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 03:04:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603732543] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:28,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 26 [2024-10-11 03:04:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819575431] [2024-10-11 03:04:28,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:28,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:04:28,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:28,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:04:28,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:04:28,341 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 18 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (34), 11 states have call predecessors, (34), 18 states have call successors, (34) [2024-10-11 03:04:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:28,616 INFO L93 Difference]: Finished difference Result 252 states and 315 transitions. [2024-10-11 03:04:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:04:28,617 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 18 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (34), 11 states have call predecessors, (34), 18 states have call successors, (34) Word has length 200 [2024-10-11 03:04:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:28,618 INFO L225 Difference]: With dead ends: 252 [2024-10-11 03:04:28,618 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 03:04:28,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 438 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:04:28,619 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:28,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 244 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 03:04:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-10-11 03:04:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 69 states have internal predecessors, (80), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (19), 17 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-11 03:04:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2024-10-11 03:04:28,630 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 200 [2024-10-11 03:04:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:28,630 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2024-10-11 03:04:28,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 18 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (34), 11 states have call predecessors, (34), 18 states have call successors, (34) [2024-10-11 03:04:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2024-10-11 03:04:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:04:28,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:28,633 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:28,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:28,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 03:04:28,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:28,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1451526342, now seen corresponding path program 5 times [2024-10-11 03:04:28,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:28,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69001247] [2024-10-11 03:04:28,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:28,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:04:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-11 03:04:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:30,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69001247] [2024-10-11 03:04:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69001247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400613463] [2024-10-11 03:04:30,461 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:04:30,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:30,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:30,463 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:30,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 03:04:30,600 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-10-11 03:04:30,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:30,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-10-11 03:04:30,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-11 03:04:30,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-11 03:04:31,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400613463] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:31,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:31,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2024-10-11 03:04:31,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53421713] [2024-10-11 03:04:31,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:31,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 03:04:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:31,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 03:04:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 03:04:31,654 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand has 36 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 19 states have internal predecessors, (46), 7 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (23), 23 states have call predecessors, (23), 7 states have call successors, (23) [2024-10-11 03:04:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:31,891 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2024-10-11 03:04:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 03:04:31,892 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 19 states have internal predecessors, (46), 7 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (23), 23 states have call predecessors, (23), 7 states have call successors, (23) Word has length 173 [2024-10-11 03:04:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:31,893 INFO L225 Difference]: With dead ends: 132 [2024-10-11 03:04:31,893 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 03:04:31,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 03:04:31,895 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:31,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1195 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 03:04:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-10-11 03:04:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 83 states have internal predecessors, (94), 20 states have call successors, (20), 14 states have call predecessors, (20), 17 states have return successors, (29), 26 states have call predecessors, (29), 20 states have call successors, (29) [2024-10-11 03:04:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2024-10-11 03:04:31,907 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 173 [2024-10-11 03:04:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:31,907 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2024-10-11 03:04:31,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 19 states have internal predecessors, (46), 7 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (23), 23 states have call predecessors, (23), 7 states have call successors, (23) [2024-10-11 03:04:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2024-10-11 03:04:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 03:04:31,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:31,909 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:31,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 03:04:32,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 03:04:32,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:32,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash -700952672, now seen corresponding path program 6 times [2024-10-11 03:04:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:32,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930333917] [2024-10-11 03:04:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:04:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:04:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 03:04:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:04:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 62 proven. 166 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-10-11 03:04:32,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:32,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930333917] [2024-10-11 03:04:32,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930333917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:32,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806329710] [2024-10-11 03:04:32,428 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 03:04:32,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:32,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:32,430 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:32,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 03:04:32,528 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-10-11 03:04:32,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:32,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:04:32,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 248 proven. 4 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 03:04:32,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 61 proven. 168 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2024-10-11 03:04:33,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806329710] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:33,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:33,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-10-11 03:04:33,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885238124] [2024-10-11 03:04:33,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:33,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:04:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:33,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:04:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:04:33,023 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 03:04:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:33,124 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2024-10-11 03:04:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:04:33,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 174 [2024-10-11 03:04:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:33,125 INFO L225 Difference]: With dead ends: 187 [2024-10-11 03:04:33,125 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:04:33,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 394 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:04:33,126 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:33,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 132 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:04:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:04:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:04:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:04:33,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2024-10-11 03:04:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:33,128 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:04:33,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 03:04:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:04:33,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:04:33,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:04:33,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 03:04:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 03:04:33,336 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:33,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:04:35,982 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:04:36,005 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 03:04:36,022 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 03:04:36,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:04:36 BoogieIcfgContainer [2024-10-11 03:04:36,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:04:36,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:04:36,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:04:36,027 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:04:36,027 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:10" (3/4) ... [2024-10-11 03:04:36,029 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:04:36,033 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2024-10-11 03:04:36,033 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2024-10-11 03:04:36,036 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 03:04:36,037 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 03:04:36,037 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 03:04:36,037 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:04:36,105 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:04:36,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:04:36,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:04:36,107 INFO L158 Benchmark]: Toolchain (without parser) took 26484.81ms. Allocated memory was 172.0MB in the beginning and 545.3MB in the end (delta: 373.3MB). Free memory was 119.7MB in the beginning and 358.3MB in the end (delta: -238.6MB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. [2024-10-11 03:04:36,107 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:04:36,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.90ms. Allocated memory is still 172.0MB. Free memory was 119.3MB in the beginning and 106.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:04:36,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.38ms. Allocated memory is still 172.0MB. Free memory was 106.7MB in the beginning and 105.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:04:36,108 INFO L158 Benchmark]: Boogie Preprocessor took 28.59ms. Allocated memory is still 172.0MB. Free memory was 105.3MB in the beginning and 103.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:04:36,108 INFO L158 Benchmark]: RCFGBuilder took 335.31ms. Allocated memory is still 172.0MB. Free memory was 103.8MB in the beginning and 92.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 03:04:36,108 INFO L158 Benchmark]: TraceAbstraction took 25760.38ms. Allocated memory was 172.0MB in the beginning and 545.3MB in the end (delta: 373.3MB). Free memory was 91.2MB in the beginning and 362.5MB in the end (delta: -271.3MB). Peak memory consumption was 281.0MB. Max. memory is 16.1GB. [2024-10-11 03:04:36,108 INFO L158 Benchmark]: Witness Printer took 79.49ms. Allocated memory is still 545.3MB. Free memory was 362.5MB in the beginning and 358.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:04:36,110 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.90ms. Allocated memory is still 172.0MB. Free memory was 119.3MB in the beginning and 106.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.38ms. Allocated memory is still 172.0MB. Free memory was 106.7MB in the beginning and 105.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.59ms. Allocated memory is still 172.0MB. Free memory was 105.3MB in the beginning and 103.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 335.31ms. Allocated memory is still 172.0MB. Free memory was 103.8MB in the beginning and 92.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25760.38ms. Allocated memory was 172.0MB in the beginning and 545.3MB in the end (delta: 373.3MB). Free memory was 91.2MB in the beginning and 362.5MB in the end (delta: -271.3MB). Peak memory consumption was 281.0MB. Max. memory is 16.1GB. * Witness Printer took 79.49ms. Allocated memory is still 545.3MB. Free memory was 362.5MB in the beginning and 358.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 14, TraceHistogramMax: 18, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 567 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 500 mSDsluCounter, 4082 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3677 mSDsCounter, 471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4900 IncrementalHoareTripleChecker+Invalid, 5371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 471 mSolverCounterUnsat, 405 mSDtfsCounter, 4900 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3453 GetRequests, 3084 SyntacticMatches, 45 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=11, InterpolantAutomatonStates: 249, 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, 14 MinimizatonAttempts, 123 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 2807 NumberOfCodeBlocks, 2557 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 4163 ConstructedInterpolants, 0 QuantifiedInterpolants, 7047 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2751 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 14827/18645 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Ensures: ((((\result == 1) && (n == 1)) || (\result == 0)) || (1 < n)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: ((((((n < 5) || (5 == n)) || (8 == \result)) || (6 < n)) && (((\result == 0) || (1 < n)) || (n == 1))) && ((n != 1) || (\result == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-11 03:04:36,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE