./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label35.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 bf2e434ddb1157766f0427b524597e37ed925d60033c6d19795be6a9bcd22934 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:22:14,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:22:14,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:22:14,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:22:14,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:22:14,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:22:14,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:22:14,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:22:14,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:22:14,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:22:14,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:22:14,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:22:14,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:22:14,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:22:14,371 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:22:14,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:22:14,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:22:14,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:22:14,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:22:14,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:22:14,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:22:14,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:22:14,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:22:14,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:22:14,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:22:14,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:22:14,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:22:14,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:22:14,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:22:14,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:22:14,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:22:14,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:22:14,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:22:14,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:22:14,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:22:14,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:22:14,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:22:14,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:22:14,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:22:14,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:22:14,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:22:14,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:22:14,385 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 -> bf2e434ddb1157766f0427b524597e37ed925d60033c6d19795be6a9bcd22934 [2024-11-08 11:22:14,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:22:14,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:22:14,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:22:14,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:22:14,672 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:22:14,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label35.c [2024-11-08 11:22:16,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:22:16,624 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:22:16,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label35.c [2024-11-08 11:22:16,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1ca5310/1aa6c44ad4074e68878e9101e83d0226/FLAGcac2e909d [2024-11-08 11:22:16,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1ca5310/1aa6c44ad4074e68878e9101e83d0226 [2024-11-08 11:22:16,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:22:16,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:22:16,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:22:16,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:22:16,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:22:16,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:22:16" (1/1) ... [2024-11-08 11:22:16,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d65dc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:16, skipping insertion in model container [2024-11-08 11:22:16,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:22:16" (1/1) ... [2024-11-08 11:22:16,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:22:17,099 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/Problem13_label35.c[1793,1806] [2024-11-08 11:22:17,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:22:18,002 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:22:18,021 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/Problem13_label35.c[1793,1806] [2024-11-08 11:22:18,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:22:18,578 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:22:18,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18 WrapperNode [2024-11-08 11:22:18,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:22:18,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:22:18,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:22:18,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:22:18,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:18,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,138 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-08 11:22:19,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:22:19,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:22:19,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:22:19,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:22:19,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,490 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:22:19,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:22:19,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:22:19,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:22:19,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:22:19,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (1/1) ... [2024-11-08 11:22:19,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:22:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:22:19,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:22:19,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:22:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:22:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:22:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:22:19,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:22:19,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:22:20,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:22:25,493 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-08 11:22:25,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:22:25,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:22:25,535 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:22:25,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:22:25 BoogieIcfgContainer [2024-11-08 11:22:25,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:22:25,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:22:25,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:22:25,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:22:25,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:22:16" (1/3) ... [2024-11-08 11:22:25,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5764ecd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:22:25, skipping insertion in model container [2024-11-08 11:22:25,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:18" (2/3) ... [2024-11-08 11:22:25,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5764ecd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:22:25, skipping insertion in model container [2024-11-08 11:22:25,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:22:25" (3/3) ... [2024-11-08 11:22:25,545 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label35.c [2024-11-08 11:22:25,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:22:25,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:22:25,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:22:25,678 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;@7d011fe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:22:25,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:22:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 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-08 11:22:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 11:22:25,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:25,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:25,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1417350502, now seen corresponding path program 1 times [2024-11-08 11:22:25,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:25,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711566802] [2024-11-08 11:22:25,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:25,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711566802] [2024-11-08 11:22:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711566802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148350012] [2024-11-08 11:22:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:25,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:25,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:25,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:25,951 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-08 11:22:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:30,477 INFO L93 Difference]: Finished difference Result 3160 states and 5843 transitions. [2024-11-08 11:22:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:30,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-11-08 11:22:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:30,512 INFO L225 Difference]: With dead ends: 3160 [2024-11-08 11:22:30,512 INFO L226 Difference]: Without dead ends: 1983 [2024-11-08 11:22:30,522 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-08 11:22:30,527 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1093 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:30,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 340 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-08 11:22:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-08 11:22:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2024-11-08 11:22:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 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-08 11:22:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2024-11-08 11:22:30,672 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 10 [2024-11-08 11:22:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:30,672 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2024-11-08 11:22:30,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-08 11:22:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2024-11-08 11:22:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 11:22:30,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:30,676 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 11:22:30,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:22:30,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:30,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2107929182, now seen corresponding path program 1 times [2024-11-08 11:22:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:30,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748482215] [2024-11-08 11:22:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:31,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:31,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748482215] [2024-11-08 11:22:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748482215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:31,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:31,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:31,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220535001] [2024-11-08 11:22:31,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:31,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:31,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:31,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:31,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:31,049 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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-08 11:22:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:34,641 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2024-11-08 11:22:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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 75 [2024-11-08 11:22:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:34,654 INFO L225 Difference]: With dead ends: 5456 [2024-11-08 11:22:34,655 INFO L226 Difference]: Without dead ends: 3528 [2024-11-08 11:22:34,657 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-08 11:22:34,658 INFO L432 NwaCegarLoop]: 855 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:34,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 11:22:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-11-08 11:22:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2024-11-08 11:22:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 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-08 11:22:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2024-11-08 11:22:34,712 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 75 [2024-11-08 11:22:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:34,713 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2024-11-08 11:22:34,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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-08 11:22:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2024-11-08 11:22:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 11:22:34,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:34,716 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 11:22:34,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:22:34,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:34,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash -661621005, now seen corresponding path program 1 times [2024-11-08 11:22:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:34,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315215453] [2024-11-08 11:22:34,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:34,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:34,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:34,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315215453] [2024-11-08 11:22:34,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315215453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:34,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:34,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276109067] [2024-11-08 11:22:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:34,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:34,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:34,896 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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-08 11:22:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:38,058 INFO L93 Difference]: Finished difference Result 10232 states and 16097 transitions. [2024-11-08 11:22:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:38,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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 81 [2024-11-08 11:22:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:38,083 INFO L225 Difference]: With dead ends: 10232 [2024-11-08 11:22:38,083 INFO L226 Difference]: Without dead ends: 6708 [2024-11-08 11:22:38,089 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-08 11:22:38,091 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:38,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 850 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:22:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2024-11-08 11:22:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 6700. [2024-11-08 11:22:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 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-08 11:22:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2024-11-08 11:22:38,200 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 81 [2024-11-08 11:22:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:38,201 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2024-11-08 11:22:38,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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-08 11:22:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2024-11-08 11:22:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 11:22:38,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:38,204 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 11:22:38,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:22:38,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash -533752440, now seen corresponding path program 1 times [2024-11-08 11:22:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:38,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091228066] [2024-11-08 11:22:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:38,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:38,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091228066] [2024-11-08 11:22:38,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091228066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:38,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:38,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:38,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618183216] [2024-11-08 11:22:38,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:38,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:38,406 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-08 11:22:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:42,000 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2024-11-08 11:22:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 111 [2024-11-08 11:22:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:42,045 INFO L225 Difference]: With dead ends: 17443 [2024-11-08 11:22:42,045 INFO L226 Difference]: Without dead ends: 10745 [2024-11-08 11:22:42,056 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-08 11:22:42,057 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:42,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 965 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 11:22:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2024-11-08 11:22:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2024-11-08 11:22:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 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-08 11:22:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2024-11-08 11:22:42,231 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 111 [2024-11-08 11:22:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:42,232 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2024-11-08 11:22:42,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-08 11:22:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2024-11-08 11:22:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 11:22:42,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:42,238 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 11:22:42,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:22:42,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:42,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1357824881, now seen corresponding path program 1 times [2024-11-08 11:22:42,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:42,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291973761] [2024-11-08 11:22:42,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:42,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291973761] [2024-11-08 11:22:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291973761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:42,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:42,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73397108] [2024-11-08 11:22:42,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:42,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:42,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:42,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:42,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:42,412 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-08 11:22:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:45,323 INFO L93 Difference]: Finished difference Result 30031 states and 41242 transitions. [2024-11-08 11:22:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2024-11-08 11:22:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:45,363 INFO L225 Difference]: With dead ends: 30031 [2024-11-08 11:22:45,363 INFO L226 Difference]: Without dead ends: 20151 [2024-11-08 11:22:45,378 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-08 11:22:45,380 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 856 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:45,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1160 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:22:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2024-11-08 11:22:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 18550. [2024-11-08 11:22:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18550 states, 18549 states have (on average 1.252466440239366) internal successors, (23232), 18549 states have internal predecessors, (23232), 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-08 11:22:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18550 states to 18550 states and 23232 transitions. [2024-11-08 11:22:45,729 INFO L78 Accepts]: Start accepts. Automaton has 18550 states and 23232 transitions. Word has length 121 [2024-11-08 11:22:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:45,730 INFO L471 AbstractCegarLoop]: Abstraction has 18550 states and 23232 transitions. [2024-11-08 11:22:45,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-08 11:22:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18550 states and 23232 transitions. [2024-11-08 11:22:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 11:22:45,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:45,732 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 11:22:45,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:22:45,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:45,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash -955704610, now seen corresponding path program 1 times [2024-11-08 11:22:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:45,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875595960] [2024-11-08 11:22:45,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875595960] [2024-11-08 11:22:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875595960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:45,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170904933] [2024-11-08 11:22:45,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:45,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:45,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:45,980 INFO L87 Difference]: Start difference. First operand 18550 states and 23232 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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-08 11:22:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:48,937 INFO L93 Difference]: Finished difference Result 44989 states and 55638 transitions. [2024-11-08 11:22:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:48,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 126 [2024-11-08 11:22:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:48,990 INFO L225 Difference]: With dead ends: 44989 [2024-11-08 11:22:48,990 INFO L226 Difference]: Without dead ends: 26441 [2024-11-08 11:22:49,012 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-08 11:22:49,013 INFO L432 NwaCegarLoop]: 1030 mSDtfsCounter, 730 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:49,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1214 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:22:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26441 states. [2024-11-08 11:22:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26441 to 26434. [2024-11-08 11:22:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26434 states, 26433 states have (on average 1.2007717625695153) internal successors, (31740), 26433 states have internal predecessors, (31740), 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-08 11:22:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26434 states to 26434 states and 31740 transitions. [2024-11-08 11:22:49,528 INFO L78 Accepts]: Start accepts. Automaton has 26434 states and 31740 transitions. Word has length 126 [2024-11-08 11:22:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:49,528 INFO L471 AbstractCegarLoop]: Abstraction has 26434 states and 31740 transitions. [2024-11-08 11:22:49,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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-08 11:22:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26434 states and 31740 transitions. [2024-11-08 11:22:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 11:22:49,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:49,536 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:49,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:22:49,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2104272133, now seen corresponding path program 1 times [2024-11-08 11:22:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127903795] [2024-11-08 11:22:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:49,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127903795] [2024-11-08 11:22:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127903795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23277890] [2024-11-08 11:22:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:49,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:49,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:49,761 INFO L87 Difference]: Start difference. First operand 26434 states and 31740 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-08 11:22:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:53,160 INFO L93 Difference]: Finished difference Result 72535 states and 87976 transitions. [2024-11-08 11:22:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:53,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 224 [2024-11-08 11:22:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:53,227 INFO L225 Difference]: With dead ends: 72535 [2024-11-08 11:22:53,227 INFO L226 Difference]: Without dead ends: 46103 [2024-11-08 11:22:53,256 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-08 11:22:53,257 INFO L432 NwaCegarLoop]: 1847 mSDtfsCounter, 840 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:53,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1984 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:22:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46103 states. [2024-11-08 11:22:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46103 to 42946. [2024-11-08 11:22:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42946 states, 42945 states have (on average 1.17205728257073) internal successors, (50334), 42945 states have internal predecessors, (50334), 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-08 11:22:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42946 states to 42946 states and 50334 transitions. [2024-11-08 11:22:54,047 INFO L78 Accepts]: Start accepts. Automaton has 42946 states and 50334 transitions. Word has length 224 [2024-11-08 11:22:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:54,048 INFO L471 AbstractCegarLoop]: Abstraction has 42946 states and 50334 transitions. [2024-11-08 11:22:54,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-08 11:22:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 42946 states and 50334 transitions. [2024-11-08 11:22:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-08 11:22:54,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:54,055 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:54,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:22:54,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:54,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:54,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2051912356, now seen corresponding path program 1 times [2024-11-08 11:22:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:54,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897965280] [2024-11-08 11:22:54,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 11:22:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:54,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897965280] [2024-11-08 11:22:54,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897965280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:54,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:54,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186385221] [2024-11-08 11:22:54,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:54,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:54,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:54,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:54,559 INFO L87 Difference]: Start difference. First operand 42946 states and 50334 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 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-08 11:22:57,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:57,233 INFO L93 Difference]: Finished difference Result 85103 states and 99869 transitions. [2024-11-08 11:22:57,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:57,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 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 230 [2024-11-08 11:22:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:57,289 INFO L225 Difference]: With dead ends: 85103 [2024-11-08 11:22:57,290 INFO L226 Difference]: Without dead ends: 42946 [2024-11-08 11:22:57,326 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-08 11:22:57,330 INFO L432 NwaCegarLoop]: 1064 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:57,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1193 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:22:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42946 states. [2024-11-08 11:22:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42946 to 42946. [2024-11-08 11:22:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42946 states, 42945 states have (on average 1.1719408545814414) internal successors, (50329), 42945 states have internal predecessors, (50329), 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-08 11:22:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42946 states to 42946 states and 50329 transitions. [2024-11-08 11:22:58,033 INFO L78 Accepts]: Start accepts. Automaton has 42946 states and 50329 transitions. Word has length 230 [2024-11-08 11:22:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:58,034 INFO L471 AbstractCegarLoop]: Abstraction has 42946 states and 50329 transitions. [2024-11-08 11:22:58,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 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-08 11:22:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 42946 states and 50329 transitions. [2024-11-08 11:22:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 11:22:58,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:58,042 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:58,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:22:58,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:58,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash 559254191, now seen corresponding path program 1 times [2024-11-08 11:22:58,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:58,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050460000] [2024-11-08 11:22:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:58,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050460000] [2024-11-08 11:22:58,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050460000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:58,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:58,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:58,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999249382] [2024-11-08 11:22:58,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:58,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:58,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:58,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:58,232 INFO L87 Difference]: Start difference. First operand 42946 states and 50329 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-08 11:23:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:02,016 INFO L93 Difference]: Finished difference Result 104790 states and 124853 transitions. [2024-11-08 11:23:02,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:02,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 237 [2024-11-08 11:23:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:02,087 INFO L225 Difference]: With dead ends: 104790 [2024-11-08 11:23:02,088 INFO L226 Difference]: Without dead ends: 62633 [2024-11-08 11:23:02,111 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-08 11:23:02,112 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 823 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:02,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 930 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 11:23:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62633 states. [2024-11-08 11:23:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62633 to 60261. [2024-11-08 11:23:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60261 states, 60260 states have (on average 1.1628609359442417) internal successors, (70074), 60260 states have internal predecessors, (70074), 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-08 11:23:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60261 states to 60261 states and 70074 transitions. [2024-11-08 11:23:02,738 INFO L78 Accepts]: Start accepts. Automaton has 60261 states and 70074 transitions. Word has length 237 [2024-11-08 11:23:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:02,738 INFO L471 AbstractCegarLoop]: Abstraction has 60261 states and 70074 transitions. [2024-11-08 11:23:02,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-08 11:23:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 60261 states and 70074 transitions. [2024-11-08 11:23:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-08 11:23:02,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:02,744 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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-08 11:23:02,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:23:02,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:02,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1758434701, now seen corresponding path program 1 times [2024-11-08 11:23:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:02,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216985887] [2024-11-08 11:23:02,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:02,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 147 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 11:23:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:04,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216985887] [2024-11-08 11:23:04,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216985887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:23:04,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000366041] [2024-11-08 11:23:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:04,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:23:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:23:04,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:23:04,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:23:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:04,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:23:04,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:23:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 11:23:04,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:23:04,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000366041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:04,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:23:04,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:23:04,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672678804] [2024-11-08 11:23:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:23:04,580 INFO L87 Difference]: Start difference. First operand 60261 states and 70074 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-08 11:23:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:07,391 INFO L93 Difference]: Finished difference Result 119722 states and 139344 transitions. [2024-11-08 11:23:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:07,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 316 [2024-11-08 11:23:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:07,580 INFO L225 Difference]: With dead ends: 119722 [2024-11-08 11:23:07,580 INFO L226 Difference]: Without dead ends: 60250 [2024-11-08 11:23:07,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:23:07,603 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 1075 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:07,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 821 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:23:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60250 states. [2024-11-08 11:23:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60250 to 60247. [2024-11-08 11:23:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60247 states, 60246 states have (on average 1.1198917770474388) internal successors, (67469), 60246 states have internal predecessors, (67469), 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-08 11:23:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60247 states to 60247 states and 67469 transitions. [2024-11-08 11:23:08,216 INFO L78 Accepts]: Start accepts. Automaton has 60247 states and 67469 transitions. Word has length 316 [2024-11-08 11:23:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:08,216 INFO L471 AbstractCegarLoop]: Abstraction has 60247 states and 67469 transitions. [2024-11-08 11:23:08,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-08 11:23:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 60247 states and 67469 transitions. [2024-11-08 11:23:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-08 11:23:08,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:08,222 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:08,241 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-08 11:23:08,426 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,SelfDestructingSolverStorable9 [2024-11-08 11:23:08,427 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:08,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash -949171357, now seen corresponding path program 1 times [2024-11-08 11:23:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:08,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56758132] [2024-11-08 11:23:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:08,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 11:23:08,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:08,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56758132] [2024-11-08 11:23:08,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56758132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:08,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:08,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:08,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961607340] [2024-11-08 11:23:08,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:08,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:08,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:08,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:08,852 INFO L87 Difference]: Start difference. First operand 60247 states and 67469 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-08 11:23:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:12,444 INFO L93 Difference]: Finished difference Result 131500 states and 148742 transitions. [2024-11-08 11:23:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:12,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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 325 [2024-11-08 11:23:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:12,526 INFO L225 Difference]: With dead ends: 131500 [2024-11-08 11:23:12,526 INFO L226 Difference]: Without dead ends: 72042 [2024-11-08 11:23:12,566 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-08 11:23:12,567 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 1145 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:12,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 1522 Invalid, 3159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:23:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72042 states. [2024-11-08 11:23:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72042 to 72041. [2024-11-08 11:23:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72041 states, 72040 states have (on average 1.1067323709050527) internal successors, (79729), 72040 states have internal predecessors, (79729), 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-08 11:23:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72041 states to 72041 states and 79729 transitions. [2024-11-08 11:23:13,380 INFO L78 Accepts]: Start accepts. Automaton has 72041 states and 79729 transitions. Word has length 325 [2024-11-08 11:23:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:13,381 INFO L471 AbstractCegarLoop]: Abstraction has 72041 states and 79729 transitions. [2024-11-08 11:23:13,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-08 11:23:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 72041 states and 79729 transitions. [2024-11-08 11:23:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-08 11:23:13,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:13,386 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:13,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:23:13,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:13,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:13,387 INFO L85 PathProgramCache]: Analyzing trace with hash 240805553, now seen corresponding path program 1 times [2024-11-08 11:23:13,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108127487] [2024-11-08 11:23:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-08 11:23:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108127487] [2024-11-08 11:23:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108127487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350348459] [2024-11-08 11:23:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:13,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:23:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:23:13,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:23:13,822 INFO L87 Difference]: Start difference. First operand 72041 states and 79729 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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-08 11:23:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:19,966 INFO L93 Difference]: Finished difference Result 181243 states and 200566 transitions. [2024-11-08 11:23:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:23:19,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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 358 [2024-11-08 11:23:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:20,088 INFO L225 Difference]: With dead ends: 181243 [2024-11-08 11:23:20,088 INFO L226 Difference]: Without dead ends: 109991 [2024-11-08 11:23:20,113 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-08 11:23:20,113 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 1687 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 5916 mSolverCounterSat, 996 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 6912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 996 IncrementalHoareTripleChecker+Valid, 5916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:20,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 837 Invalid, 6912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [996 Valid, 5916 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-08 11:23:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109991 states. [2024-11-08 11:23:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109991 to 87793. [2024-11-08 11:23:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87793 states, 87792 states have (on average 1.0966375068343357) internal successors, (96276), 87792 states have internal predecessors, (96276), 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-08 11:23:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87793 states to 87793 states and 96276 transitions. [2024-11-08 11:23:21,379 INFO L78 Accepts]: Start accepts. Automaton has 87793 states and 96276 transitions. Word has length 358 [2024-11-08 11:23:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:21,379 INFO L471 AbstractCegarLoop]: Abstraction has 87793 states and 96276 transitions. [2024-11-08 11:23:21,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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-08 11:23:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 87793 states and 96276 transitions. [2024-11-08 11:23:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-08 11:23:21,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:21,388 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:21,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:23:21,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:21,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1615939699, now seen corresponding path program 1 times [2024-11-08 11:23:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:21,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050765231] [2024-11-08 11:23:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 11:23:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050765231] [2024-11-08 11:23:21,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050765231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:21,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:21,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647152528] [2024-11-08 11:23:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:21,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:21,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:21,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:21,637 INFO L87 Difference]: Start difference. First operand 87793 states and 96276 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-08 11:23:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:25,246 INFO L93 Difference]: Finished difference Result 199191 states and 219080 transitions. [2024-11-08 11:23:25,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 371 [2024-11-08 11:23:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:25,385 INFO L225 Difference]: With dead ends: 199191 [2024-11-08 11:23:25,386 INFO L226 Difference]: Without dead ends: 112187 [2024-11-08 11:23:25,413 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-08 11:23:25,413 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 815 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:25,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 835 Invalid, 3312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:23:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112187 states. [2024-11-08 11:23:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112187 to 110599. [2024-11-08 11:23:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110599 states, 110598 states have (on average 1.0884554874410026) internal successors, (120381), 110598 states have internal predecessors, (120381), 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-08 11:23:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110599 states to 110599 states and 120381 transitions. [2024-11-08 11:23:26,699 INFO L78 Accepts]: Start accepts. Automaton has 110599 states and 120381 transitions. Word has length 371 [2024-11-08 11:23:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 110599 states and 120381 transitions. [2024-11-08 11:23:26,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-08 11:23:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 110599 states and 120381 transitions. [2024-11-08 11:23:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2024-11-08 11:23:26,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:26,715 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-08 11:23:26,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:23:26,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:26,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash -459150642, now seen corresponding path program 1 times [2024-11-08 11:23:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:26,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766202081] [2024-11-08 11:23:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-11-08 11:23:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766202081] [2024-11-08 11:23:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766202081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:27,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:27,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489139918] [2024-11-08 11:23:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:27,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:27,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:27,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:27,543 INFO L87 Difference]: Start difference. First operand 110599 states and 120381 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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)