./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.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 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:19:49,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:19:49,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:19:49,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:19:49,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:19:49,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:19:49,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:19:49,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:19:49,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:19:49,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:19:49,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:19:49,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:19:49,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:19:49,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:19:49,314 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:19:49,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:19:49,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:19:49,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:19:49,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:19:49,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:19:49,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:19:49,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:19:49,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:19:49,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:19:49,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:19:49,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:19:49,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:19:49,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:19:49,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:19:49,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:19:49,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:19:49,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:19:49,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:19:49,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:19:49,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:19:49,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:19:49,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:19:49,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:19:49,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:19:49,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:19:49,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:19:49,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:19:49,323 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 -> 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b [2024-10-24 01:19:49,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:19:49,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:19:49,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:19:49,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:19:49,613 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:19:49,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-10-24 01:19:51,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:19:51,282 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:19:51,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-10-24 01:19:51,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15aac077e/5d81c7db7cb348abb027360dd72de796/FLAGfdfa1adfb [2024-10-24 01:19:51,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15aac077e/5d81c7db7cb348abb027360dd72de796 [2024-10-24 01:19:51,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:19:51,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:19:51,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:19:51,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:19:51,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:19:51,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1540ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51, skipping insertion in model container [2024-10-24 01:19:51,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:19:51,656 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2024-10-24 01:19:51,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:19:51,674 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:19:51,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2024-10-24 01:19:51,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:19:51,754 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:19:51,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51 WrapperNode [2024-10-24 01:19:51,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:19:51,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:19:51,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:19:51,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:19:51,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,822 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-10-24 01:19:51,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:19:51,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:19:51,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:19:51,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:19:51,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,865 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 01:19:51,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:19:51,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:19:51,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:19:51,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:19:51,887 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (1/1) ... [2024-10-24 01:19:51,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:19:51,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:51,925 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-10-24 01:19:51,928 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-10-24 01:19:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:19:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:19:51,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:19:51,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:19:52,083 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:19:52,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:19:52,723 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-24 01:19:52,723 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:19:52,777 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:19:52,778 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:19:52,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:19:52 BoogieIcfgContainer [2024-10-24 01:19:52,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:19:52,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:19:52,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:19:52,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:19:52,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:19:51" (1/3) ... [2024-10-24 01:19:52,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3222bf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:19:52, skipping insertion in model container [2024-10-24 01:19:52,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:19:51" (2/3) ... [2024-10-24 01:19:52,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3222bf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:19:52, skipping insertion in model container [2024-10-24 01:19:52,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:19:52" (3/3) ... [2024-10-24 01:19:52,788 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-10-24 01:19:52,804 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:19:52,805 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:19:52,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:19:52,873 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;@410fc334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:19:52,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:19:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:19:52,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:52,886 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] [2024-10-24 01:19:52,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:52,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1477667755, now seen corresponding path program 1 times [2024-10-24 01:19:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675815997] [2024-10-24 01:19:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:53,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675815997] [2024-10-24 01:19:53,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675815997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:53,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:53,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:19:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24383238] [2024-10-24 01:19:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:53,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:19:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:53,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:19:53,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:19:53,271 INFO L87 Difference]: Start difference. First operand has 114 states, 112 states have (on average 1.8214285714285714) internal successors, (204), 113 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:53,322 INFO L93 Difference]: Finished difference Result 174 states and 308 transitions. [2024-10-24 01:19:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:19:53,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2024-10-24 01:19:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:53,332 INFO L225 Difference]: With dead ends: 174 [2024-10-24 01:19:53,332 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 01:19:53,334 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-10-24 01:19:53,337 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:53,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 01:19:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-24 01:19:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.7927927927927927) internal successors, (199), 111 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 199 transitions. [2024-10-24 01:19:53,371 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 199 transitions. Word has length 34 [2024-10-24 01:19:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:53,371 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 199 transitions. [2024-10-24 01:19:53,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 199 transitions. [2024-10-24 01:19:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:19:53,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:53,373 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] [2024-10-24 01:19:53,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:19:53,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:53,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash -211275987, now seen corresponding path program 1 times [2024-10-24 01:19:53,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:53,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489132315] [2024-10-24 01:19:53,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:53,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:53,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:53,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489132315] [2024-10-24 01:19:53,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489132315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:53,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:53,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:53,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926558019] [2024-10-24 01:19:53,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:53,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:53,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:53,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:53,630 INFO L87 Difference]: Start difference. First operand 112 states and 199 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:53,734 INFO L93 Difference]: Finished difference Result 229 states and 400 transitions. [2024-10-24 01:19:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:53,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-10-24 01:19:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:53,737 INFO L225 Difference]: With dead ends: 229 [2024-10-24 01:19:53,737 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 01:19:53,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:53,739 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 98 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:53,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 552 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 01:19:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 112. [2024-10-24 01:19:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 111 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 172 transitions. [2024-10-24 01:19:53,756 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 172 transitions. Word has length 34 [2024-10-24 01:19:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:53,759 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 172 transitions. [2024-10-24 01:19:53,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 172 transitions. [2024-10-24 01:19:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 01:19:53,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:53,764 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] [2024-10-24 01:19:53,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:19:53,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:53,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash -985754314, now seen corresponding path program 1 times [2024-10-24 01:19:53,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:53,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524495232] [2024-10-24 01:19:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:53,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524495232] [2024-10-24 01:19:53,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524495232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:53,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:53,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914910048] [2024-10-24 01:19:53,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:53,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:53,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:53,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:53,968 INFO L87 Difference]: Start difference. First operand 112 states and 172 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:54,032 INFO L93 Difference]: Finished difference Result 217 states and 353 transitions. [2024-10-24 01:19:54,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:54,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-10-24 01:19:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:54,034 INFO L225 Difference]: With dead ends: 217 [2024-10-24 01:19:54,034 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 01:19:54,035 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-10-24 01:19:54,036 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 74 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:54,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 363 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 01:19:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2024-10-24 01:19:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5796178343949046) internal successors, (248), 157 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 248 transitions. [2024-10-24 01:19:54,053 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 248 transitions. Word has length 60 [2024-10-24 01:19:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:54,054 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 248 transitions. [2024-10-24 01:19:54,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 248 transitions. [2024-10-24 01:19:54,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 01:19:54,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:54,056 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] [2024-10-24 01:19:54,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:19:54,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:54,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1305875761, now seen corresponding path program 1 times [2024-10-24 01:19:54,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:54,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297400300] [2024-10-24 01:19:54,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:54,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297400300] [2024-10-24 01:19:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297400300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:54,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55149288] [2024-10-24 01:19:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:54,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:54,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:54,200 INFO L87 Difference]: Start difference. First operand 158 states and 248 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:54,235 INFO L93 Difference]: Finished difference Result 263 states and 429 transitions. [2024-10-24 01:19:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:54,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2024-10-24 01:19:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:54,239 INFO L225 Difference]: With dead ends: 263 [2024-10-24 01:19:54,240 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 01:19:54,241 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-10-24 01:19:54,244 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 83 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:54,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 389 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 01:19:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-10-24 01:19:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 203 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 327 transitions. [2024-10-24 01:19:54,271 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 327 transitions. Word has length 62 [2024-10-24 01:19:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:54,272 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 327 transitions. [2024-10-24 01:19:54,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 327 transitions. [2024-10-24 01:19:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 01:19:54,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:54,274 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] [2024-10-24 01:19:54,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:19:54,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:54,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1944934066, now seen corresponding path program 1 times [2024-10-24 01:19:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:54,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144273321] [2024-10-24 01:19:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:54,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144273321] [2024-10-24 01:19:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144273321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:54,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:54,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160521037] [2024-10-24 01:19:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:54,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:54,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:54,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:54,409 INFO L87 Difference]: Start difference. First operand 204 states and 327 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:54,443 INFO L93 Difference]: Finished difference Result 477 states and 792 transitions. [2024-10-24 01:19:54,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:54,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2024-10-24 01:19:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:54,448 INFO L225 Difference]: With dead ends: 477 [2024-10-24 01:19:54,448 INFO L226 Difference]: Without dead ends: 330 [2024-10-24 01:19:54,449 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-10-24 01:19:54,450 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 76 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:54,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 376 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-24 01:19:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2024-10-24 01:19:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.6391437308868502) internal successors, (536), 327 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 536 transitions. [2024-10-24 01:19:54,481 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 536 transitions. Word has length 62 [2024-10-24 01:19:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:54,482 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 536 transitions. [2024-10-24 01:19:54,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 536 transitions. [2024-10-24 01:19:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 01:19:54,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:54,483 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] [2024-10-24 01:19:54,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:19:54,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:54,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash -386894903, now seen corresponding path program 1 times [2024-10-24 01:19:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594123753] [2024-10-24 01:19:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:54,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594123753] [2024-10-24 01:19:54,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594123753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:54,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:54,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:54,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886391542] [2024-10-24 01:19:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:54,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:54,588 INFO L87 Difference]: Start difference. First operand 328 states and 536 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:54,617 INFO L93 Difference]: Finished difference Result 595 states and 989 transitions. [2024-10-24 01:19:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:54,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2024-10-24 01:19:54,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:54,624 INFO L225 Difference]: With dead ends: 595 [2024-10-24 01:19:54,624 INFO L226 Difference]: Without dead ends: 448 [2024-10-24 01:19:54,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-10-24 01:19:54,628 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 77 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:54,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-24 01:19:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2024-10-24 01:19:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.644943820224719) internal successors, (732), 445 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 732 transitions. [2024-10-24 01:19:54,648 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 732 transitions. Word has length 64 [2024-10-24 01:19:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:54,648 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 732 transitions. [2024-10-24 01:19:54,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 732 transitions. [2024-10-24 01:19:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 01:19:54,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:54,650 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] [2024-10-24 01:19:54,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:19:54,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:54,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash 892182118, now seen corresponding path program 1 times [2024-10-24 01:19:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:54,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685294794] [2024-10-24 01:19:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:54,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685294794] [2024-10-24 01:19:54,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685294794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:54,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:54,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:54,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768839475] [2024-10-24 01:19:54,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:54,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:54,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:54,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:54,751 INFO L87 Difference]: Start difference. First operand 446 states and 732 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:54,781 INFO L93 Difference]: Finished difference Result 1149 states and 1913 transitions. [2024-10-24 01:19:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:54,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2024-10-24 01:19:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:54,785 INFO L225 Difference]: With dead ends: 1149 [2024-10-24 01:19:54,785 INFO L226 Difference]: Without dead ends: 766 [2024-10-24 01:19:54,785 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-10-24 01:19:54,786 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 70 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:54,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 369 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-10-24 01:19:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 764. [2024-10-24 01:19:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 1.6435124508519003) internal successors, (1254), 763 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1254 transitions. [2024-10-24 01:19:54,806 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1254 transitions. Word has length 64 [2024-10-24 01:19:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:54,806 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1254 transitions. [2024-10-24 01:19:54,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1254 transitions. [2024-10-24 01:19:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 01:19:54,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:54,808 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] [2024-10-24 01:19:54,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:19:54,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:54,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash 539603809, now seen corresponding path program 1 times [2024-10-24 01:19:54,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:54,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669912114] [2024-10-24 01:19:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:54,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669912114] [2024-10-24 01:19:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669912114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:54,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:54,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777649584] [2024-10-24 01:19:54,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:54,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:54,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:54,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:54,893 INFO L87 Difference]: Start difference. First operand 764 states and 1254 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:54,928 INFO L93 Difference]: Finished difference Result 1437 states and 2381 transitions. [2024-10-24 01:19:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:54,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2024-10-24 01:19:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:54,933 INFO L225 Difference]: With dead ends: 1437 [2024-10-24 01:19:54,934 INFO L226 Difference]: Without dead ends: 1054 [2024-10-24 01:19:54,934 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-10-24 01:19:54,935 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 71 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:54,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 373 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-10-24 01:19:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1052. [2024-10-24 01:19:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.637488106565176) internal successors, (1721), 1051 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1721 transitions. [2024-10-24 01:19:54,961 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1721 transitions. Word has length 66 [2024-10-24 01:19:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:54,962 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1721 transitions. [2024-10-24 01:19:54,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1721 transitions. [2024-10-24 01:19:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 01:19:54,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:54,963 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] [2024-10-24 01:19:54,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:19:54,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:54,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1422478210, now seen corresponding path program 1 times [2024-10-24 01:19:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:54,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207537756] [2024-10-24 01:19:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:55,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:55,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207537756] [2024-10-24 01:19:55,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207537756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:55,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:55,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:55,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413242140] [2024-10-24 01:19:55,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:55,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:55,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:55,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:55,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:55,108 INFO L87 Difference]: Start difference. First operand 1052 states and 1721 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:55,347 INFO L93 Difference]: Finished difference Result 5336 states and 8927 transitions. [2024-10-24 01:19:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:19:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-10-24 01:19:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:55,365 INFO L225 Difference]: With dead ends: 5336 [2024-10-24 01:19:55,366 INFO L226 Difference]: Without dead ends: 4353 [2024-10-24 01:19:55,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:19:55,390 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 576 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:55,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1062 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4353 states. [2024-10-24 01:19:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4353 to 1969. [2024-10-24 01:19:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.6346544715447155) internal successors, (3217), 1968 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 3217 transitions. [2024-10-24 01:19:55,458 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 3217 transitions. Word has length 66 [2024-10-24 01:19:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:55,458 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 3217 transitions. [2024-10-24 01:19:55,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 3217 transitions. [2024-10-24 01:19:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 01:19:55,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:55,459 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] [2024-10-24 01:19:55,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:19:55,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:55,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:55,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1209872637, now seen corresponding path program 1 times [2024-10-24 01:19:55,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:55,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683465397] [2024-10-24 01:19:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:55,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:55,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683465397] [2024-10-24 01:19:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683465397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:55,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:55,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480766368] [2024-10-24 01:19:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:55,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:55,550 INFO L87 Difference]: Start difference. First operand 1969 states and 3217 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:55,671 INFO L93 Difference]: Finished difference Result 6431 states and 10655 transitions. [2024-10-24 01:19:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:55,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2024-10-24 01:19:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:55,689 INFO L225 Difference]: With dead ends: 6431 [2024-10-24 01:19:55,690 INFO L226 Difference]: Without dead ends: 4531 [2024-10-24 01:19:55,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-24 01:19:55,694 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 280 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:55,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 542 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2024-10-24 01:19:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 3231. [2024-10-24 01:19:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3231 states, 3230 states have (on average 1.6368421052631579) internal successors, (5287), 3230 states have internal predecessors, (5287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 5287 transitions. [2024-10-24 01:19:55,794 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 5287 transitions. Word has length 67 [2024-10-24 01:19:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:55,795 INFO L471 AbstractCegarLoop]: Abstraction has 3231 states and 5287 transitions. [2024-10-24 01:19:55,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 5287 transitions. [2024-10-24 01:19:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 01:19:55,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:55,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] [2024-10-24 01:19:55,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:19:55,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:55,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1091384583, now seen corresponding path program 1 times [2024-10-24 01:19:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647347463] [2024-10-24 01:19:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:55,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647347463] [2024-10-24 01:19:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647347463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:55,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:55,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:55,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640442867] [2024-10-24 01:19:55,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:55,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:55,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:55,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:55,933 INFO L87 Difference]: Start difference. First operand 3231 states and 5287 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:56,096 INFO L93 Difference]: Finished difference Result 10391 states and 17091 transitions. [2024-10-24 01:19:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:56,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2024-10-24 01:19:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:56,122 INFO L225 Difference]: With dead ends: 10391 [2024-10-24 01:19:56,122 INFO L226 Difference]: Without dead ends: 7229 [2024-10-24 01:19:56,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-24 01:19:56,129 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 278 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:56,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 539 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2024-10-24 01:19:56,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 5201. [2024-10-24 01:19:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 5200 states have (on average 1.6259615384615385) internal successors, (8455), 5200 states have internal predecessors, (8455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 8455 transitions. [2024-10-24 01:19:56,289 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 8455 transitions. Word has length 68 [2024-10-24 01:19:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:56,289 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 8455 transitions. [2024-10-24 01:19:56,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 8455 transitions. [2024-10-24 01:19:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:19:56,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:56,291 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] [2024-10-24 01:19:56,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:19:56,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:56,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash -578633876, now seen corresponding path program 1 times [2024-10-24 01:19:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:56,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072371052] [2024-10-24 01:19:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:56,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:56,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072371052] [2024-10-24 01:19:56,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072371052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:56,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:56,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814604756] [2024-10-24 01:19:56,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:56,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:56,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:56,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:56,431 INFO L87 Difference]: Start difference. First operand 5201 states and 8455 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:56,675 INFO L93 Difference]: Finished difference Result 16423 states and 26807 transitions. [2024-10-24 01:19:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:56,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2024-10-24 01:19:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:56,713 INFO L225 Difference]: With dead ends: 16423 [2024-10-24 01:19:56,714 INFO L226 Difference]: Without dead ends: 11291 [2024-10-24 01:19:56,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-24 01:19:56,726 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 276 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:56,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 541 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2024-10-24 01:19:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 8203. [2024-10-24 01:19:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8203 states, 8202 states have (on average 1.6146061936113143) internal successors, (13243), 8202 states have internal predecessors, (13243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 13243 transitions. [2024-10-24 01:19:57,034 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 13243 transitions. Word has length 69 [2024-10-24 01:19:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:57,034 INFO L471 AbstractCegarLoop]: Abstraction has 8203 states and 13243 transitions. [2024-10-24 01:19:57,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 13243 transitions. [2024-10-24 01:19:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 01:19:57,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:57,035 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] [2024-10-24 01:19:57,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:19:57,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:57,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:57,036 INFO L85 PathProgramCache]: Analyzing trace with hash 802275316, now seen corresponding path program 1 times [2024-10-24 01:19:57,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:57,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859570558] [2024-10-24 01:19:57,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:57,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:57,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859570558] [2024-10-24 01:19:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859570558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:57,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944838711] [2024-10-24 01:19:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:57,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:57,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:57,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:57,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:57,322 INFO L87 Difference]: Start difference. First operand 8203 states and 13243 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:57,535 INFO L93 Difference]: Finished difference Result 16339 states and 26396 transitions. [2024-10-24 01:19:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:57,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 71 [2024-10-24 01:19:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:57,560 INFO L225 Difference]: With dead ends: 16339 [2024-10-24 01:19:57,560 INFO L226 Difference]: Without dead ends: 8205 [2024-10-24 01:19:57,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:19:57,573 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 70 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:57,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 593 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8205 states. [2024-10-24 01:19:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8205 to 8203. [2024-10-24 01:19:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8203 states, 8202 states have (on average 1.599366008290661) internal successors, (13118), 8202 states have internal predecessors, (13118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 13118 transitions. [2024-10-24 01:19:57,824 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 13118 transitions. Word has length 71 [2024-10-24 01:19:57,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:57,824 INFO L471 AbstractCegarLoop]: Abstraction has 8203 states and 13118 transitions. [2024-10-24 01:19:57,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 13118 transitions. [2024-10-24 01:19:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:19:57,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:57,826 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] [2024-10-24 01:19:57,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:19:57,826 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:57,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1920185732, now seen corresponding path program 1 times [2024-10-24 01:19:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:57,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461974386] [2024-10-24 01:19:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:57,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:58,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461974386] [2024-10-24 01:19:58,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461974386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:58,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:58,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:19:58,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145897748] [2024-10-24 01:19:58,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:58,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:58,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:58,067 INFO L87 Difference]: Start difference. First operand 8203 states and 13118 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:58,400 INFO L93 Difference]: Finished difference Result 23501 states and 37734 transitions. [2024-10-24 01:19:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:58,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2024-10-24 01:19:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:58,435 INFO L225 Difference]: With dead ends: 23501 [2024-10-24 01:19:58,435 INFO L226 Difference]: Without dead ends: 15367 [2024-10-24 01:19:58,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:19:58,452 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 135 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:58,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 455 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2024-10-24 01:19:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 15365. [2024-10-24 01:19:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15365 states, 15364 states have (on average 1.582725852642541) internal successors, (24317), 15364 states have internal predecessors, (24317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 24317 transitions. [2024-10-24 01:19:58,868 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 24317 transitions. Word has length 74 [2024-10-24 01:19:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:58,868 INFO L471 AbstractCegarLoop]: Abstraction has 15365 states and 24317 transitions. [2024-10-24 01:19:58,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 24317 transitions. [2024-10-24 01:19:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:19:58,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:58,870 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] [2024-10-24 01:19:58,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:19:58,870 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:58,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -618303701, now seen corresponding path program 1 times [2024-10-24 01:19:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765540217] [2024-10-24 01:19:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:59,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765540217] [2024-10-24 01:19:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765540217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023238807] [2024-10-24 01:19:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:59,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:59,072 INFO L87 Difference]: Start difference. First operand 15365 states and 24317 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:59,355 INFO L93 Difference]: Finished difference Result 16091 states and 25404 transitions. [2024-10-24 01:19:59,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:59,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-24 01:19:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:59,392 INFO L225 Difference]: With dead ends: 16091 [2024-10-24 01:19:59,392 INFO L226 Difference]: Without dead ends: 16089 [2024-10-24 01:19:59,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:59,399 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:59,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16089 states. [2024-10-24 01:19:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16089 to 16089. [2024-10-24 01:19:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16089 states, 16088 states have (on average 1.555942317255097) internal successors, (25032), 16088 states have internal predecessors, (25032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16089 states to 16089 states and 25032 transitions. [2024-10-24 01:19:59,737 INFO L78 Accepts]: Start accepts. Automaton has 16089 states and 25032 transitions. Word has length 75 [2024-10-24 01:19:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:59,738 INFO L471 AbstractCegarLoop]: Abstraction has 16089 states and 25032 transitions. [2024-10-24 01:19:59,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:19:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16089 states and 25032 transitions. [2024-10-24 01:19:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:19:59,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:59,740 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:59,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:19:59,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:59,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2029578417, now seen corresponding path program 1 times [2024-10-24 01:19:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:59,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509776929] [2024-10-24 01:19:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:19:59,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:59,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509776929] [2024-10-24 01:19:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509776929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:59,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:59,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572701957] [2024-10-24 01:19:59,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:59,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:59,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:59,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:59,855 INFO L87 Difference]: Start difference. First operand 16089 states and 25032 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:00,249 INFO L93 Difference]: Finished difference Result 48009 states and 74629 transitions. [2024-10-24 01:20:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:00,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2024-10-24 01:20:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:00,317 INFO L225 Difference]: With dead ends: 48009 [2024-10-24 01:20:00,317 INFO L226 Difference]: Without dead ends: 31985 [2024-10-24 01:20:00,342 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-10-24 01:20:00,342 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:00,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 399 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31985 states. [2024-10-24 01:20:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31985 to 31983. [2024-10-24 01:20:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31983 states, 31982 states have (on average 1.5403039209555376) internal successors, (49262), 31982 states have internal predecessors, (49262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31983 states to 31983 states and 49262 transitions. [2024-10-24 01:20:01,279 INFO L78 Accepts]: Start accepts. Automaton has 31983 states and 49262 transitions. Word has length 99 [2024-10-24 01:20:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:01,280 INFO L471 AbstractCegarLoop]: Abstraction has 31983 states and 49262 transitions. [2024-10-24 01:20:01,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 31983 states and 49262 transitions. [2024-10-24 01:20:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:01,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:01,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:01,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:20:01,289 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:01,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1881455852, now seen corresponding path program 1 times [2024-10-24 01:20:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:01,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332138755] [2024-10-24 01:20:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:20:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332138755] [2024-10-24 01:20:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332138755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:01,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:01,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638078693] [2024-10-24 01:20:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:01,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:01,505 INFO L87 Difference]: Start difference. First operand 31983 states and 49262 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:02,319 INFO L93 Difference]: Finished difference Result 95477 states and 146924 transitions. [2024-10-24 01:20:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 99 [2024-10-24 01:20:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:02,508 INFO L225 Difference]: With dead ends: 95477 [2024-10-24 01:20:02,508 INFO L226 Difference]: Without dead ends: 63592 [2024-10-24 01:20:02,544 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-10-24 01:20:02,544 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 95 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:02,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 374 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63592 states. [2024-10-24 01:20:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63592 to 63590. [2024-10-24 01:20:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63590 states, 63589 states have (on average 1.524508955951501) internal successors, (96942), 63589 states have internal predecessors, (96942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63590 states to 63590 states and 96942 transitions. [2024-10-24 01:20:04,122 INFO L78 Accepts]: Start accepts. Automaton has 63590 states and 96942 transitions. Word has length 99 [2024-10-24 01:20:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:04,122 INFO L471 AbstractCegarLoop]: Abstraction has 63590 states and 96942 transitions. [2024-10-24 01:20:04,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 63590 states and 96942 transitions. [2024-10-24 01:20:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:04,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:04,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:04,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:20:04,128 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:04,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:04,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1491540327, now seen corresponding path program 1 times [2024-10-24 01:20:04,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:04,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837395955] [2024-10-24 01:20:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:04,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:20:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:04,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837395955] [2024-10-24 01:20:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837395955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:04,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686322254] [2024-10-24 01:20:04,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:04,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:04,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:04,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:04,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:04,372 INFO L87 Difference]: Start difference. First operand 63590 states and 96942 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:05,980 INFO L93 Difference]: Finished difference Result 189890 states and 289215 transitions. [2024-10-24 01:20:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:05,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 99 [2024-10-24 01:20:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:06,251 INFO L225 Difference]: With dead ends: 189890 [2024-10-24 01:20:06,252 INFO L226 Difference]: Without dead ends: 126472 [2024-10-24 01:20:06,320 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-10-24 01:20:06,321 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 109 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:06,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 389 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126472 states. [2024-10-24 01:20:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126472 to 126470. [2024-10-24 01:20:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126470 states, 126469 states have (on average 1.508598945196056) internal successors, (190791), 126469 states have internal predecessors, (190791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126470 states to 126470 states and 190791 transitions. [2024-10-24 01:20:08,994 INFO L78 Accepts]: Start accepts. Automaton has 126470 states and 190791 transitions. Word has length 99 [2024-10-24 01:20:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 126470 states and 190791 transitions. [2024-10-24 01:20:08,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 126470 states and 190791 transitions. [2024-10-24 01:20:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:09,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:09,006 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:09,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:20:09,006 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:09,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 782589003, now seen corresponding path program 1 times [2024-10-24 01:20:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041036630] [2024-10-24 01:20:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:09,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041036630] [2024-10-24 01:20:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041036630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225480141] [2024-10-24 01:20:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:09,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:09,095 INFO L87 Difference]: Start difference. First operand 126470 states and 190791 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:12,403 INFO L93 Difference]: Finished difference Result 377614 states and 569134 transitions. [2024-10-24 01:20:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:12,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2024-10-24 01:20:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:12,997 INFO L225 Difference]: With dead ends: 377614 [2024-10-24 01:20:12,997 INFO L226 Difference]: Without dead ends: 251544 [2024-10-24 01:20:13,089 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-10-24 01:20:13,090 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 129 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:13,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 405 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251544 states. [2024-10-24 01:20:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251544 to 251542. [2024-10-24 01:20:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251542 states, 251541 states have (on average 1.492559861016693) internal successors, (375440), 251541 states have internal predecessors, (375440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251542 states to 251542 states and 375440 transitions. [2024-10-24 01:20:18,977 INFO L78 Accepts]: Start accepts. Automaton has 251542 states and 375440 transitions. Word has length 99 [2024-10-24 01:20:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:18,978 INFO L471 AbstractCegarLoop]: Abstraction has 251542 states and 375440 transitions. [2024-10-24 01:20:18,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 251542 states and 375440 transitions. [2024-10-24 01:20:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:19,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:19,011 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:19,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:20:19,012 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1206235725, now seen corresponding path program 1 times [2024-10-24 01:20:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:19,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577065314] [2024-10-24 01:20:19,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:19,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577065314] [2024-10-24 01:20:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577065314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129176566] [2024-10-24 01:20:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:19,103 INFO L87 Difference]: Start difference. First operand 251542 states and 375440 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:22,412 INFO L93 Difference]: Finished difference Result 377990 states and 562842 transitions. [2024-10-24 01:20:22,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:22,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2024-10-24 01:20:22,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:22,987 INFO L225 Difference]: With dead ends: 377990 [2024-10-24 01:20:22,987 INFO L226 Difference]: Without dead ends: 251888 [2024-10-24 01:20:23,091 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-10-24 01:20:23,092 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 100 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:23,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251888 states. [2024-10-24 01:20:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251888 to 251886. [2024-10-24 01:20:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251886 states, 251885 states have (on average 1.4786589118049904) internal successors, (372452), 251885 states have internal predecessors, (372452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251886 states to 251886 states and 372452 transitions. [2024-10-24 01:20:28,975 INFO L78 Accepts]: Start accepts. Automaton has 251886 states and 372452 transitions. Word has length 99 [2024-10-24 01:20:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:28,977 INFO L471 AbstractCegarLoop]: Abstraction has 251886 states and 372452 transitions. [2024-10-24 01:20:28,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 251886 states and 372452 transitions. [2024-10-24 01:20:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:28,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:28,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:28,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:20:28,996 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:28,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:28,997 INFO L85 PathProgramCache]: Analyzing trace with hash 195118475, now seen corresponding path program 1 times [2024-10-24 01:20:28,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:28,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924724300] [2024-10-24 01:20:28,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:28,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:29,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:29,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924724300] [2024-10-24 01:20:29,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924724300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:29,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:29,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:29,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716498768] [2024-10-24 01:20:29,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:29,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:29,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:29,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:29,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:29,105 INFO L87 Difference]: Start difference. First operand 251886 states and 372452 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:32,229 INFO L93 Difference]: Finished difference Result 378534 states and 558401 transitions. [2024-10-24 01:20:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:32,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2024-10-24 01:20:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:32,809 INFO L225 Difference]: With dead ends: 378534 [2024-10-24 01:20:32,809 INFO L226 Difference]: Without dead ends: 252464 [2024-10-24 01:20:32,916 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-10-24 01:20:32,917 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 114 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:32,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 452 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252464 states. [2024-10-24 01:20:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252464 to 252462. [2024-10-24 01:20:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252462 states, 252461 states have (on average 1.4645232332914786) internal successors, (369735), 252461 states have internal predecessors, (369735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252462 states to 252462 states and 369735 transitions. [2024-10-24 01:20:37,986 INFO L78 Accepts]: Start accepts. Automaton has 252462 states and 369735 transitions. Word has length 99 [2024-10-24 01:20:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:37,986 INFO L471 AbstractCegarLoop]: Abstraction has 252462 states and 369735 transitions. [2024-10-24 01:20:37,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 252462 states and 369735 transitions. [2024-10-24 01:20:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:20:37,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:37,998 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:37,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:20:37,998 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:37,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash -614228151, now seen corresponding path program 1 times [2024-10-24 01:20:37,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:37,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949015361] [2024-10-24 01:20:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:37,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:20:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949015361] [2024-10-24 01:20:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949015361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:38,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:20:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773024558] [2024-10-24 01:20:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:20:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:20:38,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:20:38,130 INFO L87 Difference]: Start difference. First operand 252462 states and 369735 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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)