./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.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/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.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 77bdf1fd1feb16a304959a2005739d40d4ccd53f6bcac88343734528a26d2146 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:35:16,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:35:16,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:35:16,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:35:16,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:35:16,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:35:16,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:35:16,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:35:16,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:35:16,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:35:16,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:35:16,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:35:16,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:35:16,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:35:16,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:35:16,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:35:16,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:35:16,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:35:16,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:35:16,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:35:16,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:35:16,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:35:16,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:35:16,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:35:16,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:35:16,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:35:16,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:35:16,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:35:16,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:35:16,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:35:16,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:35:16,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:35:16,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:35:16,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:35:16,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:35:16,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:35:16,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:35:16,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:35:16,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:35:16,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:35:16,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:35:16,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:35:16,470 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 -> 77bdf1fd1feb16a304959a2005739d40d4ccd53f6bcac88343734528a26d2146 [2024-11-08 15:35:16,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:35:16,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:35:16,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:35:16,742 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:35:16,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:35:16,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c [2024-11-08 15:35:18,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:35:18,532 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:35:18,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c [2024-11-08 15:35:18,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e102c80/462330d39bad4d1193338a2d2b528240/FLAGd6f4b9ff3 [2024-11-08 15:35:18,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e102c80/462330d39bad4d1193338a2d2b528240 [2024-11-08 15:35:18,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:35:18,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:35:18,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:35:18,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:35:18,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:35:18,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:35:18" (1/1) ... [2024-11-08 15:35:18,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d07e4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:18, skipping insertion in model container [2024-11-08 15:35:18,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:35:18" (1/1) ... [2024-11-08 15:35:18,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:35:19,127 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/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c[60917,60930] [2024-11-08 15:35:19,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:35:19,146 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:35:19,286 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/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c[60917,60930] [2024-11-08 15:35:19,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:35:19,306 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:35:19,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19 WrapperNode [2024-11-08 15:35:19,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:35:19,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:35:19,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:35:19,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:35:19,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,399 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2050 [2024-11-08 15:35:19,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:35:19,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:35:19,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:35:19,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:35:19,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,475 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 15:35:19,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:35:19,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:35:19,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:35:19,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:35:19,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (1/1) ... [2024-11-08 15:35:19,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:35:19,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:35:19,587 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 15:35:19,590 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 15:35:19,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:35:19,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:35:19,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:35:19,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:35:19,792 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:35:19,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:35:21,678 INFO L? ?]: Removed 235 outVars from TransFormulas that were not future-live. [2024-11-08 15:35:21,679 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:35:21,710 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:35:21,711 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 15:35:21,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:35:21 BoogieIcfgContainer [2024-11-08 15:35:21,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:35:21,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:35:21,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:35:21,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:35:21,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:35:18" (1/3) ... [2024-11-08 15:35:21,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5a8ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:35:21, skipping insertion in model container [2024-11-08 15:35:21,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:35:19" (2/3) ... [2024-11-08 15:35:21,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5a8ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:35:21, skipping insertion in model container [2024-11-08 15:35:21,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:35:21" (3/3) ... [2024-11-08 15:35:21,725 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c [2024-11-08 15:35:21,742 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:35:21,743 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:35:21,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:35:21,851 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;@2f0fb148, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:35:21,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:35:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 666 states, 664 states have (on average 1.8719879518072289) internal successors, (1243), 665 states have internal predecessors, (1243), 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 15:35:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 15:35:21,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:21,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:21,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:21,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -310296854, now seen corresponding path program 1 times [2024-11-08 15:35:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:21,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334596321] [2024-11-08 15:35:21,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:21,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:22,604 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 15:35:22,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334596321] [2024-11-08 15:35:22,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334596321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:22,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:22,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:35:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314557008] [2024-11-08 15:35:22,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:22,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:35:22,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:22,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:35:22,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:35:22,644 INFO L87 Difference]: Start difference. First operand has 666 states, 664 states have (on average 1.8719879518072289) internal successors, (1243), 665 states have internal predecessors, (1243), 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 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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 15:35:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:22,718 INFO L93 Difference]: Finished difference Result 787 states and 1460 transitions. [2024-11-08 15:35:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:35:22,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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 153 [2024-11-08 15:35:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:22,744 INFO L225 Difference]: With dead ends: 787 [2024-11-08 15:35:22,746 INFO L226 Difference]: Without dead ends: 662 [2024-11-08 15:35:22,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:35:22,753 INFO L432 NwaCegarLoop]: 1240 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:22,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:35:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-08 15:35:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-08 15:35:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.8698940998487141) internal successors, (1236), 661 states have internal predecessors, (1236), 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 15:35:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1236 transitions. [2024-11-08 15:35:22,840 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1236 transitions. Word has length 153 [2024-11-08 15:35:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:22,841 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1236 transitions. [2024-11-08 15:35:22,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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 15:35:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1236 transitions. [2024-11-08 15:35:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 15:35:22,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:22,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:22,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:35:22,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:22,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash -819769944, now seen corresponding path program 1 times [2024-11-08 15:35:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:22,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047459692] [2024-11-08 15:35:22,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:22,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:23,478 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 15:35:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047459692] [2024-11-08 15:35:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047459692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:35:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789695742] [2024-11-08 15:35:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:23,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:35:23,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:35:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:35:23,485 INFO L87 Difference]: Start difference. First operand 662 states and 1236 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 15:35:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:23,656 INFO L93 Difference]: Finished difference Result 782 states and 1450 transitions. [2024-11-08 15:35:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:35:23,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 153 [2024-11-08 15:35:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:23,663 INFO L225 Difference]: With dead ends: 782 [2024-11-08 15:35:23,663 INFO L226 Difference]: Without dead ends: 662 [2024-11-08 15:35:23,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:35:23,665 INFO L432 NwaCegarLoop]: 1234 mSDtfsCounter, 0 mSDsluCounter, 3637 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4871 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:23,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4871 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:35:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-08 15:35:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-08 15:35:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.779122541603631) internal successors, (1176), 661 states have internal predecessors, (1176), 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 15:35:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1176 transitions. [2024-11-08 15:35:23,699 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1176 transitions. Word has length 153 [2024-11-08 15:35:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:23,699 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1176 transitions. [2024-11-08 15:35:23,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 15:35:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1176 transitions. [2024-11-08 15:35:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 15:35:23,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:23,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:23,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:35:23,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:23,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1239941969, now seen corresponding path program 1 times [2024-11-08 15:35:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:23,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431192692] [2024-11-08 15:35:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:24,028 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 15:35:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:24,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431192692] [2024-11-08 15:35:24,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431192692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:24,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:24,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:24,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406393863] [2024-11-08 15:35:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:24,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:24,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:24,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:24,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:24,037 INFO L87 Difference]: Start difference. First operand 662 states and 1176 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 15:35:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:24,223 INFO L93 Difference]: Finished difference Result 881 states and 1571 transitions. [2024-11-08 15:35:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2024-11-08 15:35:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:24,229 INFO L225 Difference]: With dead ends: 881 [2024-11-08 15:35:24,229 INFO L226 Difference]: Without dead ends: 765 [2024-11-08 15:35:24,231 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 15:35:24,233 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 177 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:24,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 2287 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:35:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-08 15:35:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 763. [2024-11-08 15:35:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 762 states have (on average 1.7782152230971129) internal successors, (1355), 762 states have internal predecessors, (1355), 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 15:35:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1355 transitions. [2024-11-08 15:35:24,256 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1355 transitions. Word has length 212 [2024-11-08 15:35:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:24,258 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1355 transitions. [2024-11-08 15:35:24,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 15:35:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1355 transitions. [2024-11-08 15:35:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 15:35:24,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:24,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:24,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:35:24,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:24,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1044640645, now seen corresponding path program 1 times [2024-11-08 15:35:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320471967] [2024-11-08 15:35:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:24,569 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 15:35:24,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:24,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320471967] [2024-11-08 15:35:24,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320471967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:24,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:24,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:24,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460613375] [2024-11-08 15:35:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:24,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:24,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:24,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:24,573 INFO L87 Difference]: Start difference. First operand 763 states and 1355 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 15:35:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:24,615 INFO L93 Difference]: Finished difference Result 1175 states and 2091 transitions. [2024-11-08 15:35:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:24,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 216 [2024-11-08 15:35:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:24,621 INFO L225 Difference]: With dead ends: 1175 [2024-11-08 15:35:24,621 INFO L226 Difference]: Without dead ends: 958 [2024-11-08 15:35:24,625 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 15:35:24,626 INFO L432 NwaCegarLoop]: 1174 mSDtfsCounter, 177 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:24,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 2295 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:35:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-11-08 15:35:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 956. [2024-11-08 15:35:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 1.7790575916230367) internal successors, (1699), 955 states have internal predecessors, (1699), 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 15:35:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1699 transitions. [2024-11-08 15:35:24,655 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1699 transitions. Word has length 216 [2024-11-08 15:35:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:24,656 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1699 transitions. [2024-11-08 15:35:24,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 15:35:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1699 transitions. [2024-11-08 15:35:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-08 15:35:24,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:24,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:24,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:35:24,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:24,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1432529271, now seen corresponding path program 1 times [2024-11-08 15:35:24,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:24,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11441708] [2024-11-08 15:35:24,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:24,986 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 15:35:24,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11441708] [2024-11-08 15:35:24,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11441708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:24,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:24,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:24,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826000411] [2024-11-08 15:35:24,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:24,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:24,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:24,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:24,989 INFO L87 Difference]: Start difference. First operand 956 states and 1699 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 15:35:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:25,036 INFO L93 Difference]: Finished difference Result 1732 states and 3081 transitions. [2024-11-08 15:35:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:25,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 220 [2024-11-08 15:35:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:25,042 INFO L225 Difference]: With dead ends: 1732 [2024-11-08 15:35:25,042 INFO L226 Difference]: Without dead ends: 1322 [2024-11-08 15:35:25,043 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 15:35:25,043 INFO L432 NwaCegarLoop]: 1281 mSDtfsCounter, 169 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 2403 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:25,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 2403 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:35:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2024-11-08 15:35:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2024-11-08 15:35:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.7763457164518575) internal successors, (2343), 1319 states have internal predecessors, (2343), 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 15:35:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2343 transitions. [2024-11-08 15:35:25,072 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2343 transitions. Word has length 220 [2024-11-08 15:35:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:25,073 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2343 transitions. [2024-11-08 15:35:25,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 15:35:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2343 transitions. [2024-11-08 15:35:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 15:35:25,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:25,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:25,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:35:25,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:25,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash 567555586, now seen corresponding path program 1 times [2024-11-08 15:35:25,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:25,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012039381] [2024-11-08 15:35:25,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:25,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:25,311 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 15:35:25,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:25,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012039381] [2024-11-08 15:35:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012039381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:25,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:25,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:25,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040660166] [2024-11-08 15:35:25,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:25,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:25,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:25,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:25,316 INFO L87 Difference]: Start difference. First operand 1320 states and 2343 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 15:35:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:25,474 INFO L93 Difference]: Finished difference Result 2137 states and 3795 transitions. [2024-11-08 15:35:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:25,475 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 15:35:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:25,485 INFO L225 Difference]: With dead ends: 2137 [2024-11-08 15:35:25,485 INFO L226 Difference]: Without dead ends: 1727 [2024-11-08 15:35:25,486 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 15:35:25,488 INFO L432 NwaCegarLoop]: 1282 mSDtfsCounter, 170 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:25,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 2435 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:35:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-11-08 15:35:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1725. [2024-11-08 15:35:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1724 states have (on average 1.7708816705336428) internal successors, (3053), 1724 states have internal predecessors, (3053), 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 15:35:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3053 transitions. [2024-11-08 15:35:25,540 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3053 transitions. Word has length 224 [2024-11-08 15:35:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:25,540 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 3053 transitions. [2024-11-08 15:35:25,541 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 15:35:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3053 transitions. [2024-11-08 15:35:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 15:35:25,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:25,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:25,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:35:25,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:25,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1569519721, now seen corresponding path program 1 times [2024-11-08 15:35:25,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:25,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762571768] [2024-11-08 15:35:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:25,865 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 15:35:25,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:25,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762571768] [2024-11-08 15:35:25,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762571768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:25,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:25,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176952733] [2024-11-08 15:35:25,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:25,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:25,868 INFO L87 Difference]: Start difference. First operand 1725 states and 3053 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 15:35:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:25,963 INFO L93 Difference]: Finished difference Result 3821 states and 6755 transitions. [2024-11-08 15:35:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:25,964 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 15:35:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:25,974 INFO L225 Difference]: With dead ends: 3821 [2024-11-08 15:35:25,974 INFO L226 Difference]: Without dead ends: 2707 [2024-11-08 15:35:25,976 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 15:35:25,977 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 161 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:25,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2298 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:35:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2024-11-08 15:35:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2705. [2024-11-08 15:35:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2704 states have (on average 1.7622041420118344) internal successors, (4765), 2704 states have internal predecessors, (4765), 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 15:35:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 4765 transitions. [2024-11-08 15:35:26,046 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 4765 transitions. Word has length 224 [2024-11-08 15:35:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:26,047 INFO L471 AbstractCegarLoop]: Abstraction has 2705 states and 4765 transitions. [2024-11-08 15:35:26,047 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 15:35:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 4765 transitions. [2024-11-08 15:35:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 15:35:26,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:26,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:26,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:35:26,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:26,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:26,053 INFO L85 PathProgramCache]: Analyzing trace with hash -517197085, now seen corresponding path program 1 times [2024-11-08 15:35:26,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:26,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144527424] [2024-11-08 15:35:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:26,309 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 15:35:26,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:26,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144527424] [2024-11-08 15:35:26,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144527424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:26,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:26,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:26,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099160159] [2024-11-08 15:35:26,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:26,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:26,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:26,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:26,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:26,311 INFO L87 Difference]: Start difference. First operand 2705 states and 4765 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 15:35:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:26,379 INFO L93 Difference]: Finished difference Result 6629 states and 11639 transitions. [2024-11-08 15:35:26,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 228 [2024-11-08 15:35:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:26,396 INFO L225 Difference]: With dead ends: 6629 [2024-11-08 15:35:26,397 INFO L226 Difference]: Without dead ends: 4535 [2024-11-08 15:35:26,402 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 15:35:26,404 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 153 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:26,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 2299 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:35:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2024-11-08 15:35:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4533. [2024-11-08 15:35:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4533 states, 4532 states have (on average 1.748676081200353) internal successors, (7925), 4532 states have internal predecessors, (7925), 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 15:35:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 7925 transitions. [2024-11-08 15:35:26,549 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 7925 transitions. Word has length 228 [2024-11-08 15:35:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:26,550 INFO L471 AbstractCegarLoop]: Abstraction has 4533 states and 7925 transitions. [2024-11-08 15:35:26,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 15:35:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 7925 transitions. [2024-11-08 15:35:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-08 15:35:26,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:26,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:26,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:35:26,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:26,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash -630211409, now seen corresponding path program 1 times [2024-11-08 15:35:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:26,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935035867] [2024-11-08 15:35:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:27,092 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 15:35:27,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:27,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935035867] [2024-11-08 15:35:27,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935035867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:27,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:27,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:35:27,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386335031] [2024-11-08 15:35:27,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:27,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:35:27,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:27,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:35:27,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:35:27,096 INFO L87 Difference]: Start difference. First operand 4533 states and 7925 transitions. Second operand has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 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 15:35:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:27,694 INFO L93 Difference]: Finished difference Result 28267 states and 49824 transitions. [2024-11-08 15:35:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:35:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 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 232 [2024-11-08 15:35:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:27,767 INFO L225 Difference]: With dead ends: 28267 [2024-11-08 15:35:27,767 INFO L226 Difference]: Without dead ends: 24345 [2024-11-08 15:35:27,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:35:27,785 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 3189 mSDsluCounter, 7111 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3189 SdHoareTripleChecker+Valid, 8275 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:27,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3189 Valid, 8275 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:35:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24345 states. [2024-11-08 15:35:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24345 to 8331. [2024-11-08 15:35:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8331 states, 8330 states have (on average 1.7451380552220888) internal successors, (14537), 8330 states have internal predecessors, (14537), 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 15:35:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8331 states to 8331 states and 14537 transitions. [2024-11-08 15:35:28,197 INFO L78 Accepts]: Start accepts. Automaton has 8331 states and 14537 transitions. Word has length 232 [2024-11-08 15:35:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:28,198 INFO L471 AbstractCegarLoop]: Abstraction has 8331 states and 14537 transitions. [2024-11-08 15:35:28,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 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 15:35:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8331 states and 14537 transitions. [2024-11-08 15:35:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 15:35:28,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:28,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:28,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:35:28,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:28,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash -328096768, now seen corresponding path program 1 times [2024-11-08 15:35:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:28,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725808303] [2024-11-08 15:35:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:28,542 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 15:35:28,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:28,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725808303] [2024-11-08 15:35:28,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725808303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:28,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:28,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:35:28,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60786395] [2024-11-08 15:35:28,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:28,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:35:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:35:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:35:28,545 INFO L87 Difference]: Start difference. First operand 8331 states and 14537 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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 15:35:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:28,761 INFO L93 Difference]: Finished difference Result 24382 states and 42801 transitions. [2024-11-08 15:35:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:35:28,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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 233 [2024-11-08 15:35:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:28,799 INFO L225 Difference]: With dead ends: 24382 [2024-11-08 15:35:28,799 INFO L226 Difference]: Without dead ends: 16689 [2024-11-08 15:35:28,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:35:28,815 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 596 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:28,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3519 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:35:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16689 states. [2024-11-08 15:35:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16689 to 12473. [2024-11-08 15:35:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12473 states, 12472 states have (on average 1.7471135343168698) internal successors, (21790), 12472 states have internal predecessors, (21790), 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 15:35:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12473 states to 12473 states and 21790 transitions. [2024-11-08 15:35:29,236 INFO L78 Accepts]: Start accepts. Automaton has 12473 states and 21790 transitions. Word has length 233 [2024-11-08 15:35:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:29,237 INFO L471 AbstractCegarLoop]: Abstraction has 12473 states and 21790 transitions. [2024-11-08 15:35:29,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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 15:35:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 12473 states and 21790 transitions. [2024-11-08 15:35:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 15:35:29,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:29,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:29,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:35:29,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:29,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1319231316, now seen corresponding path program 1 times [2024-11-08 15:35:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:29,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619436998] [2024-11-08 15:35:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:29,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:29,442 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 15:35:29,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:29,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619436998] [2024-11-08 15:35:29,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619436998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:29,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:29,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248276308] [2024-11-08 15:35:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:29,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:29,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:29,445 INFO L87 Difference]: Start difference. First operand 12473 states and 21790 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 15:35:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:29,730 INFO L93 Difference]: Finished difference Result 24269 states and 42412 transitions. [2024-11-08 15:35:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:29,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 233 [2024-11-08 15:35:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:29,771 INFO L225 Difference]: With dead ends: 24269 [2024-11-08 15:35:29,772 INFO L226 Difference]: Without dead ends: 17907 [2024-11-08 15:35:29,783 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 15:35:29,784 INFO L432 NwaCegarLoop]: 1236 mSDtfsCounter, 154 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:29,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 2391 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:35:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17907 states. [2024-11-08 15:35:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17907 to 17905. [2024-11-08 15:35:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17905 states, 17904 states have (on average 1.7374888293118855) internal successors, (31108), 17904 states have internal predecessors, (31108), 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 15:35:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17905 states to 17905 states and 31108 transitions. [2024-11-08 15:35:30,277 INFO L78 Accepts]: Start accepts. Automaton has 17905 states and 31108 transitions. Word has length 233 [2024-11-08 15:35:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:30,278 INFO L471 AbstractCegarLoop]: Abstraction has 17905 states and 31108 transitions. [2024-11-08 15:35:30,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 15:35:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 17905 states and 31108 transitions. [2024-11-08 15:35:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 15:35:30,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:30,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:30,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:35:30,285 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash -928421424, now seen corresponding path program 1 times [2024-11-08 15:35:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:30,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591294011] [2024-11-08 15:35:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:30,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:30,649 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 15:35:30,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:30,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591294011] [2024-11-08 15:35:30,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591294011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:30,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:30,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:30,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277524418] [2024-11-08 15:35:30,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:30,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:30,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:30,651 INFO L87 Difference]: Start difference. First operand 17905 states and 31108 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 15:35:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:30,887 INFO L93 Difference]: Finished difference Result 34325 states and 59694 transitions. [2024-11-08 15:35:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:30,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 233 [2024-11-08 15:35:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:30,941 INFO L225 Difference]: With dead ends: 34325 [2024-11-08 15:35:30,941 INFO L226 Difference]: Without dead ends: 25061 [2024-11-08 15:35:30,966 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 15:35:30,967 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 162 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:30,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 2424 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:35:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25061 states. [2024-11-08 15:35:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25061 to 25059. [2024-11-08 15:35:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25059 states, 25058 states have (on average 1.7287093942054435) internal successors, (43318), 25058 states have internal predecessors, (43318), 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 15:35:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25059 states to 25059 states and 43318 transitions. [2024-11-08 15:35:31,550 INFO L78 Accepts]: Start accepts. Automaton has 25059 states and 43318 transitions. Word has length 233 [2024-11-08 15:35:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:31,551 INFO L471 AbstractCegarLoop]: Abstraction has 25059 states and 43318 transitions. [2024-11-08 15:35:31,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 15:35:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 25059 states and 43318 transitions. [2024-11-08 15:35:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 15:35:31,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:31,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:31,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:35:31,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:31,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1056462478, now seen corresponding path program 1 times [2024-11-08 15:35:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:31,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462385955] [2024-11-08 15:35:31,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:31,827 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 15:35:31,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462385955] [2024-11-08 15:35:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462385955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:31,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:31,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740918970] [2024-11-08 15:35:31,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:31,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:31,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:31,831 INFO L87 Difference]: Start difference. First operand 25059 states and 43318 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 15:35:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:32,173 INFO L93 Difference]: Finished difference Result 48445 states and 83820 transitions. [2024-11-08 15:35:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 233 [2024-11-08 15:35:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:32,251 INFO L225 Difference]: With dead ends: 48445 [2024-11-08 15:35:32,252 INFO L226 Difference]: Without dead ends: 35221 [2024-11-08 15:35:32,283 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 15:35:32,285 INFO L432 NwaCegarLoop]: 1316 mSDtfsCounter, 178 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:32,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 2468 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:35:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35221 states. [2024-11-08 15:35:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35221 to 35219. [2024-11-08 15:35:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35219 states, 35218 states have (on average 1.719802373786132) internal successors, (60568), 35218 states have internal predecessors, (60568), 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 15:35:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35219 states to 35219 states and 60568 transitions. [2024-11-08 15:35:33,147 INFO L78 Accepts]: Start accepts. Automaton has 35219 states and 60568 transitions. Word has length 233 [2024-11-08 15:35:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:33,148 INFO L471 AbstractCegarLoop]: Abstraction has 35219 states and 60568 transitions. [2024-11-08 15:35:33,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 15:35:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35219 states and 60568 transitions. [2024-11-08 15:35:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 15:35:33,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:33,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:33,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:35:33,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:33,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2050411316, now seen corresponding path program 1 times [2024-11-08 15:35:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:33,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138014542] [2024-11-08 15:35:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:33,387 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 15:35:33,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:33,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138014542] [2024-11-08 15:35:33,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138014542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:33,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:33,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:35:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396937078] [2024-11-08 15:35:33,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:33,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:35:33,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:35:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:35:33,390 INFO L87 Difference]: Start difference. First operand 35219 states and 60568 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 15:35:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:34,516 INFO L93 Difference]: Finished difference Result 79111 states and 136612 transitions. [2024-11-08 15:35:34,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:35:34,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 233 [2024-11-08 15:35:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:34,680 INFO L225 Difference]: With dead ends: 79111 [2024-11-08 15:35:34,681 INFO L226 Difference]: Without dead ends: 54409 [2024-11-08 15:35:34,734 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 15:35:34,734 INFO L432 NwaCegarLoop]: 1341 mSDtfsCounter, 186 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:34,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 2492 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:35:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54409 states. [2024-11-08 15:35:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54409 to 54407. [2024-11-08 15:35:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54407 states, 54406 states have (on average 1.7115943094511634) internal successors, (93121), 54406 states have internal predecessors, (93121), 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 15:35:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54407 states to 54407 states and 93121 transitions. [2024-11-08 15:35:36,408 INFO L78 Accepts]: Start accepts. Automaton has 54407 states and 93121 transitions. Word has length 233 [2024-11-08 15:35:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:36,409 INFO L471 AbstractCegarLoop]: Abstraction has 54407 states and 93121 transitions. [2024-11-08 15:35:36,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 15:35:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 54407 states and 93121 transitions. [2024-11-08 15:35:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 15:35:36,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:36,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:36,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:35:36,413 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:36,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash 616526854, now seen corresponding path program 1 times [2024-11-08 15:35:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:36,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806908968] [2024-11-08 15:35:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:36,724 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 15:35:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806908968] [2024-11-08 15:35:36,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806908968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:36,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:36,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:35:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801493938] [2024-11-08 15:35:36,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:36,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:35:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:35:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:35:36,726 INFO L87 Difference]: Start difference. First operand 54407 states and 93121 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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 15:35:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:38,205 INFO L93 Difference]: Finished difference Result 180408 states and 309174 transitions. [2024-11-08 15:35:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:35:38,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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 234 [2024-11-08 15:35:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:38,512 INFO L225 Difference]: With dead ends: 180408 [2024-11-08 15:35:38,512 INFO L226 Difference]: Without dead ends: 126581 [2024-11-08 15:35:38,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:35:38,787 INFO L432 NwaCegarLoop]: 1165 mSDtfsCounter, 594 mSDsluCounter, 2489 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 3654 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:38,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 3654 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:35:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126581 states. [2024-11-08 15:35:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126581 to 90225. [2024-11-08 15:35:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90225 states, 90224 states have (on average 1.7041917893243483) internal successors, (153759), 90224 states have internal predecessors, (153759), 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 15:35:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90225 states to 90225 states and 153759 transitions. [2024-11-08 15:35:40,790 INFO L78 Accepts]: Start accepts. Automaton has 90225 states and 153759 transitions. Word has length 234 [2024-11-08 15:35:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:40,791 INFO L471 AbstractCegarLoop]: Abstraction has 90225 states and 153759 transitions. [2024-11-08 15:35:40,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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 15:35:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 90225 states and 153759 transitions. [2024-11-08 15:35:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 15:35:40,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:40,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:40,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:35:40,796 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:40,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:40,797 INFO L85 PathProgramCache]: Analyzing trace with hash 4092407, now seen corresponding path program 1 times [2024-11-08 15:35:40,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:40,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615931519] [2024-11-08 15:35:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:41,166 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 15:35:41,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:41,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615931519] [2024-11-08 15:35:41,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615931519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:41,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:41,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:35:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507503321] [2024-11-08 15:35:41,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:41,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:35:41,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:41,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:35:41,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:35:41,172 INFO L87 Difference]: Start difference. First operand 90225 states and 153759 transitions. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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 15:35:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:43,266 INFO L93 Difference]: Finished difference Result 299376 states and 510894 transitions. [2024-11-08 15:35:43,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:35:43,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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 235 [2024-11-08 15:35:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:43,632 INFO L225 Difference]: With dead ends: 299376 [2024-11-08 15:35:43,632 INFO L226 Difference]: Without dead ends: 209731 [2024-11-08 15:35:43,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:35:43,720 INFO L432 NwaCegarLoop]: 1172 mSDtfsCounter, 592 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 3663 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:43,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 3663 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:35:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209731 states. [2024-11-08 15:35:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209731 to 149535. [2024-11-08 15:35:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149535 states, 149534 states have (on average 1.6969318014632124) internal successors, (253749), 149534 states have internal predecessors, (253749), 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 15:35:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149535 states to 149535 states and 253749 transitions. [2024-11-08 15:35:47,706 INFO L78 Accepts]: Start accepts. Automaton has 149535 states and 253749 transitions. Word has length 235 [2024-11-08 15:35:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:47,711 INFO L471 AbstractCegarLoop]: Abstraction has 149535 states and 253749 transitions. [2024-11-08 15:35:47,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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 15:35:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 149535 states and 253749 transitions. [2024-11-08 15:35:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-08 15:35:47,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:47,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:47,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:35:47,718 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:47,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1632501923, now seen corresponding path program 1 times [2024-11-08 15:35:47,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:47,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777617380] [2024-11-08 15:35:47,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:47,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:48,049 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 15:35:48,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:48,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777617380] [2024-11-08 15:35:48,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777617380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:48,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:48,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:35:48,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194568681] [2024-11-08 15:35:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:48,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:35:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:35:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:35:48,052 INFO L87 Difference]: Start difference. First operand 149535 states and 253749 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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 15:35:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:35:51,482 INFO L93 Difference]: Finished difference Result 494936 states and 841118 transitions. [2024-11-08 15:35:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:35:51,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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 236 [2024-11-08 15:35:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:35:52,121 INFO L225 Difference]: With dead ends: 494936 [2024-11-08 15:35:52,121 INFO L226 Difference]: Without dead ends: 345981 [2024-11-08 15:35:52,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:35:52,263 INFO L432 NwaCegarLoop]: 1165 mSDtfsCounter, 590 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:35:52,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 3658 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:35:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345981 states. [2024-11-08 15:35:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345981 to 247033. [2024-11-08 15:35:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247033 states, 247032 states have (on average 1.689866090223129) internal successors, (417451), 247032 states have internal predecessors, (417451), 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 15:35:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247033 states to 247033 states and 417451 transitions. [2024-11-08 15:35:58,571 INFO L78 Accepts]: Start accepts. Automaton has 247033 states and 417451 transitions. Word has length 236 [2024-11-08 15:35:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:35:58,572 INFO L471 AbstractCegarLoop]: Abstraction has 247033 states and 417451 transitions. [2024-11-08 15:35:58,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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 15:35:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 247033 states and 417451 transitions. [2024-11-08 15:35:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 15:35:58,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:35:58,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:35:58,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:35:58,574 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:35:58,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:35:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash -658314258, now seen corresponding path program 1 times [2024-11-08 15:35:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:35:58,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497505910] [2024-11-08 15:35:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:35:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:35:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:35:58,832 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 15:35:58,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:35:58,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497505910] [2024-11-08 15:35:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497505910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:35:58,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:35:58,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:35:58,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762594535] [2024-11-08 15:35:58,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:35:58,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:35:58,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:35:58,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:35:58,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:35:58,835 INFO L87 Difference]: Start difference. First operand 247033 states and 417451 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 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 15:36:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:04,882 INFO L93 Difference]: Finished difference Result 811984 states and 1374342 transitions. [2024-11-08 15:36:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:36:04,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 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 15:36:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:06,106 INFO L225 Difference]: With dead ends: 811984 [2024-11-08 15:36:06,106 INFO L226 Difference]: Without dead ends: 565531 [2024-11-08 15:36:06,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:36:06,357 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 588 mSDsluCounter, 2477 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 3641 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:06,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 3641 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:36:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565531 states. [2024-11-08 15:36:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565531 to 405111. [2024-11-08 15:36:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405111 states, 405110 states have (on average 1.6830811384562219) internal successors, (681833), 405110 states have internal predecessors, (681833), 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 15:36:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405111 states to 405111 states and 681833 transitions. [2024-11-08 15:36:16,321 INFO L78 Accepts]: Start accepts. Automaton has 405111 states and 681833 transitions. Word has length 237 [2024-11-08 15:36:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:16,322 INFO L471 AbstractCegarLoop]: Abstraction has 405111 states and 681833 transitions. [2024-11-08 15:36:16,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 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 15:36:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 405111 states and 681833 transitions. [2024-11-08 15:36:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-08 15:36:16,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:16,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:36:16,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:36:16,324 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:16,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash 710412710, now seen corresponding path program 1 times [2024-11-08 15:36:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:16,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408123978] [2024-11-08 15:36:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:16,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:17,711 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 15:36:17,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:17,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408123978] [2024-11-08 15:36:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408123978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:17,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:17,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:36:17,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221886463] [2024-11-08 15:36:17,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:17,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:36:17,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:17,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:36:17,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:36:17,716 INFO L87 Difference]: Start difference. First operand 405111 states and 681833 transitions. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 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)