./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_15x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_15x0-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:00:23,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:00:23,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:00:23,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:00:23,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:00:23,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:00:23,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:00:23,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:00:23,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:00:23,506 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:00:23,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:00:23,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:00:23,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:00:23,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:00:23,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:00:23,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:00:23,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:00:23,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:00:23,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:00:23,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:00:23,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:00:23,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:00:23,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:00:23,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:00:23,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:00:23,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:00:23,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:00:23,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:00:23,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:00:23,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:00:23,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:00:23,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:00:23,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:00:23,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:00:23,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:00:23,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:00:23,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:00:23,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:00:23,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:00:23,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:00:23,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:00:23,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:00:23,521 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c [2024-11-11 21:00:23,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:00:23,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:00:23,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:00:23,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:00:23,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:00:23,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-11-11 21:00:25,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:00:25,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:00:25,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-11-11 21:00:25,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0480d78c/e987c41ece3a4b25ba1b2feac2a38e2a/FLAG1475cc95e [2024-11-11 21:00:25,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0480d78c/e987c41ece3a4b25ba1b2feac2a38e2a [2024-11-11 21:00:25,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:00:25,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:00:25,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:00:25,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:00:25,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:00:25,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:00:25" (1/1) ... [2024-11-11 21:00:25,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1556dd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:25, skipping insertion in model container [2024-11-11 21:00:25,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:00:25" (1/1) ... [2024-11-11 21:00:25,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:00:26,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-11-11 21:00:26,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:00:26,067 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:00:26,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c[481,494] [2024-11-11 21:00:26,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:00:26,103 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:00:26,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26 WrapperNode [2024-11-11 21:00:26,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:00:26,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:00:26,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:00:26,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:00:26,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,135 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-11 21:00:26,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:00:26,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:00:26,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:00:26,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:00:26,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,158 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:00:26,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:00:26,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:00:26,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:00:26,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:00:26,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (1/1) ... [2024-11-11 21:00:26,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:00:26,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:26,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:00:26,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:00:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:00:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:00:26,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:00:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-11 21:00:26,256 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-11 21:00:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:00:26,326 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:00:26,328 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:00:26,432 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-11 21:00:26,432 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:00:26,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:00:26,444 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:00:26,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:00:26 BoogieIcfgContainer [2024-11-11 21:00:26,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:00:26,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:00:26,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:00:26,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:00:26,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:00:25" (1/3) ... [2024-11-11 21:00:26,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6037bd3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:00:26, skipping insertion in model container [2024-11-11 21:00:26,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:26" (2/3) ... [2024-11-11 21:00:26,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6037bd3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:00:26, skipping insertion in model container [2024-11-11 21:00:26,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:00:26" (3/3) ... [2024-11-11 21:00:26,455 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2024-11-11 21:00:26,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:00:26,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:00:26,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:00:26,524 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;@7998d600, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:00:26,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:00:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 21:00:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 21:00:26,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:26,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:26,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-11 21:00:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:26,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256388362] [2024-11-11 21:00:26,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:00:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256388362] [2024-11-11 21:00:26,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256388362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:00:26,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:00:26,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:00:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950148905] [2024-11-11 21:00:26,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:00:26,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:00:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:26,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:00:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:00:26,921 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 21:00:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:26,989 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-11 21:00:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:00:26,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-11 21:00:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:26,998 INFO L225 Difference]: With dead ends: 25 [2024-11-11 21:00:26,999 INFO L226 Difference]: Without dead ends: 15 [2024-11-11 21:00:27,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:00:27,006 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:27,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-11 21:00:27,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-11 21:00:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 21:00:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-11 21:00:27,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-11 21:00:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:27,044 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-11 21:00:27,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 21:00:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-11 21:00:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 21:00:27,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:27,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:27,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:00:27,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:27,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:27,049 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-11 21:00:27,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:27,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050869058] [2024-11-11 21:00:27,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:27,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:00:27,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050869058] [2024-11-11 21:00:27,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050869058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630197370] [2024-11-11 21:00:27,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:27,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:27,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:27,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:27,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:00:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:27,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 21:00:27,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:00:27,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 21:00:27,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630197370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:27,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:27,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2024-11-11 21:00:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770046099] [2024-11-11 21:00:27,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:27,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:00:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:27,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:00:27,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:00:27,727 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-11 21:00:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:27,807 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-11 21:00:27,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:00:27,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2024-11-11 21:00:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:27,809 INFO L225 Difference]: With dead ends: 22 [2024-11-11 21:00:27,809 INFO L226 Difference]: Without dead ends: 18 [2024-11-11 21:00:27,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:00:27,811 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:27,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-11 21:00:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-11 21:00:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 21:00:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-11 21:00:27,819 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-11 21:00:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:27,819 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-11 21:00:27,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-11 21:00:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-11 21:00:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 21:00:27,821 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:27,821 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:27,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:28,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:28,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:28,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2024-11-11 21:00:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523011805] [2024-11-11 21:00:28,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:28,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 21:00:28,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:28,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523011805] [2024-11-11 21:00:28,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523011805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289583886] [2024-11-11 21:00:28,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:00:28,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:28,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:28,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:28,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:00:28,338 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 21:00:28,338 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:28,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 21:00:28,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 21:00:28,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 21:00:28,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289583886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:28,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:28,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-11-11 21:00:28,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725441284] [2024-11-11 21:00:28,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:28,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:00:28,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:28,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:00:28,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:00:28,737 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-11 21:00:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:28,797 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-11 21:00:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:00:28,797 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2024-11-11 21:00:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:28,798 INFO L225 Difference]: With dead ends: 25 [2024-11-11 21:00:28,798 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 21:00:28,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:00:28,801 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:28,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 44 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 21:00:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-11 21:00:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:00:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-11 21:00:28,806 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2024-11-11 21:00:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:28,807 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-11 21:00:28,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-11 21:00:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-11 21:00:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 21:00:28,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:28,808 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:28,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:00:29,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-11 21:00:29,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:29,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2024-11-11 21:00:29,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:29,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134128840] [2024-11-11 21:00:29,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:29,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:29,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134128840] [2024-11-11 21:00:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134128840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876293999] [2024-11-11 21:00:29,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 21:00:29,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:29,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:29,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:29,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:00:29,367 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-11 21:00:29,367 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:29,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 21:00:29,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:29,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:00:29,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876293999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:29,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:29,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2024-11-11 21:00:29,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255548265] [2024-11-11 21:00:29,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:29,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 21:00:29,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:29,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 21:00:29,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:00:29,939 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 21:00:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:30,006 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-11 21:00:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:00:30,007 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 28 [2024-11-11 21:00:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:30,008 INFO L225 Difference]: With dead ends: 28 [2024-11-11 21:00:30,008 INFO L226 Difference]: Without dead ends: 24 [2024-11-11 21:00:30,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:00:30,009 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:30,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-11 21:00:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-11 21:00:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 21:00:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-11 21:00:30,015 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 28 [2024-11-11 21:00:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:30,016 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-11 21:00:30,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 21:00:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-11 21:00:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 21:00:30,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:30,020 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:30,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:30,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:30,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:30,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 4 times [2024-11-11 21:00:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:30,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595881064] [2024-11-11 21:00:30,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:30,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:30,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:30,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 21:00:30,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:30,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595881064] [2024-11-11 21:00:30,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595881064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112450151] [2024-11-11 21:00:30,520 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 21:00:30,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:30,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:30,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:30,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 21:00:30,582 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 21:00:30,583 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:30,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 21:00:30,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 21:00:30,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 21:00:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112450151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:31,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:31,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-11-11 21:00:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663620116] [2024-11-11 21:00:31,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:31,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 21:00:31,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 21:00:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:00:31,376 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-11 21:00:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:31,465 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-11 21:00:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:00:31,470 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) Word has length 34 [2024-11-11 21:00:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:31,471 INFO L225 Difference]: With dead ends: 31 [2024-11-11 21:00:31,471 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 21:00:31,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:00:31,472 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:31,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 60 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 21:00:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 21:00:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 21:00:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-11 21:00:31,483 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 34 [2024-11-11 21:00:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:31,484 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-11 21:00:31,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-11 21:00:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-11 21:00:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-11 21:00:31,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:31,486 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:31,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:31,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:31,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:31,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:31,688 INFO L85 PathProgramCache]: Analyzing trace with hash -886339242, now seen corresponding path program 5 times [2024-11-11 21:00:31,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:31,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201126229] [2024-11-11 21:00:31,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:31,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:31,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:31,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:31,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 21:00:31,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201126229] [2024-11-11 21:00:31,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201126229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083272158] [2024-11-11 21:00:31,959 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 21:00:31,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:31,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:31,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:31,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 21:00:32,023 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-11 21:00:32,024 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:32,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-11 21:00:32,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 21:00:32,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:33,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083272158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:33,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:33,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2024-11-11 21:00:33,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126777596] [2024-11-11 21:00:33,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:33,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 21:00:33,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:33,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 21:00:33,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:00:33,130 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-11 21:00:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:33,216 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-11 21:00:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:00:33,218 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 40 [2024-11-11 21:00:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:33,219 INFO L225 Difference]: With dead ends: 34 [2024-11-11 21:00:33,219 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 21:00:33,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:00:33,220 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:33,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 82 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 21:00:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 21:00:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 21:00:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-11 21:00:33,232 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 40 [2024-11-11 21:00:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:33,233 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-11 21:00:33,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-11 21:00:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-11 21:00:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 21:00:33,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:33,235 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:33,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 21:00:33,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:33,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:33,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash -918712436, now seen corresponding path program 6 times [2024-11-11 21:00:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285850325] [2024-11-11 21:00:33,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:33,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:33,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:33,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:33,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-11 21:00:33,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:33,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285850325] [2024-11-11 21:00:33,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285850325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:33,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626691518] [2024-11-11 21:00:33,755 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-11 21:00:33,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:33,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:33,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:33,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 21:00:33,832 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-11 21:00:33,832 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:33,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 21:00:33,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-11 21:00:33,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 21:00:35,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626691518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:35,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:35,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2024-11-11 21:00:35,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065225064] [2024-11-11 21:00:35,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:35,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 21:00:35,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:35,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 21:00:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:00:35,284 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-11 21:00:35,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:35,356 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-11 21:00:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:00:35,356 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 46 [2024-11-11 21:00:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:35,357 INFO L225 Difference]: With dead ends: 37 [2024-11-11 21:00:35,357 INFO L226 Difference]: Without dead ends: 33 [2024-11-11 21:00:35,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2024-11-11 21:00:35,359 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:35,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 69 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-11 21:00:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-11 21:00:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 21:00:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-11 21:00:35,364 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2024-11-11 21:00:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:35,365 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-11 21:00:35,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-11 21:00:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-11 21:00:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:00:35,366 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:35,366 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:35,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:35,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:35,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 7 times [2024-11-11 21:00:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344297103] [2024-11-11 21:00:35,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 21:00:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:35,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344297103] [2024-11-11 21:00:35,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344297103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:35,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271055949] [2024-11-11 21:00:35,991 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-11 21:00:35,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:35,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:35,993 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:35,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 21:00:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:36,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 21:00:36,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 21:00:36,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 21:00:38,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271055949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:38,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:38,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2024-11-11 21:00:38,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905701571] [2024-11-11 21:00:38,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:38,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 21:00:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:38,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 21:00:38,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:00:38,018 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-11 21:00:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:38,100 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-11 21:00:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:00:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2024-11-11 21:00:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:38,102 INFO L225 Difference]: With dead ends: 40 [2024-11-11 21:00:38,102 INFO L226 Difference]: Without dead ends: 36 [2024-11-11 21:00:38,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2024-11-11 21:00:38,103 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:38,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-11 21:00:38,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-11 21:00:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 21:00:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-11 21:00:38,109 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2024-11-11 21:00:38,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:38,109 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-11 21:00:38,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-11 21:00:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-11 21:00:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 21:00:38,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:38,111 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:38,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 21:00:38,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:38,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:38,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 8 times [2024-11-11 21:00:38,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:38,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34423200] [2024-11-11 21:00:38,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:38,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-11 21:00:38,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:38,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34423200] [2024-11-11 21:00:38,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34423200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:38,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525633480] [2024-11-11 21:00:38,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:00:38,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:38,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:38,815 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:38,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 21:00:38,933 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 21:00:38,934 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:38,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 21:00:38,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-11 21:00:39,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 21:00:41,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525633480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:41,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:41,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2024-11-11 21:00:41,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407572088] [2024-11-11 21:00:41,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:41,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-11 21:00:41,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:41,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-11 21:00:41,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-11-11 21:00:41,397 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-11 21:00:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:41,530 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-11-11 21:00:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:00:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 58 [2024-11-11 21:00:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:41,532 INFO L225 Difference]: With dead ends: 43 [2024-11-11 21:00:41,532 INFO L226 Difference]: Without dead ends: 39 [2024-11-11 21:00:41,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 113 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2024-11-11 21:00:41,533 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:41,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 81 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-11 21:00:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-11 21:00:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 21:00:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-11 21:00:41,549 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 58 [2024-11-11 21:00:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:41,550 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-11 21:00:41,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-11 21:00:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-11 21:00:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:00:41,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:41,551 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:41,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 21:00:41,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-11 21:00:41,752 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:41,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:41,753 INFO L85 PathProgramCache]: Analyzing trace with hash -366706730, now seen corresponding path program 9 times [2024-11-11 21:00:41,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:41,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509770135] [2024-11-11 21:00:41,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:41,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:41,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:42,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:42,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:42,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:42,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:42,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:42,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:42,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:42,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-11 21:00:42,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:42,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509770135] [2024-11-11 21:00:42,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509770135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:42,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093746899] [2024-11-11 21:00:42,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 21:00:42,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:42,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:42,363 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:42,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 21:00:42,541 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-11 21:00:42,541 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:42,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 21:00:42,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-11 21:00:42,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-11 21:00:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093746899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:45,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:45,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 26 [2024-11-11 21:00:45,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207269925] [2024-11-11 21:00:45,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:45,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 21:00:45,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:45,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 21:00:45,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2024-11-11 21:00:45,886 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-11 21:00:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:45,995 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-11 21:00:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:00:45,995 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) Word has length 64 [2024-11-11 21:00:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:45,996 INFO L225 Difference]: With dead ends: 46 [2024-11-11 21:00:45,996 INFO L226 Difference]: Without dead ends: 42 [2024-11-11 21:00:45,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 125 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=812, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 21:00:45,997 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:45,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 91 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-11 21:00:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-11 21:00:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 21:00:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-11-11 21:00:46,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 64 [2024-11-11 21:00:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:46,004 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-11-11 21:00:46,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-11 21:00:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-11-11 21:00:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 21:00:46,005 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:46,005 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:46,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-11 21:00:46,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 21:00:46,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:46,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:46,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1719425780, now seen corresponding path program 10 times [2024-11-11 21:00:46,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:46,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323595780] [2024-11-11 21:00:46,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-11 21:00:46,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:46,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323595780] [2024-11-11 21:00:46,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323595780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:46,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11128373] [2024-11-11 21:00:46,928 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 21:00:46,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:46,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:46,931 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:46,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 21:00:47,148 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 21:00:47,148 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:47,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-11 21:00:47,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-11 21:00:47,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-11 21:00:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11128373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:51,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:51,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 28 [2024-11-11 21:00:51,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038547065] [2024-11-11 21:00:51,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:51,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 21:00:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:51,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 21:00:51,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:00:51,992 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-11-11 21:00:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:52,150 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-11-11 21:00:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:00:52,151 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) Word has length 70 [2024-11-11 21:00:52,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:52,152 INFO L225 Difference]: With dead ends: 49 [2024-11-11 21:00:52,154 INFO L226 Difference]: Without dead ends: 45 [2024-11-11 21:00:52,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 137 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=448, Invalid=958, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 21:00:52,155 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:52,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 107 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-11 21:00:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-11 21:00:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 21:00:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-11 21:00:52,165 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 70 [2024-11-11 21:00:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:52,165 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-11 21:00:52,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-11-11 21:00:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-11 21:00:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:00:52,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:52,166 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:52,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-11 21:00:52,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 21:00:52,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:52,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1354232598, now seen corresponding path program 11 times [2024-11-11 21:00:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:52,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871875031] [2024-11-11 21:00:52,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:52,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:52,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:52,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:53,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:53,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-11 21:00:53,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871875031] [2024-11-11 21:00:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871875031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567723822] [2024-11-11 21:00:53,130 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 21:00:53,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:53,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:53,132 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:53,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-11 21:00:53,435 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-11 21:00:53,435 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:53,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-11 21:00:53,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-11 21:00:53,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-11 21:00:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567723822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:59,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 30 [2024-11-11 21:00:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481361251] [2024-11-11 21:00:59,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:59,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-11 21:00:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:59,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-11 21:00:59,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-11-11 21:00:59,517 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-11-11 21:00:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:59,682 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-11-11 21:00:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:00:59,683 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) Word has length 76 [2024-11-11 21:00:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:59,685 INFO L225 Difference]: With dead ends: 52 [2024-11-11 21:00:59,685 INFO L226 Difference]: Without dead ends: 48 [2024-11-11 21:00:59,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 149 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2024-11-11 21:00:59,687 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:59,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 105 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:59,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-11 21:00:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-11 21:00:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:00:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-11-11 21:00:59,696 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 76 [2024-11-11 21:00:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:59,696 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-11-11 21:00:59,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-11-11 21:00:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-11-11 21:00:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:00:59,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:59,698 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:59,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-11 21:00:59,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-11 21:00:59,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:59,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1734686668, now seen corresponding path program 12 times [2024-11-11 21:00:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:59,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284656043] [2024-11-11 21:00:59,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-11 21:01:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:01:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284656043] [2024-11-11 21:01:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284656043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:01:00,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798293914] [2024-11-11 21:01:00,773 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-11 21:01:00,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:00,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:01:00,775 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:01:00,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-11 21:01:01,169 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-11-11 21:01:01,169 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:01:01,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-11 21:01:01,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:01:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-11 21:01:01,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:01:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-11 21:01:08,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798293914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:01:08,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:01:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 32 [2024-11-11 21:01:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615837955] [2024-11-11 21:01:08,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:01:08,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-11 21:01:08,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:08,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-11 21:01:08,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-11-11 21:01:08,630 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-11 21:01:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:01:08,801 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2024-11-11 21:01:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 21:01:08,802 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) Word has length 82 [2024-11-11 21:01:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:01:08,803 INFO L225 Difference]: With dead ends: 55 [2024-11-11 21:01:08,803 INFO L226 Difference]: Without dead ends: 51 [2024-11-11 21:01:08,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 161 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=606, Invalid=1286, Unknown=0, NotChecked=0, Total=1892 [2024-11-11 21:01:08,804 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:01:08,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 104 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:01:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-11 21:01:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-11 21:01:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 21:01:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-11-11 21:01:08,810 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 82 [2024-11-11 21:01:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:01:08,810 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-11 21:01:08,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-11 21:01:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-11-11 21:01:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 21:01:08,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:01:08,812 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:01:08,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-11 21:01:09,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 21:01:09,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:01:09,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:01:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1433749930, now seen corresponding path program 13 times [2024-11-11 21:01:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:01:09,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740106852] [2024-11-11 21:01:09,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:01:09,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:01:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-11 21:01:10,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:01:10,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740106852] [2024-11-11 21:01:10,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740106852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:01:10,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485849530] [2024-11-11 21:01:10,035 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-11 21:01:10,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:10,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:01:10,037 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:01:10,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-11 21:01:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:10,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-11 21:01:10,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:01:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-11 21:01:10,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:01:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-11 21:01:20,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485849530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:01:20,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:01:20,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 34 [2024-11-11 21:01:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180495838] [2024-11-11 21:01:20,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:01:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-11 21:01:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-11 21:01:20,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 21:01:20,059 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-11-11 21:01:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:01:20,251 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2024-11-11 21:01:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:01:20,251 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) Word has length 88 [2024-11-11 21:01:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:01:20,252 INFO L225 Difference]: With dead ends: 58 [2024-11-11 21:01:20,252 INFO L226 Difference]: Without dead ends: 54 [2024-11-11 21:01:20,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 173 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=694, Invalid=1468, Unknown=0, NotChecked=0, Total=2162 [2024-11-11 21:01:20,254 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 165 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:01:20,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 114 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:01:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-11 21:01:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-11 21:01:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:01:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2024-11-11 21:01:20,260 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 88 [2024-11-11 21:01:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:01:20,260 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2024-11-11 21:01:20,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-11-11 21:01:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2024-11-11 21:01:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 21:01:20,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:01:20,262 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:01:20,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-11 21:01:20,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 21:01:20,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:01:20,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:01:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1321174388, now seen corresponding path program 14 times [2024-11-11 21:01:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:01:20,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508961313] [2024-11-11 21:01:20,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:01:20,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:01:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:20,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-11 21:01:21,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:01:21,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508961313] [2024-11-11 21:01:21,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508961313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:01:21,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177629473] [2024-11-11 21:01:21,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:01:21,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:21,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:01:21,696 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:01:21,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-11 21:01:22,301 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 21:01:22,302 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:01:22,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 21:01:22,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:01:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-11 21:01:22,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:01:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-11 21:01:34,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177629473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:01:34,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:01:34,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2024-11-11 21:01:34,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180691056] [2024-11-11 21:01:34,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:01:34,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-11 21:01:34,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:34,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-11 21:01:34,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 21:01:34,037 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-11-11 21:01:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:01:34,248 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2024-11-11 21:01:34,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:01:34,249 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) Word has length 94 [2024-11-11 21:01:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:01:34,250 INFO L225 Difference]: With dead ends: 61 [2024-11-11 21:01:34,250 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 21:01:34,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 185 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=785, Invalid=1567, Unknown=0, NotChecked=0, Total=2352 [2024-11-11 21:01:34,252 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:01:34,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 121 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:01:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 21:01:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-11 21:01:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 21:01:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-11 21:01:34,263 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 94 [2024-11-11 21:01:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:01:34,264 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-11 21:01:34,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 35 states have internal predecessors, (70), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-11-11 21:01:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-11 21:01:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:01:34,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:01:34,265 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:01:34,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-11 21:01:34,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:34,471 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:01:34,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:01:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 15 times [2024-11-11 21:01:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:01:34,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636884475] [2024-11-11 21:01:34,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:01:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:01:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:01:34,514 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 21:01:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:01:34,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 21:01:34,572 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 21:01:34,573 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 21:01:34,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:01:34,580 INFO L421 BasicCegarLoop]: Path program histogram: [15, 1] [2024-11-11 21:01:34,639 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 21:01:34,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 09:01:34 BoogieIcfgContainer [2024-11-11 21:01:34,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 21:01:34,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 21:01:34,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 21:01:34,645 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 21:01:34,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:00:26" (3/4) ... [2024-11-11 21:01:34,646 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 21:01:34,713 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 21:01:34,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 21:01:34,714 INFO L158 Benchmark]: Toolchain (without parser) took 68877.93ms. Allocated memory was 157.3MB in the beginning and 664.8MB in the end (delta: 507.5MB). Free memory was 102.6MB in the beginning and 600.2MB in the end (delta: -497.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-11 21:01:34,714 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:01:34,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.01ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 90.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 21:01:34,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.29ms. Allocated memory is still 157.3MB. Free memory was 90.6MB in the beginning and 89.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:01:34,715 INFO L158 Benchmark]: Boogie Preprocessor took 33.01ms. Allocated memory is still 157.3MB. Free memory was 89.1MB in the beginning and 87.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:01:34,715 INFO L158 Benchmark]: RCFGBuilder took 271.91ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 77.4MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 21:01:34,715 INFO L158 Benchmark]: TraceAbstraction took 68196.48ms. Allocated memory was 157.3MB in the beginning and 664.8MB in the end (delta: 507.5MB). Free memory was 76.6MB in the beginning and 603.3MB in the end (delta: -526.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:01:34,715 INFO L158 Benchmark]: Witness Printer took 69.62ms. Allocated memory is still 664.8MB. Free memory was 603.3MB in the beginning and 600.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 21:01:34,717 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.21ms. Allocated memory is still 157.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.01ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 90.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.29ms. Allocated memory is still 157.3MB. Free memory was 90.6MB in the beginning and 89.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.01ms. Allocated memory is still 157.3MB. Free memory was 89.1MB in the beginning and 87.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 271.91ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 77.4MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 68196.48ms. Allocated memory was 157.3MB in the beginning and 664.8MB in the end (delta: 507.5MB). Free memory was 76.6MB in the beginning and 603.3MB in the end (delta: -526.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.62ms. Allocated memory is still 664.8MB. Free memory was 603.3MB in the beginning and 600.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 15; [L15] int b = 0; VAL [a=15, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=15, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.1s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 823 mSDsluCounter, 1183 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1031 mSDsCounter, 329 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1080 IncrementalHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 329 mSolverCounterUnsat, 152 mSDtfsCounter, 1080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2022 GetRequests, 1501 SyntacticMatches, 120 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5366 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=15, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 59.8s InterpolantComputationTime, 1650 NumberOfCodeBlocks, 1650 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 2277 ConstructedInterpolants, 0 QuantifiedInterpolants, 6667 SizeOfPredicates, 105 NumberOfNonLiveVariables, 2562 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 3710/9450 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-11 21:01:34,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE