./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label40.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 96878197f4120fe0a946400d7cd6a9f9a0d5774764bf69134c6af6a4800daf81 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 18:26:56,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 18:26:56,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 18:26:56,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 18:26:56,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 18:26:56,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 18:26:56,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 18:26:56,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 18:26:56,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 18:26:56,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 18:26:56,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 18:26:56,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 18:26:56,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 18:26:56,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 18:26:56,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 18:26:56,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 18:26:56,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 18:26:56,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 18:26:56,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 18:26:56,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 18:26:56,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 18:26:56,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 18:26:56,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 18:26:56,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 18:26:56,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 18:26:56,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 18:26:56,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 18:26:56,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 18:26:56,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 18:26:56,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 18:26:56,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 18:26:56,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 18:26:56,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:26:56,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 18:26:56,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 18:26:56,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 18:26:56,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 18:26:56,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 18:26:56,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 18:26:56,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 18:26:56,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 18:26:56,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 18:26:56,423 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 -> 96878197f4120fe0a946400d7cd6a9f9a0d5774764bf69134c6af6a4800daf81 [2024-11-19 18:26:56,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 18:26:56,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 18:26:56,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 18:26:56,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 18:26:56,662 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 18:26:56,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label40.c [2024-11-19 18:26:58,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 18:26:58,320 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 18:26:58,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label40.c [2024-11-19 18:26:58,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed346e4ca/77a3f3c1fb5149c980fe04947e30ddb8/FLAGccc3bc0ec [2024-11-19 18:26:58,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed346e4ca/77a3f3c1fb5149c980fe04947e30ddb8 [2024-11-19 18:26:58,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 18:26:58,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 18:26:58,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 18:26:58,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 18:26:58,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 18:26:58,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:58" (1/1) ... [2024-11-19 18:26:58,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343d09d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:58, skipping insertion in model container [2024-11-19 18:26:58,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:58" (1/1) ... [2024-11-19 18:26:58,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 18:26:58,634 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/eca-rers2012/Problem16_label40.c[6583,6596] [2024-11-19 18:26:58,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:26:58,918 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 18:26:58,939 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/eca-rers2012/Problem16_label40.c[6583,6596] [2024-11-19 18:26:59,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:26:59,083 INFO L204 MainTranslator]: Completed translation [2024-11-19 18:26:59,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59 WrapperNode [2024-11-19 18:26:59,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 18:26:59,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 18:26:59,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 18:26:59,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 18:26:59,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,285 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-11-19 18:26:59,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 18:26:59,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 18:26:59,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 18:26:59,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 18:26:59,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,363 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-19 18:26:59,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 18:26:59,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 18:26:59,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 18:26:59,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 18:26:59,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (1/1) ... [2024-11-19 18:26:59,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:26:59,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:26:59,504 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-19 18:26:59,506 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-19 18:26:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 18:26:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 18:26:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 18:26:59,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 18:26:59,593 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 18:26:59,595 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 18:27:01,397 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-19 18:27:01,397 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 18:27:01,412 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 18:27:01,412 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 18:27:01,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:27:01 BoogieIcfgContainer [2024-11-19 18:27:01,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 18:27:01,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 18:27:01,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 18:27:01,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 18:27:01,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:26:58" (1/3) ... [2024-11-19 18:27:01,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13dc9f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:27:01, skipping insertion in model container [2024-11-19 18:27:01,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:59" (2/3) ... [2024-11-19 18:27:01,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13dc9f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:27:01, skipping insertion in model container [2024-11-19 18:27:01,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:27:01" (3/3) ... [2024-11-19 18:27:01,418 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label40.c [2024-11-19 18:27:01,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 18:27:01,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 18:27:01,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 18:27:01,483 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;@1a9587c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 18:27:01,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 18:27:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 18:27:01,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:01,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:01,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:01,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash -696204111, now seen corresponding path program 1 times [2024-11-19 18:27:01,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:01,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593952025] [2024-11-19 18:27:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:01,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:01,751 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-19 18:27:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:01,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593952025] [2024-11-19 18:27:01,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593952025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:01,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:01,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:27:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510241376] [2024-11-19 18:27:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:01,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:01,780 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:03,010 INFO L93 Difference]: Finished difference Result 1122 states and 2103 transitions. [2024-11-19 18:27:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:03,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-19 18:27:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:03,024 INFO L225 Difference]: With dead ends: 1122 [2024-11-19 18:27:03,024 INFO L226 Difference]: Without dead ends: 662 [2024-11-19 18:27:03,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:03,031 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 297 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:03,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 18:27:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-19 18:27:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-19 18:27:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2024-11-19 18:27:03,087 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 63 [2024-11-19 18:27:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2024-11-19 18:27:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2024-11-19 18:27:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 18:27:03,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:03,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:03,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 18:27:03,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:03,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:03,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1825534533, now seen corresponding path program 1 times [2024-11-19 18:27:03,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:03,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499200404] [2024-11-19 18:27:03,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:03,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:27:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499200404] [2024-11-19 18:27:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499200404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:27:03,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64129233] [2024-11-19 18:27:03,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:03,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:03,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:03,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:03,253 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:04,228 INFO L93 Difference]: Finished difference Result 1651 states and 2539 transitions. [2024-11-19 18:27:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:04,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-19 18:27:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:04,232 INFO L225 Difference]: With dead ends: 1651 [2024-11-19 18:27:04,232 INFO L226 Difference]: Without dead ends: 991 [2024-11-19 18:27:04,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:04,234 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 338 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:04,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 77 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 18:27:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-19 18:27:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2024-11-19 18:27:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.3767676767676769) internal successors, (1363), 990 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1363 transitions. [2024-11-19 18:27:04,258 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1363 transitions. Word has length 134 [2024-11-19 18:27:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:04,258 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1363 transitions. [2024-11-19 18:27:04,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1363 transitions. [2024-11-19 18:27:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 18:27:04,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:04,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:04,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 18:27:04,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:04,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash -642916736, now seen corresponding path program 1 times [2024-11-19 18:27:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:04,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96161911] [2024-11-19 18:27:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:04,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:27:04,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:04,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96161911] [2024-11-19 18:27:04,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96161911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:04,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:04,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:27:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328807365] [2024-11-19 18:27:04,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:04,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:04,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:04,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:04,380 INFO L87 Difference]: Start difference. First operand 991 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:05,473 INFO L93 Difference]: Finished difference Result 2967 states and 4084 transitions. [2024-11-19 18:27:05,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:05,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2024-11-19 18:27:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:05,479 INFO L225 Difference]: With dead ends: 2967 [2024-11-19 18:27:05,479 INFO L226 Difference]: Without dead ends: 1978 [2024-11-19 18:27:05,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:05,481 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 289 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:05,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 209 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 18:27:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-11-19 18:27:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2024-11-19 18:27:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.2468386444107233) internal successors, (2465), 1977 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2465 transitions. [2024-11-19 18:27:05,507 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2465 transitions. Word has length 135 [2024-11-19 18:27:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:05,508 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2465 transitions. [2024-11-19 18:27:05,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2465 transitions. [2024-11-19 18:27:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 18:27:05,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:05,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:05,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 18:27:05,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:05,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:05,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2022847261, now seen corresponding path program 1 times [2024-11-19 18:27:05,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:05,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363187400] [2024-11-19 18:27:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:27:05,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:05,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363187400] [2024-11-19 18:27:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363187400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:05,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954089777] [2024-11-19 18:27:05,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:05,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:05,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:05,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:05,629 INFO L87 Difference]: Start difference. First operand 1978 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:06,671 INFO L93 Difference]: Finished difference Result 4612 states and 5852 transitions. [2024-11-19 18:27:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:06,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-19 18:27:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:06,679 INFO L225 Difference]: With dead ends: 4612 [2024-11-19 18:27:06,679 INFO L226 Difference]: Without dead ends: 2636 [2024-11-19 18:27:06,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:06,683 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 321 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:06,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 539 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 18:27:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2024-11-19 18:27:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2024-11-19 18:27:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.21707779886148) internal successors, (3207), 2635 states have internal predecessors, (3207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3207 transitions. [2024-11-19 18:27:06,722 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3207 transitions. Word has length 150 [2024-11-19 18:27:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3207 transitions. [2024-11-19 18:27:06,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3207 transitions. [2024-11-19 18:27:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-19 18:27:06,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:06,728 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:06,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 18:27:06,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:06,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1269062465, now seen corresponding path program 1 times [2024-11-19 18:27:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:06,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096523974] [2024-11-19 18:27:06,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 18:27:06,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:06,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096523974] [2024-11-19 18:27:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096523974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:06,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:06,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:27:06,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369282994] [2024-11-19 18:27:06,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:06,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:06,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:06,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:06,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:06,943 INFO L87 Difference]: Start difference. First operand 2636 states and 3207 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:07,967 INFO L93 Difference]: Finished difference Result 6586 states and 8078 transitions. [2024-11-19 18:27:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:07,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2024-11-19 18:27:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:07,976 INFO L225 Difference]: With dead ends: 6586 [2024-11-19 18:27:07,977 INFO L226 Difference]: Without dead ends: 3294 [2024-11-19 18:27:07,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:07,982 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:07,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 18:27:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2024-11-19 18:27:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2024-11-19 18:27:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.0652900091102337) internal successors, (3508), 3293 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 3508 transitions. [2024-11-19 18:27:08,020 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 3508 transitions. Word has length 335 [2024-11-19 18:27:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:08,021 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 3508 transitions. [2024-11-19 18:27:08,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 3508 transitions. [2024-11-19 18:27:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2024-11-19 18:27:08,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:08,027 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:08,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 18:27:08,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:08,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:08,029 INFO L85 PathProgramCache]: Analyzing trace with hash 315077949, now seen corresponding path program 1 times [2024-11-19 18:27:08,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:08,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779547519] [2024-11-19 18:27:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:08,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2024-11-19 18:27:08,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:08,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779547519] [2024-11-19 18:27:08,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779547519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:08,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:08,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:27:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642688621] [2024-11-19 18:27:08,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:08,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:08,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:08,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:08,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:08,395 INFO L87 Difference]: Start difference. First operand 3294 states and 3508 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:09,150 INFO L93 Difference]: Finished difference Result 9549 states and 10185 transitions. [2024-11-19 18:27:09,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:09,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 501 [2024-11-19 18:27:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:09,165 INFO L225 Difference]: With dead ends: 9549 [2024-11-19 18:27:09,165 INFO L226 Difference]: Without dead ends: 6257 [2024-11-19 18:27:09,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:09,170 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 240 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:09,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 71 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:27:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6257 states. [2024-11-19 18:27:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6257 to 6255. [2024-11-19 18:27:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0606012152222577) internal successors, (6633), 6254 states have internal predecessors, (6633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6633 transitions. [2024-11-19 18:27:09,243 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6633 transitions. Word has length 501 [2024-11-19 18:27:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:09,244 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6633 transitions. [2024-11-19 18:27:09,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6633 transitions. [2024-11-19 18:27:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2024-11-19 18:27:09,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:09,251 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:09,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 18:27:09,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:09,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1452955206, now seen corresponding path program 1 times [2024-11-19 18:27:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648095246] [2024-11-19 18:27:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-19 18:27:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648095246] [2024-11-19 18:27:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648095246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518089199] [2024-11-19 18:27:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:09,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:27:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:09,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:27:09,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:27:09,945 INFO L87 Difference]: Start difference. First operand 6255 states and 6633 transitions. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:11,077 INFO L93 Difference]: Finished difference Result 12179 states and 12932 transitions. [2024-11-19 18:27:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:27:11,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 525 [2024-11-19 18:27:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:11,093 INFO L225 Difference]: With dead ends: 12179 [2024-11-19 18:27:11,093 INFO L226 Difference]: Without dead ends: 6255 [2024-11-19 18:27:11,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:27:11,100 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 127 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:11,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 126 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 18:27:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2024-11-19 18:27:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2024-11-19 18:27:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0604413175567637) internal successors, (6632), 6254 states have internal predecessors, (6632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6632 transitions. [2024-11-19 18:27:11,174 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6632 transitions. Word has length 525 [2024-11-19 18:27:11,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:11,174 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6632 transitions. [2024-11-19 18:27:11,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6632 transitions. [2024-11-19 18:27:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2024-11-19 18:27:11,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:11,187 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:11,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 18:27:11,188 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:11,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash 590277590, now seen corresponding path program 1 times [2024-11-19 18:27:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:11,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206959962] [2024-11-19 18:27:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:11,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 720 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-19 18:27:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206959962] [2024-11-19 18:27:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206959962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:11,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494750765] [2024-11-19 18:27:11,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:11,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:11,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:11,539 INFO L87 Difference]: Start difference. First operand 6255 states and 6632 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:12,278 INFO L93 Difference]: Finished difference Result 15140 states and 16162 transitions. [2024-11-19 18:27:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:12,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 640 [2024-11-19 18:27:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:12,299 INFO L225 Difference]: With dead ends: 15140 [2024-11-19 18:27:12,299 INFO L226 Difference]: Without dead ends: 9216 [2024-11-19 18:27:12,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:12,305 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:12,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 426 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:27:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2024-11-19 18:27:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8887. [2024-11-19 18:27:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0481656538374973) internal successors, (9314), 8886 states have internal predecessors, (9314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9314 transitions. [2024-11-19 18:27:12,394 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9314 transitions. Word has length 640 [2024-11-19 18:27:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:12,395 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9314 transitions. [2024-11-19 18:27:12,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9314 transitions. [2024-11-19 18:27:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2024-11-19 18:27:12,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:12,403 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:12,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 18:27:12,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:12,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1262186544, now seen corresponding path program 1 times [2024-11-19 18:27:12,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:12,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406602846] [2024-11-19 18:27:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 997 backedges. 769 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-19 18:27:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:12,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406602846] [2024-11-19 18:27:12,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406602846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:12,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:12,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:12,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257457001] [2024-11-19 18:27:12,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:12,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:12,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:12,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:12,732 INFO L87 Difference]: Start difference. First operand 8887 states and 9314 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:13,459 INFO L93 Difference]: Finished difference Result 20404 states and 21512 transitions. [2024-11-19 18:27:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:13,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 703 [2024-11-19 18:27:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:13,480 INFO L225 Difference]: With dead ends: 20404 [2024-11-19 18:27:13,480 INFO L226 Difference]: Without dead ends: 11848 [2024-11-19 18:27:13,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:13,489 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 186 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:13,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 55 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:27:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2024-11-19 18:27:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11848. [2024-11-19 18:27:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0506457330969865) internal successors, (12447), 11847 states have internal predecessors, (12447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12447 transitions. [2024-11-19 18:27:13,702 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12447 transitions. Word has length 703 [2024-11-19 18:27:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:13,703 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12447 transitions. [2024-11-19 18:27:13,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12447 transitions. [2024-11-19 18:27:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2024-11-19 18:27:13,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:13,718 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 18:27:13,718 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1525801733, now seen corresponding path program 1 times [2024-11-19 18:27:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134620254] [2024-11-19 18:27:13,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2043 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2024-11-19 18:27:14,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:14,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134620254] [2024-11-19 18:27:14,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134620254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:14,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:14,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:27:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524864748] [2024-11-19 18:27:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:14,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:14,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:14,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:14,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:14,757 INFO L87 Difference]: Start difference. First operand 11848 states and 12447 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 2 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:15,451 INFO L93 Difference]: Finished difference Result 23694 states and 24898 transitions. [2024-11-19 18:27:15,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:15,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 2 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 993 [2024-11-19 18:27:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:15,466 INFO L225 Difference]: With dead ends: 23694 [2024-11-19 18:27:15,466 INFO L226 Difference]: Without dead ends: 12177 [2024-11-19 18:27:15,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:15,476 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:15,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 102 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:27:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2024-11-19 18:27:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2024-11-19 18:27:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0498521681997373) internal successors, (12783), 12176 states have internal predecessors, (12783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12783 transitions. [2024-11-19 18:27:15,578 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12783 transitions. Word has length 993 [2024-11-19 18:27:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:15,579 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12783 transitions. [2024-11-19 18:27:15,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 2 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12783 transitions. [2024-11-19 18:27:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2024-11-19 18:27:15,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:15,591 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:15,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 18:27:15,591 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:15,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash 547079911, now seen corresponding path program 1 times [2024-11-19 18:27:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:15,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794451657] [2024-11-19 18:27:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2051 backedges. 1450 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-19 18:27:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:16,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794451657] [2024-11-19 18:27:16,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794451657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:16,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:16,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:16,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823093017] [2024-11-19 18:27:16,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:16,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:16,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:16,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:16,104 INFO L87 Difference]: Start difference. First operand 12177 states and 12783 transitions. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:16,804 INFO L93 Difference]: Finished difference Result 26655 states and 28127 transitions. [2024-11-19 18:27:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:16,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1001 [2024-11-19 18:27:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:16,830 INFO L225 Difference]: With dead ends: 26655 [2024-11-19 18:27:16,831 INFO L226 Difference]: Without dead ends: 15138 [2024-11-19 18:27:16,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:16,842 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:16,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 434 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:27:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2024-11-19 18:27:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 14480. [2024-11-19 18:27:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.046135782857932) internal successors, (15147), 14479 states have internal predecessors, (15147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15147 transitions. [2024-11-19 18:27:16,977 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15147 transitions. Word has length 1001 [2024-11-19 18:27:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:16,978 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15147 transitions. [2024-11-19 18:27:16,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15147 transitions. [2024-11-19 18:27:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2024-11-19 18:27:16,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:16,992 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:16,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 18:27:16,993 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1559765063, now seen corresponding path program 1 times [2024-11-19 18:27:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363537966] [2024-11-19 18:27:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 558 proven. 734 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-19 18:27:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:18,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363537966] [2024-11-19 18:27:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363537966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:27:18,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329503391] [2024-11-19 18:27:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:18,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:27:18,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:27:18,211 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-19 18:27:18,212 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-19 18:27:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:18,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 18:27:18,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:27:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 860 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 18:27:18,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:27:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329503391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:18,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:27:18,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-19 18:27:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471297811] [2024-11-19 18:27:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:18,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:18,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:18,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:18,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:27:18,821 INFO L87 Difference]: Start difference. First operand 14480 states and 15147 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:19,529 INFO L93 Difference]: Finished difference Result 28300 states and 29625 transitions. [2024-11-19 18:27:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:19,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1011 [2024-11-19 18:27:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:19,545 INFO L225 Difference]: With dead ends: 28300 [2024-11-19 18:27:19,545 INFO L226 Difference]: Without dead ends: 14480 [2024-11-19 18:27:19,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 1011 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:27:19,555 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 95 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:19,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:27:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2024-11-19 18:27:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2024-11-19 18:27:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0414393259202983) internal successors, (15079), 14479 states have internal predecessors, (15079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15079 transitions. [2024-11-19 18:27:19,665 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15079 transitions. Word has length 1011 [2024-11-19 18:27:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:19,666 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15079 transitions. [2024-11-19 18:27:19,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15079 transitions. [2024-11-19 18:27:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2024-11-19 18:27:19,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:19,680 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:19,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 18:27:19,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 18:27:19,885 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:19,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:19,886 INFO L85 PathProgramCache]: Analyzing trace with hash -935061708, now seen corresponding path program 1 times [2024-11-19 18:27:19,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:19,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738988033] [2024-11-19 18:27:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2638 backedges. 1842 proven. 0 refuted. 0 times theorem prover too weak. 796 trivial. 0 not checked. [2024-11-19 18:27:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738988033] [2024-11-19 18:27:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738988033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:20,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:20,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116620951] [2024-11-19 18:27:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:20,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:20,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:20,529 INFO L87 Difference]: Start difference. First operand 14480 states and 15079 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:21,260 INFO L93 Difference]: Finished difference Result 28300 states and 29489 transitions. [2024-11-19 18:27:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:21,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1147 [2024-11-19 18:27:21,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:21,282 INFO L225 Difference]: With dead ends: 28300 [2024-11-19 18:27:21,283 INFO L226 Difference]: Without dead ends: 14480 [2024-11-19 18:27:21,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:21,293 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:21,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 429 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:27:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2024-11-19 18:27:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 13493. [2024-11-19 18:27:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0286095463978655) internal successors, (13878), 13492 states have internal predecessors, (13878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13878 transitions. [2024-11-19 18:27:21,402 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13878 transitions. Word has length 1147 [2024-11-19 18:27:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:21,402 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13878 transitions. [2024-11-19 18:27:21,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13878 transitions. [2024-11-19 18:27:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1149 [2024-11-19 18:27:21,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:21,416 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:21,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 18:27:21,416 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:21,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1181890491, now seen corresponding path program 1 times [2024-11-19 18:27:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:21,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072357267] [2024-11-19 18:27:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2644 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-11-19 18:27:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072357267] [2024-11-19 18:27:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072357267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:21,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300184358] [2024-11-19 18:27:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:21,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:21,929 INFO L87 Difference]: Start difference. First operand 13493 states and 13878 transitions. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:22,552 INFO L93 Difference]: Finished difference Result 28958 states and 29852 transitions. [2024-11-19 18:27:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:22,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1148 [2024-11-19 18:27:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:22,567 INFO L225 Difference]: With dead ends: 28958 [2024-11-19 18:27:22,567 INFO L226 Difference]: Without dead ends: 14480 [2024-11-19 18:27:22,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:22,576 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 273 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:22,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 412 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:27:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2024-11-19 18:27:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 12177. [2024-11-19 18:27:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0271846254927726) internal successors, (12507), 12176 states have internal predecessors, (12507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12507 transitions. [2024-11-19 18:27:22,672 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12507 transitions. Word has length 1148 [2024-11-19 18:27:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:22,672 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12507 transitions. [2024-11-19 18:27:22,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12507 transitions. [2024-11-19 18:27:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1291 [2024-11-19 18:27:22,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:22,689 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:22,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 18:27:22,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:22,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash 152336790, now seen corresponding path program 1 times [2024-11-19 18:27:22,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:22,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082802742] [2024-11-19 18:27:22,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:22,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2828 backedges. 2015 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2024-11-19 18:27:24,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:24,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082802742] [2024-11-19 18:27:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082802742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:24,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:24,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 18:27:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231285027] [2024-11-19 18:27:24,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:24,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:27:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:24,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:27:24,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:27:24,060 INFO L87 Difference]: Start difference. First operand 12177 states and 12507 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:25,083 INFO L93 Difference]: Finished difference Result 23703 states and 24354 transitions. [2024-11-19 18:27:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 18:27:25,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1290 [2024-11-19 18:27:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:25,093 INFO L225 Difference]: With dead ends: 23703 [2024-11-19 18:27:25,094 INFO L226 Difference]: Without dead ends: 12186 [2024-11-19 18:27:25,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:27:25,100 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:25,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 436 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 18:27:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12186 states. [2024-11-19 18:27:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12186 to 12177. [2024-11-19 18:27:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0270203679369252) internal successors, (12505), 12176 states have internal predecessors, (12505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12505 transitions. [2024-11-19 18:27:25,179 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12505 transitions. Word has length 1290 [2024-11-19 18:27:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:25,180 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12505 transitions. [2024-11-19 18:27:25,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12505 transitions. [2024-11-19 18:27:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2024-11-19 18:27:25,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:25,193 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:25,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 18:27:25,193 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:25,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1605891050, now seen corresponding path program 1 times [2024-11-19 18:27:25,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:25,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828623631] [2024-11-19 18:27:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3669 backedges. 2182 proven. 0 refuted. 0 times theorem prover too weak. 1487 trivial. 0 not checked. [2024-11-19 18:27:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828623631] [2024-11-19 18:27:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828623631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:26,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:26,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884099308] [2024-11-19 18:27:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:26,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:26,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:26,100 INFO L87 Difference]: Start difference. First operand 12177 states and 12505 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:26,820 INFO L93 Difference]: Finished difference Result 24352 states and 25010 transitions. [2024-11-19 18:27:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:26,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1305 [2024-11-19 18:27:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:26,832 INFO L225 Difference]: With dead ends: 24352 [2024-11-19 18:27:26,832 INFO L226 Difference]: Without dead ends: 12835 [2024-11-19 18:27:26,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:26,841 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:26,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 430 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:27:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2024-11-19 18:27:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12835. [2024-11-19 18:27:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0260246220975533) internal successors, (13168), 12834 states have internal predecessors, (13168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13168 transitions. [2024-11-19 18:27:26,935 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13168 transitions. Word has length 1305 [2024-11-19 18:27:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:26,936 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13168 transitions. [2024-11-19 18:27:26,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13168 transitions. [2024-11-19 18:27:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1331 [2024-11-19 18:27:26,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:26,949 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 18:27:26,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:26,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash -123475115, now seen corresponding path program 1 times [2024-11-19 18:27:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:26,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642400129] [2024-11-19 18:27:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3207 backedges. 2224 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2024-11-19 18:27:27,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:27,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642400129] [2024-11-19 18:27:27,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642400129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:27,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:27,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 18:27:27,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683288891] [2024-11-19 18:27:27,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:27,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:27:27,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:27:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:27:27,860 INFO L87 Difference]: Start difference. First operand 12835 states and 13168 transitions. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:28,705 INFO L93 Difference]: Finished difference Result 25339 states and 26007 transitions. [2024-11-19 18:27:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:27:28,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1330 [2024-11-19 18:27:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:28,717 INFO L225 Difference]: With dead ends: 25339 [2024-11-19 18:27:28,717 INFO L226 Difference]: Without dead ends: 13164 [2024-11-19 18:27:28,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:27:28,725 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:28,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 553 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 18:27:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-19 18:27:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2024-11-19 18:27:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0254501253513637) internal successors, (13498), 13163 states have internal predecessors, (13498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13498 transitions. [2024-11-19 18:27:28,809 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13498 transitions. Word has length 1330 [2024-11-19 18:27:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:28,810 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13498 transitions. [2024-11-19 18:27:28,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13498 transitions. [2024-11-19 18:27:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2024-11-19 18:27:28,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:28,823 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 18:27:28,823 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1066822895, now seen corresponding path program 1 times [2024-11-19 18:27:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213717923] [2024-11-19 18:27:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3688 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2024-11-19 18:27:30,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:30,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213717923] [2024-11-19 18:27:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213717923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:30,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142644140] [2024-11-19 18:27:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:30,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:30,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:30,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:30,080 INFO L87 Difference]: Start difference. First operand 13164 states and 13498 transitions. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:30,797 INFO L93 Difference]: Finished difference Result 25997 states and 26663 transitions. [2024-11-19 18:27:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:30,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1359 [2024-11-19 18:27:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:30,807 INFO L225 Difference]: With dead ends: 25997 [2024-11-19 18:27:30,807 INFO L226 Difference]: Without dead ends: 13164 [2024-11-19 18:27:30,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:30,812 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 269 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:30,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 370 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:27:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-19 18:27:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12506. [2024-11-19 18:27:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0215113954418233) internal successors, (12774), 12505 states have internal predecessors, (12774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12774 transitions. [2024-11-19 18:27:30,893 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12774 transitions. Word has length 1359 [2024-11-19 18:27:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:30,894 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12774 transitions. [2024-11-19 18:27:30,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12774 transitions. [2024-11-19 18:27:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1711 [2024-11-19 18:27:30,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:30,911 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:30,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 18:27:30,912 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:30,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash -500378405, now seen corresponding path program 1 times [2024-11-19 18:27:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:30,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162938065] [2024-11-19 18:27:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5335 backedges. 3482 proven. 202 refuted. 0 times theorem prover too weak. 1651 trivial. 0 not checked. [2024-11-19 18:27:32,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162938065] [2024-11-19 18:27:32,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162938065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:27:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111381189] [2024-11-19 18:27:32,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:32,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:27:32,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:27:32,149 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-19 18:27:32,158 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-19 18:27:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:32,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 1960 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 18:27:32,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:27:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5335 backedges. 2342 proven. 201 refuted. 0 times theorem prover too weak. 2792 trivial. 0 not checked. [2024-11-19 18:27:34,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 18:27:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5335 backedges. 2342 proven. 201 refuted. 0 times theorem prover too weak. 2792 trivial. 0 not checked. [2024-11-19 18:27:38,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111381189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 18:27:38,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 18:27:38,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-11-19 18:27:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129054012] [2024-11-19 18:27:38,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 18:27:38,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 18:27:38,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:38,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 18:27:38,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-19 18:27:38,445 INFO L87 Difference]: Start difference. First operand 12506 states and 12774 transitions. Second operand has 10 states, 10 states have (on average 174.7) internal successors, (1747), 9 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:42,183 INFO L93 Difference]: Finished difference Result 25010 states and 25548 transitions. [2024-11-19 18:27:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 18:27:42,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 174.7) internal successors, (1747), 9 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1710 [2024-11-19 18:27:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:42,197 INFO L225 Difference]: With dead ends: 25010 [2024-11-19 18:27:42,197 INFO L226 Difference]: Without dead ends: 13164 [2024-11-19 18:27:42,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3429 GetRequests, 3415 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-11-19 18:27:42,206 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1658 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6451 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 6589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 6451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:42,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 89 Invalid, 6589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 6451 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-19 18:27:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-19 18:27:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12835. [2024-11-19 18:27:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0180769830138694) internal successors, (13066), 12834 states have internal predecessors, (13066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13066 transitions. [2024-11-19 18:27:42,298 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13066 transitions. Word has length 1710 [2024-11-19 18:27:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:42,298 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13066 transitions. [2024-11-19 18:27:42,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 174.7) internal successors, (1747), 9 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13066 transitions. [2024-11-19 18:27:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1766 [2024-11-19 18:27:42,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:42,317 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:42,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 18:27:42,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:27:42,521 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:42,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1831347317, now seen corresponding path program 1 times [2024-11-19 18:27:42,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:42,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730616707] [2024-11-19 18:27:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6191 backedges. 2510 proven. 0 refuted. 0 times theorem prover too weak. 3681 trivial. 0 not checked. [2024-11-19 18:27:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730616707] [2024-11-19 18:27:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730616707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:43,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:43,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846003412] [2024-11-19 18:27:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:43,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:27:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:43,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:27:43,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:27:43,779 INFO L87 Difference]: Start difference. First operand 12835 states and 13066 transitions. Second operand has 4 states, 4 states have (on average 168.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:44,448 INFO L93 Difference]: Finished difference Result 25668 states and 26133 transitions. [2024-11-19 18:27:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:44,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 168.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1765 [2024-11-19 18:27:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:44,458 INFO L225 Difference]: With dead ends: 25668 [2024-11-19 18:27:44,459 INFO L226 Difference]: Without dead ends: 13164 [2024-11-19 18:27:44,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:27:44,467 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:44,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 97 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:27:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-19 18:27:44,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2024-11-19 18:27:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0177771024842361) internal successors, (13397), 13163 states have internal predecessors, (13397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13397 transitions. [2024-11-19 18:27:44,556 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13397 transitions. Word has length 1765 [2024-11-19 18:27:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:44,556 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13397 transitions. [2024-11-19 18:27:44,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13397 transitions. [2024-11-19 18:27:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1829 [2024-11-19 18:27:44,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:44,575 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:44,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 18:27:44,575 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:44,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1452463880, now seen corresponding path program 1 times [2024-11-19 18:27:44,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:44,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365533633] [2024-11-19 18:27:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6446 backedges. 3969 proven. 1226 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2024-11-19 18:27:47,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365533633] [2024-11-19 18:27:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365533633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:27:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779937413] [2024-11-19 18:27:47,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:47,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:27:47,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:27:47,486 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-19 18:27:47,487 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-19 18:27:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:47,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 2099 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 18:27:47,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:27:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6446 backedges. 4252 proven. 0 refuted. 0 times theorem prover too weak. 2194 trivial. 0 not checked. [2024-11-19 18:27:48,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:27:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779937413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:27:48,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-19 18:27:48,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084219650] [2024-11-19 18:27:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:48,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:48,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 18:27:48,091 INFO L87 Difference]: Start difference. First operand 13164 states and 13397 transitions. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:48,731 INFO L93 Difference]: Finished difference Result 25668 states and 26130 transitions. [2024-11-19 18:27:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1828 [2024-11-19 18:27:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:48,745 INFO L225 Difference]: With dead ends: 25668 [2024-11-19 18:27:48,745 INFO L226 Difference]: Without dead ends: 13164 [2024-11-19 18:27:48,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1836 GetRequests, 1830 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 18:27:48,753 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 65 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:48,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 410 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:27:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-19 18:27:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2024-11-19 18:27:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.016257692015498) internal successors, (13377), 13163 states have internal predecessors, (13377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13377 transitions. [2024-11-19 18:27:48,845 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13377 transitions. Word has length 1828 [2024-11-19 18:27:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:48,846 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13377 transitions. [2024-11-19 18:27:48,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13377 transitions. [2024-11-19 18:27:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1913 [2024-11-19 18:27:48,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:48,866 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:48,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 18:27:49,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:27:49,071 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:49,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1437118187, now seen corresponding path program 1 times [2024-11-19 18:27:49,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:49,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780590790] [2024-11-19 18:27:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:49,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7925 backedges. 4713 proven. 156 refuted. 0 times theorem prover too weak. 3056 trivial. 0 not checked. [2024-11-19 18:27:51,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:51,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780590790] [2024-11-19 18:27:51,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780590790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:27:51,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960390087] [2024-11-19 18:27:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:51,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:27:51,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:27:51,415 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-19 18:27:51,416 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-19 18:27:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:51,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 18:27:51,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:27:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7925 backedges. 4752 proven. 0 refuted. 0 times theorem prover too weak. 3173 trivial. 0 not checked. [2024-11-19 18:27:52,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:27:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960390087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:27:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-19 18:27:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866822316] [2024-11-19 18:27:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:52,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:52,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:27:52,242 INFO L87 Difference]: Start difference. First operand 13164 states and 13377 transitions. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:52,946 INFO L93 Difference]: Finished difference Result 25668 states and 26090 transitions. [2024-11-19 18:27:52,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:52,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1912 [2024-11-19 18:27:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:52,958 INFO L225 Difference]: With dead ends: 25668 [2024-11-19 18:27:52,959 INFO L226 Difference]: Without dead ends: 13164 [2024-11-19 18:27:52,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1919 GetRequests, 1915 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:27:52,967 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:52,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 424 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 18:27:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-19 18:27:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2024-11-19 18:27:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0159538099217504) internal successors, (13373), 13163 states have internal predecessors, (13373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13373 transitions. [2024-11-19 18:27:53,067 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13373 transitions. Word has length 1912 [2024-11-19 18:27:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:53,068 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13373 transitions. [2024-11-19 18:27:53,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13373 transitions. [2024-11-19 18:27:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1934 [2024-11-19 18:27:53,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:53,089 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:53,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 18:27:53,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:27:53,294 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:53,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash 390685501, now seen corresponding path program 1 times [2024-11-19 18:27:53,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:53,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759418949] [2024-11-19 18:27:53,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7653 backedges. 3734 proven. 0 refuted. 0 times theorem prover too weak. 3919 trivial. 0 not checked. [2024-11-19 18:27:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759418949] [2024-11-19 18:27:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759418949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:54,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:27:54,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:27:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073135102] [2024-11-19 18:27:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:54,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:54,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:54,813 INFO L87 Difference]: Start difference. First operand 13164 states and 13373 transitions. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:55,530 INFO L93 Difference]: Finished difference Result 29287 states and 29763 transitions. [2024-11-19 18:27:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1933 [2024-11-19 18:27:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:55,544 INFO L225 Difference]: With dead ends: 29287 [2024-11-19 18:27:55,544 INFO L226 Difference]: Without dead ends: 16783 [2024-11-19 18:27:55,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:27:55,553 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 209 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:55,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 48 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 18:27:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2024-11-19 18:27:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 13493. [2024-11-19 18:27:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0167506670619626) internal successors, (13718), 13492 states have internal predecessors, (13718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13718 transitions. [2024-11-19 18:27:55,659 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13718 transitions. Word has length 1933 [2024-11-19 18:27:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:55,659 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13718 transitions. [2024-11-19 18:27:55,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13718 transitions. [2024-11-19 18:27:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1975 [2024-11-19 18:27:55,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:27:55,680 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:55,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 18:27:55,680 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:27:55,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:27:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1060738857, now seen corresponding path program 1 times [2024-11-19 18:27:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:27:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020471970] [2024-11-19 18:27:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:27:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8480 backedges. 6279 proven. 78 refuted. 0 times theorem prover too weak. 2123 trivial. 0 not checked. [2024-11-19 18:27:57,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:27:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020471970] [2024-11-19 18:27:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020471970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:27:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129914133] [2024-11-19 18:27:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:27:57,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:27:57,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:27:57,597 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-19 18:27:57,598 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-19 18:27:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:27:57,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 2293 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 18:27:58,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:27:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8480 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 7749 trivial. 0 not checked. [2024-11-19 18:27:58,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:27:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129914133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:27:58,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:27:58,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-19 18:27:58,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647391720] [2024-11-19 18:27:58,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:27:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:27:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:27:58,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:27:58,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 18:27:58,170 INFO L87 Difference]: Start difference. First operand 13493 states and 13718 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:27:59,056 INFO L93 Difference]: Finished difference Result 31588 states and 32114 transitions. [2024-11-19 18:27:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:27:59,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1974 [2024-11-19 18:27:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:27:59,058 INFO L225 Difference]: With dead ends: 31588 [2024-11-19 18:27:59,058 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 18:27:59,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1979 GetRequests, 1974 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 18:27:59,069 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 271 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:27:59,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 407 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 18:27:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 18:27:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 18:27:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 18:27:59,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1974 [2024-11-19 18:27:59,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:27:59,070 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 18:27:59,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:27:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 18:27:59,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 18:27:59,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 18:27:59,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 18:27:59,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 18:27:59,280 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:27:59,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 18:28:00,097 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 18:28:00,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:28:00 BoogieIcfgContainer [2024-11-19 18:28:00,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 18:28:00,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 18:28:00,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 18:28:00,113 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 18:28:00,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:27:01" (3/4) ... [2024-11-19 18:28:00,115 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 18:28:00,150 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-19 18:28:00,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 18:28:00,153 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 18:28:00,155 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 18:28:00,352 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 18:28:00,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 18:28:00,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 18:28:00,353 INFO L158 Benchmark]: Toolchain (without parser) took 62006.28ms. Allocated memory was 207.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 174.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-19 18:28:00,354 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 18:28:00,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.60ms. Allocated memory is still 207.6MB. Free memory was 174.4MB in the beginning and 110.6MB in the end (delta: 63.8MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-19 18:28:00,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 201.50ms. Allocated memory is still 207.6MB. Free memory was 110.6MB in the beginning and 151.7MB in the end (delta: -41.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 18:28:00,354 INFO L158 Benchmark]: Boogie Preprocessor took 187.61ms. Allocated memory is still 207.6MB. Free memory was 151.7MB in the beginning and 117.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-19 18:28:00,355 INFO L158 Benchmark]: RCFGBuilder took 1937.65ms. Allocated memory was 207.6MB in the beginning and 339.7MB in the end (delta: 132.1MB). Free memory was 117.1MB in the beginning and 277.4MB in the end (delta: -160.4MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. [2024-11-19 18:28:00,355 INFO L158 Benchmark]: TraceAbstraction took 58698.62ms. Allocated memory was 339.7MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 276.4MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 954.9MB. Max. memory is 16.1GB. [2024-11-19 18:28:00,356 INFO L158 Benchmark]: Witness Printer took 240.23ms. Allocated memory is still 2.6GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 18:28:00,357 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.16ms. Allocated memory is still 134.2MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.60ms. Allocated memory is still 207.6MB. Free memory was 174.4MB in the beginning and 110.6MB in the end (delta: 63.8MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 201.50ms. Allocated memory is still 207.6MB. Free memory was 110.6MB in the beginning and 151.7MB in the end (delta: -41.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 187.61ms. Allocated memory is still 207.6MB. Free memory was 151.7MB in the beginning and 117.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1937.65ms. Allocated memory was 207.6MB in the beginning and 339.7MB in the end (delta: 132.1MB). Free memory was 117.1MB in the beginning and 277.4MB in the end (delta: -160.4MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. * TraceAbstraction took 58698.62ms. Allocated memory was 339.7MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 276.4MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 954.9MB. Max. memory is 16.1GB. * Witness Printer took 240.23ms. Allocated memory is still 2.6GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.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 - PositiveResult [Line: 206]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.8s, OverallIterations: 24, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6661 SdHoareTripleChecker+Valid, 21.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6661 mSDsluCounter, 6900 SdHoareTripleChecker+Invalid, 17.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 2471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26016 IncrementalHoareTripleChecker+Invalid, 28487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2471 mSolverCounterUnsat, 6554 mSDtfsCounter, 26016 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10239 GetRequests, 10180 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14480occurred in iteration=11, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 8565 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 33327 NumberOfCodeBlocks, 33327 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 35007 ConstructedInterpolants, 0 QuantifiedInterpolants, 90569 SizeOfPredicates, 2 NumberOfNonLiveVariables, 9721 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 30 InterpolantComputations, 23 PerfectInterpolantSequences, 102470/105268 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a16 == 9) && (7 == a12)) || ((((a12 <= 5) && (a16 == 12)) && ((5 != a12) || (0 < ((long long) a18 + 156)))) && (a15 == 3))) || (((a12 == 6) && (a16 <= 11)) && (a15 == 3))) || ((((a16 == 11) && (5 == a12)) && (((long long) 87 + a18) == 0)) && (a15 == 3))) || ((((a16 <= 8) && (7 <= a18)) && (a12 == 8)) && (a18 <= 132))) || ((a12 == 9) && (a16 == 9))) || ((a16 <= 8) && (a12 == 9))) || (((a12 == 8) && (a16 == 12)) && (a15 == 3))) || (((a16 <= 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || (((a12 == 6) && (a16 <= 11)) && (4 <= a15))) || ((a12 <= 5) && (a16 == 9))) || (((a16 == 9) && (a15 <= 3)) && (a12 == 8))) || (((a12 <= 5) && (a16 <= 11)) && (4 <= a15))) || (((a12 == 9) && (a16 == 12)) && (a15 == 3))) || (((((a12 <= 5) && (7 <= a18)) && (a18 <= 132)) && (a16 <= 11)) && (a15 == 3))) || (((a16 == 9) && (a12 == 8)) && (a18 <= 132))) || (((a12 == 8) && (a16 <= 11)) && (a15 == 3))) || ((a16 <= 8) && (a15 <= 3))) || (((a12 == 9) && (a16 <= 11)) && (a15 == 3))) || (((a12 == 6) && (a16 == 12)) && (a15 == 3))) || ((a16 <= 8) && (7 == a12))) || ((((a16 == 12) && (a18 <= 132)) && (a15 == 3)) && (7 == a12))) || (((a16 <= 11) && (a15 == 3)) && (7 == a12))) RESULT: Ultimate proved your program to be correct! [2024-11-19 18:28:00,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE