./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_lcr.7_overflow.ufo.UNBOUNDED.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_lcr.7_overflow.ufo.UNBOUNDED.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 de654b8e722eb26a01715e643a442ee96e677f28cab0e875133e4d1d7edb214d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:26:23,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:26:23,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:26:23,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:26:23,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:26:24,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:26:24,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:26:24,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:26:24,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:26:24,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:26:24,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:26:24,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:26:24,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:26:24,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:26:24,011 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:26:24,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:26:24,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:26:24,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:26:24,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:26:24,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:26:24,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:26:24,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:26:24,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:26:24,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:26:24,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:26:24,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:26:24,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:26:24,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:26:24,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:26:24,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:26:24,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:26:24,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:26:24,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:26:24,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:26:24,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:26:24,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:26:24,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:26:24,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:26:24,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:26:24,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:26:24,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:26:24,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:26:24,019 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 -> de654b8e722eb26a01715e643a442ee96e677f28cab0e875133e4d1d7edb214d [2024-10-24 01:26:24,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:26:24,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:26:24,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:26:24,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:26:24,286 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:26:24,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2024-10-24 01:26:25,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:26:25,918 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:26:25,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2024-10-24 01:26:25,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a62f2cb/a20eff875ec24cc3922b4f2de6d61625/FLAGc787c85be [2024-10-24 01:26:25,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a62f2cb/a20eff875ec24cc3922b4f2de6d61625 [2024-10-24 01:26:25,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:26:25,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:26:25,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:26:25,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:26:25,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:26:25,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:26:25" (1/1) ... [2024-10-24 01:26:25,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5580d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:25, skipping insertion in model container [2024-10-24 01:26:25,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:26:25" (1/1) ... [2024-10-24 01:26:26,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:26:26,301 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_lcr.7_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2024-10-24 01:26:26,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:26:26,323 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:26:26,376 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_lcr.7_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2024-10-24 01:26:26,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:26:26,400 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:26:26,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26 WrapperNode [2024-10-24 01:26:26,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:26:26,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:26:26,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:26:26,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:26:26,408 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:26:26" (1/1) ... [2024-10-24 01:26:26,418 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:26:26" (1/1) ... [2024-10-24 01:26:26,455 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 456 [2024-10-24 01:26:26,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:26:26,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:26:26,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:26:26,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:26:26,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,516 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:26:26,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:26:26,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:26:26,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:26:26,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:26:26,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (1/1) ... [2024-10-24 01:26:26,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:26:26,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:26:26,580 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:26:26,584 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:26:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:26:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:26:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:26:26,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:26:26,749 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:26:26,752 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:26:27,309 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-10-24 01:26:27,310 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:26:27,370 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:26:27,372 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:26:27,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:26:27 BoogieIcfgContainer [2024-10-24 01:26:27,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:26:27,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:26:27,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:26:27,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:26:27,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:26:25" (1/3) ... [2024-10-24 01:26:27,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5562ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:26:27, skipping insertion in model container [2024-10-24 01:26:27,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:26:26" (2/3) ... [2024-10-24 01:26:27,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5562ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:26:27, skipping insertion in model container [2024-10-24 01:26:27,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:26:27" (3/3) ... [2024-10-24 01:26:27,383 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2024-10-24 01:26:27,399 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:26:27,399 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:26:27,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:26:27,465 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;@817828a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:26:27,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:26:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 107 states have (on average 1.8224299065420562) internal successors, (195), 108 states have internal predecessors, (195), 0 states have call successors, (0), 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:26:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 01:26:27,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:27,481 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] [2024-10-24 01:26:27,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash 61708070, now seen corresponding path program 1 times [2024-10-24 01:26:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:27,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522109216] [2024-10-24 01:26:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:27,777 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:26:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:27,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522109216] [2024-10-24 01:26:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522109216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:27,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:26:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571314584] [2024-10-24 01:26:27,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:27,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:26:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:27,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:26:27,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:26:27,814 INFO L87 Difference]: Start difference. First operand has 109 states, 107 states have (on average 1.8224299065420562) internal successors, (195), 108 states have internal predecessors, (195), 0 states have call successors, (0), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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:26:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:27,858 INFO L93 Difference]: Finished difference Result 163 states and 285 transitions. [2024-10-24 01:26:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:26:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-24 01:26:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:27,873 INFO L225 Difference]: With dead ends: 163 [2024-10-24 01:26:27,873 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 01:26:27,876 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:26:27,880 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:27,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 01:26:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-24 01:26:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7924528301886793) internal successors, (190), 106 states have internal predecessors, (190), 0 states have call successors, (0), 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:26:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 190 transitions. [2024-10-24 01:26:27,929 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 190 transitions. Word has length 24 [2024-10-24 01:26:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:27,931 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 190 transitions. [2024-10-24 01:26:27,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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:26:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2024-10-24 01:26:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 01:26:27,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:27,934 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] [2024-10-24 01:26:27,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:26:27,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:27,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:27,935 INFO L85 PathProgramCache]: Analyzing trace with hash 484409896, now seen corresponding path program 1 times [2024-10-24 01:26:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956770874] [2024-10-24 01:26:27,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:28,130 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:26:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956770874] [2024-10-24 01:26:28,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956770874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:28,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:28,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:26:28,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892207168] [2024-10-24 01:26:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:26:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:28,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:26:28,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:26:28,137 INFO L87 Difference]: Start difference. First operand 107 states and 190 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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:26:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:28,247 INFO L93 Difference]: Finished difference Result 163 states and 279 transitions. [2024-10-24 01:26:28,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:26:28,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-24 01:26:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:28,250 INFO L225 Difference]: With dead ends: 163 [2024-10-24 01:26:28,250 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 01:26:28,251 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:26:28,252 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:28,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:26:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 01:26:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-24 01:26:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 0 states have call successors, (0), 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:26:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2024-10-24 01:26:28,267 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 24 [2024-10-24 01:26:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:28,267 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2024-10-24 01:26:28,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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:26:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2024-10-24 01:26:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:26:28,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:28,270 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] [2024-10-24 01:26:28,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:26:28,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:28,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:28,271 INFO L85 PathProgramCache]: Analyzing trace with hash 456528988, now seen corresponding path program 1 times [2024-10-24 01:26:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:28,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336464325] [2024-10-24 01:26:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:28,655 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:26:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336464325] [2024-10-24 01:26:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336464325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:28,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:28,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:26:28,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808338332] [2024-10-24 01:26:28,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:28,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:26:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:28,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:26:28,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:26:28,662 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 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:26:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:29,166 INFO L93 Difference]: Finished difference Result 849 states and 1344 transitions. [2024-10-24 01:26:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:26:29,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-24 01:26:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:29,175 INFO L225 Difference]: With dead ends: 849 [2024-10-24 01:26:29,176 INFO L226 Difference]: Without dead ends: 796 [2024-10-24 01:26:29,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:26:29,179 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1483 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:29,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 2989 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:26:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-10-24 01:26:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 158. [2024-10-24 01:26:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4203821656050954) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:26:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-10-24 01:26:29,216 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 73 [2024-10-24 01:26:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:29,216 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-10-24 01:26:29,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 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:26:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-10-24 01:26:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:26:29,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:29,221 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:26:29,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:26:29,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash -122926772, now seen corresponding path program 1 times [2024-10-24 01:26:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:29,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500959458] [2024-10-24 01:26:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:26:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:29,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500959458] [2024-10-24 01:26:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500959458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:26:29,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791638206] [2024-10-24 01:26:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:26:29,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:26:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:26:29,392 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:26:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:29,421 INFO L93 Difference]: Finished difference Result 355 states and 542 transitions. [2024-10-24 01:26:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:26:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:26:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:29,424 INFO L225 Difference]: With dead ends: 355 [2024-10-24 01:26:29,424 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 01:26:29,424 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:26:29,425 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 58 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:29,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 01:26:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-10-24 01:26:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4879032258064515) internal successors, (369), 248 states have internal predecessors, (369), 0 states have call successors, (0), 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:26:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 369 transitions. [2024-10-24 01:26:29,445 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 369 transitions. Word has length 75 [2024-10-24 01:26:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:29,446 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 369 transitions. [2024-10-24 01:26:29,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:26:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2024-10-24 01:26:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:26:29,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:29,449 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:26:29,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:26:29,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:29,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash -120781820, now seen corresponding path program 1 times [2024-10-24 01:26:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:29,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245357332] [2024-10-24 01:26:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:29,909 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:26:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:29,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245357332] [2024-10-24 01:26:29,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245357332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:29,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:29,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:26:29,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225451968] [2024-10-24 01:26:29,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:29,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:26:29,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:29,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:26:29,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:26:29,912 INFO L87 Difference]: Start difference. First operand 249 states and 369 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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:26:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:30,287 INFO L93 Difference]: Finished difference Result 446 states and 685 transitions. [2024-10-24 01:26:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:26:30,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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:26:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:30,291 INFO L225 Difference]: With dead ends: 446 [2024-10-24 01:26:30,291 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 01:26:30,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:26:30,295 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 414 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:30,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 620 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:26:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 01:26:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-10-24 01:26:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4798387096774193) internal successors, (367), 248 states have internal predecessors, (367), 0 states have call successors, (0), 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:26:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 367 transitions. [2024-10-24 01:26:30,310 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 367 transitions. Word has length 75 [2024-10-24 01:26:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:30,311 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 367 transitions. [2024-10-24 01:26:30,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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:26:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 367 transitions. [2024-10-24 01:26:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:26:30,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:30,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:26:30,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:26:30,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:30,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 536658470, now seen corresponding path program 1 times [2024-10-24 01:26:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:30,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323997665] [2024-10-24 01:26:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:30,508 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:26:30,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:30,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323997665] [2024-10-24 01:26:30,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323997665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:30,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:30,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:26:30,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166079500] [2024-10-24 01:26:30,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:30,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:26:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:30,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:26:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:26:30,512 INFO L87 Difference]: Start difference. First operand 249 states and 367 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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:26:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:30,535 INFO L93 Difference]: Finished difference Result 255 states and 374 transitions. [2024-10-24 01:26:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:26:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:26:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:30,538 INFO L225 Difference]: With dead ends: 255 [2024-10-24 01:26:30,541 INFO L226 Difference]: Without dead ends: 253 [2024-10-24 01:26:30,541 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:26:30,542 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:30,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-24 01:26:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-24 01:26:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4682539682539681) internal successors, (370), 252 states have internal predecessors, (370), 0 states have call successors, (0), 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:26:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 370 transitions. [2024-10-24 01:26:30,551 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 370 transitions. Word has length 76 [2024-10-24 01:26:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:30,552 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 370 transitions. [2024-10-24 01:26:30,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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:26:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 370 transitions. [2024-10-24 01:26:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:26:30,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:30,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:26:30,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:26:30,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:30,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1846932892, now seen corresponding path program 1 times [2024-10-24 01:26:30,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:30,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559309170] [2024-10-24 01:26:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:30,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:30,636 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:26:30,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:30,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559309170] [2024-10-24 01:26:30,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559309170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:30,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:30,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:26:30,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726683326] [2024-10-24 01:26:30,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:30,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:26:30,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:30,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:26:30,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:26:30,638 INFO L87 Difference]: Start difference. First operand 253 states and 370 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:30,665 INFO L93 Difference]: Finished difference Result 463 states and 703 transitions. [2024-10-24 01:26:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:26:30,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:26:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:30,667 INFO L225 Difference]: With dead ends: 463 [2024-10-24 01:26:30,667 INFO L226 Difference]: Without dead ends: 355 [2024-10-24 01:26:30,668 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:26:30,670 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 76 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:30,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-24 01:26:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2024-10-24 01:26:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.4971590909090908) internal successors, (527), 352 states have internal predecessors, (527), 0 states have call successors, (0), 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:26:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 527 transitions. [2024-10-24 01:26:30,683 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 527 transitions. Word has length 77 [2024-10-24 01:26:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:30,683 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 527 transitions. [2024-10-24 01:26:30,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 527 transitions. [2024-10-24 01:26:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:26:30,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:30,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:26:30,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:26:30,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:30,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:30,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1501935516, now seen corresponding path program 1 times [2024-10-24 01:26:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:30,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120563369] [2024-10-24 01:26:30,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:30,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:26:30,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120563369] [2024-10-24 01:26:30,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120563369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:30,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:30,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:26:30,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319544633] [2024-10-24 01:26:30,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:30,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:26:30,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:30,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:26:30,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:26:30,755 INFO L87 Difference]: Start difference. First operand 353 states and 527 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:30,784 INFO L93 Difference]: Finished difference Result 923 states and 1427 transitions. [2024-10-24 01:26:30,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:26:30,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:26:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:30,788 INFO L225 Difference]: With dead ends: 923 [2024-10-24 01:26:30,788 INFO L226 Difference]: Without dead ends: 626 [2024-10-24 01:26:30,789 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:26:30,790 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 72 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:30,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-10-24 01:26:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2024-10-24 01:26:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.5232744783306582) internal successors, (949), 623 states have internal predecessors, (949), 0 states have call successors, (0), 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:26:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 949 transitions. [2024-10-24 01:26:30,805 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 949 transitions. Word has length 77 [2024-10-24 01:26:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:30,806 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 949 transitions. [2024-10-24 01:26:30,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 949 transitions. [2024-10-24 01:26:30,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:26:30,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:26:30,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:26:30,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:30,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:30,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1770518684, now seen corresponding path program 1 times [2024-10-24 01:26:30,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:30,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616641367] [2024-10-24 01:26:30,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:30,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:30,882 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:26:30,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:30,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616641367] [2024-10-24 01:26:30,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616641367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:30,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:30,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:26:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252236692] [2024-10-24 01:26:30,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:30,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:26:30,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:30,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:26:30,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:26:30,885 INFO L87 Difference]: Start difference. First operand 624 states and 949 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:30,915 INFO L93 Difference]: Finished difference Result 1712 states and 2651 transitions. [2024-10-24 01:26:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:26:30,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:26:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:30,920 INFO L225 Difference]: With dead ends: 1712 [2024-10-24 01:26:30,920 INFO L226 Difference]: Without dead ends: 1144 [2024-10-24 01:26:30,921 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:26:30,922 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 70 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:30,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-10-24 01:26:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1142. [2024-10-24 01:26:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 1.5293602103418054) internal successors, (1745), 1141 states have internal predecessors, (1745), 0 states have call successors, (0), 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:26:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1745 transitions. [2024-10-24 01:26:30,949 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1745 transitions. Word has length 77 [2024-10-24 01:26:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:30,950 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1745 transitions. [2024-10-24 01:26:30,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1745 transitions. [2024-10-24 01:26:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:26:30,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:30,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:26:30,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:26:30,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:30,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:30,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1938736484, now seen corresponding path program 1 times [2024-10-24 01:26:30,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:30,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119657851] [2024-10-24 01:26:30,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:30,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:31,022 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:26:31,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:31,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119657851] [2024-10-24 01:26:31,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119657851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:31,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:31,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:26:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094694318] [2024-10-24 01:26:31,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:31,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:26:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:31,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:26:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:26:31,025 INFO L87 Difference]: Start difference. First operand 1142 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:31,072 INFO L93 Difference]: Finished difference Result 3218 states and 4955 transitions. [2024-10-24 01:26:31,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:26:31,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:26:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:31,079 INFO L225 Difference]: With dead ends: 3218 [2024-10-24 01:26:31,080 INFO L226 Difference]: Without dead ends: 2132 [2024-10-24 01:26:31,081 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:26:31,082 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:31,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2024-10-24 01:26:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2130. [2024-10-24 01:26:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2129 states have (on average 1.5223109441052136) internal successors, (3241), 2129 states have internal predecessors, (3241), 0 states have call successors, (0), 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:26:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3241 transitions. [2024-10-24 01:26:31,133 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3241 transitions. Word has length 77 [2024-10-24 01:26:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 3241 transitions. [2024-10-24 01:26:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3241 transitions. [2024-10-24 01:26:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:26:31,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:31,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:26:31,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:26:31,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1467497372, now seen corresponding path program 1 times [2024-10-24 01:26:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465204489] [2024-10-24 01:26:31,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:31,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:31,192 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:26:31,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:31,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465204489] [2024-10-24 01:26:31,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465204489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:31,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:31,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:26:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701120943] [2024-10-24 01:26:31,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:31,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:26:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:31,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:26:31,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:26:31,195 INFO L87 Difference]: Start difference. First operand 2130 states and 3241 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:31,265 INFO L93 Difference]: Finished difference Result 6086 states and 9275 transitions. [2024-10-24 01:26:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:26:31,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:26:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:31,279 INFO L225 Difference]: With dead ends: 6086 [2024-10-24 01:26:31,279 INFO L226 Difference]: Without dead ends: 4012 [2024-10-24 01:26:31,282 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:26:31,283 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 64 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:31,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2024-10-24 01:26:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 4010. [2024-10-24 01:26:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 4009 states have (on average 1.5068595659765527) internal successors, (6041), 4009 states have internal predecessors, (6041), 0 states have call successors, (0), 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:26:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 6041 transitions. [2024-10-24 01:26:31,437 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 6041 transitions. Word has length 77 [2024-10-24 01:26:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:31,438 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 6041 transitions. [2024-10-24 01:26:31,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 6041 transitions. [2024-10-24 01:26:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:26:31,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:31,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:26:31,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:26:31,439 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:31,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1730574748, now seen corresponding path program 1 times [2024-10-24 01:26:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:31,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835067063] [2024-10-24 01:26:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:31,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:31,503 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:26:31,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:31,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835067063] [2024-10-24 01:26:31,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835067063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:31,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:31,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:26:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150440588] [2024-10-24 01:26:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:31,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:26:31,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:31,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:26:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:26:31,506 INFO L87 Difference]: Start difference. First operand 4010 states and 6041 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:31,634 INFO L93 Difference]: Finished difference Result 11534 states and 17339 transitions. [2024-10-24 01:26:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:26:31,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:26:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:31,664 INFO L225 Difference]: With dead ends: 11534 [2024-10-24 01:26:31,664 INFO L226 Difference]: Without dead ends: 7580 [2024-10-24 01:26:31,672 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:26:31,673 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 68 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:31,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 297 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7580 states. [2024-10-24 01:26:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7580 to 7578. [2024-10-24 01:26:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.4856803484228587) internal successors, (11257), 7577 states have internal predecessors, (11257), 0 states have call successors, (0), 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:26:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11257 transitions. [2024-10-24 01:26:31,929 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11257 transitions. Word has length 77 [2024-10-24 01:26:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:31,930 INFO L471 AbstractCegarLoop]: Abstraction has 7578 states and 11257 transitions. [2024-10-24 01:26:31,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11257 transitions. [2024-10-24 01:26:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:26:31,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:31,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:26:31,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:26:31,931 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:31,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1091548828, now seen corresponding path program 1 times [2024-10-24 01:26:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551015115] [2024-10-24 01:26:31,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:31,993 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:26:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551015115] [2024-10-24 01:26:31,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551015115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:31,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:31,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:26:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998163974] [2024-10-24 01:26:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:31,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:26:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:26:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:26:31,996 INFO L87 Difference]: Start difference. First operand 7578 states and 11257 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:32,285 INFO L93 Difference]: Finished difference Result 21854 states and 32315 transitions. [2024-10-24 01:26:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:26:32,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:26:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:32,344 INFO L225 Difference]: With dead ends: 21854 [2024-10-24 01:26:32,345 INFO L226 Difference]: Without dead ends: 14332 [2024-10-24 01:26:32,357 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:26:32,360 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 74 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:32,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 299 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:26:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14332 states. [2024-10-24 01:26:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14332 to 14330. [2024-10-24 01:26:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14330 states, 14329 states have (on average 1.4600460604368763) internal successors, (20921), 14329 states have internal predecessors, (20921), 0 states have call successors, (0), 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:26:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14330 states to 14330 states and 20921 transitions. [2024-10-24 01:26:32,890 INFO L78 Accepts]: Start accepts. Automaton has 14330 states and 20921 transitions. Word has length 77 [2024-10-24 01:26:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:32,891 INFO L471 AbstractCegarLoop]: Abstraction has 14330 states and 20921 transitions. [2024-10-24 01:26:32,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:26:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 14330 states and 20921 transitions. [2024-10-24 01:26:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:26:32,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:32,899 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:26:32,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:26:32,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:32,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1778428204, now seen corresponding path program 1 times [2024-10-24 01:26:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:32,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687378514] [2024-10-24 01:26:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:33,185 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:26:33,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:33,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687378514] [2024-10-24 01:26:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687378514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:33,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:26:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163643418] [2024-10-24 01:26:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:33,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:26:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:33,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:26:33,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:26:33,188 INFO L87 Difference]: Start difference. First operand 14330 states and 20921 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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) [2024-10-24 01:26:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:35,165 INFO L93 Difference]: Finished difference Result 112842 states and 164865 transitions. [2024-10-24 01:26:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:26:35,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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) Word has length 99 [2024-10-24 01:26:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:35,498 INFO L225 Difference]: With dead ends: 112842 [2024-10-24 01:26:35,498 INFO L226 Difference]: Without dead ends: 102856 [2024-10-24 01:26:35,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:26:35,566 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1215 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:35,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1468 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:26:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102856 states. [2024-10-24 01:26:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102856 to 26490. [2024-10-24 01:26:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26490 states, 26489 states have (on average 1.454226282607875) internal successors, (38521), 26489 states have internal predecessors, (38521), 0 states have call successors, (0), 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:26:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26490 states to 26490 states and 38521 transitions. [2024-10-24 01:26:37,266 INFO L78 Accepts]: Start accepts. Automaton has 26490 states and 38521 transitions. Word has length 99 [2024-10-24 01:26:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:37,266 INFO L471 AbstractCegarLoop]: Abstraction has 26490 states and 38521 transitions. [2024-10-24 01:26:37,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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) [2024-10-24 01:26:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 26490 states and 38521 transitions. [2024-10-24 01:26:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:26:37,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:37,272 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:26:37,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:26:37,273 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:37,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1433430828, now seen corresponding path program 1 times [2024-10-24 01:26:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61551599] [2024-10-24 01:26:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:26:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61551599] [2024-10-24 01:26:37,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61551599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:37,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:37,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:26:37,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723436558] [2024-10-24 01:26:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:37,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:26:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:37,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:26:37,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:26:37,524 INFO L87 Difference]: Start difference. First operand 26490 states and 38521 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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:26:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:39,416 INFO L93 Difference]: Finished difference Result 127114 states and 185601 transitions. [2024-10-24 01:26:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:26:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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:26:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:39,709 INFO L225 Difference]: With dead ends: 127114 [2024-10-24 01:26:39,709 INFO L226 Difference]: Without dead ends: 112840 [2024-10-24 01:26:39,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:26:39,749 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1282 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:39,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1499 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:26:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112840 states. [2024-10-24 01:26:41,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112840 to 45754. [2024-10-24 01:26:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45754 states, 45753 states have (on average 1.4504185517889536) internal successors, (66361), 45753 states have internal predecessors, (66361), 0 states have call successors, (0), 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:26:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45754 states to 45754 states and 66361 transitions. [2024-10-24 01:26:42,121 INFO L78 Accepts]: Start accepts. Automaton has 45754 states and 66361 transitions. Word has length 99 [2024-10-24 01:26:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:42,121 INFO L471 AbstractCegarLoop]: Abstraction has 45754 states and 66361 transitions. [2024-10-24 01:26:42,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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:26:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 45754 states and 66361 transitions. [2024-10-24 01:26:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:26:42,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:42,129 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:26:42,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:26:42,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:42,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:42,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1702013996, now seen corresponding path program 1 times [2024-10-24 01:26:42,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:42,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061930351] [2024-10-24 01:26:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:42,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:26:42,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:42,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061930351] [2024-10-24 01:26:42,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061930351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:42,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:42,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:26:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783562468] [2024-10-24 01:26:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:42,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:26:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:26:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:26:42,388 INFO L87 Difference]: Start difference. First operand 45754 states and 66361 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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:26:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:44,631 INFO L93 Difference]: Finished difference Result 141386 states and 206273 transitions. [2024-10-24 01:26:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:26:44,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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:26:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:44,860 INFO L225 Difference]: With dead ends: 141386 [2024-10-24 01:26:44,861 INFO L226 Difference]: Without dead ends: 127112 [2024-10-24 01:26:44,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:26:44,935 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 1377 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:44,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 1396 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:26:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127112 states. [2024-10-24 01:26:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127112 to 60026. [2024-10-24 01:26:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60026 states, 60025 states have (on average 1.4499458558933778) internal successors, (87033), 60025 states have internal predecessors, (87033), 0 states have call successors, (0), 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:26:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60026 states to 60026 states and 87033 transitions. [2024-10-24 01:26:47,081 INFO L78 Accepts]: Start accepts. Automaton has 60026 states and 87033 transitions. Word has length 99 [2024-10-24 01:26:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:47,082 INFO L471 AbstractCegarLoop]: Abstraction has 60026 states and 87033 transitions. [2024-10-24 01:26:47,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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:26:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 60026 states and 87033 transitions. [2024-10-24 01:26:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:26:47,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:47,090 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:26:47,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:26:47,093 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:47,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2007241172, now seen corresponding path program 1 times [2024-10-24 01:26:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:47,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983377136] [2024-10-24 01:26:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:26:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:47,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983377136] [2024-10-24 01:26:47,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983377136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:47,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:47,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:26:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368812997] [2024-10-24 01:26:47,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:47,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:26:47,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:47,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:26:47,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:26:47,495 INFO L87 Difference]: Start difference. First operand 60026 states and 87033 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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:26:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:50,228 INFO L93 Difference]: Finished difference Result 155658 states and 226945 transitions. [2024-10-24 01:26:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:26:50,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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:26:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:50,533 INFO L225 Difference]: With dead ends: 155658 [2024-10-24 01:26:50,534 INFO L226 Difference]: Without dead ends: 141384 [2024-10-24 01:26:50,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:26:50,560 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1460 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:50,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 1426 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:26:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141384 states. [2024-10-24 01:26:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141384 to 74298. [2024-10-24 01:26:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74298 states, 74297 states have (on average 1.4496547639877788) internal successors, (107705), 74297 states have internal predecessors, (107705), 0 states have call successors, (0), 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:26:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74298 states to 74298 states and 107705 transitions. [2024-10-24 01:26:53,118 INFO L78 Accepts]: Start accepts. Automaton has 74298 states and 107705 transitions. Word has length 99 [2024-10-24 01:26:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:53,119 INFO L471 AbstractCegarLoop]: Abstraction has 74298 states and 107705 transitions. [2024-10-24 01:26:53,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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:26:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 74298 states and 107705 transitions. [2024-10-24 01:26:53,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:26:53,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:53,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:26:53,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:26:53,128 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:53,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1398992684, now seen corresponding path program 1 times [2024-10-24 01:26:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135964721] [2024-10-24 01:26:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:26:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 01:26:53,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:26:53,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135964721] [2024-10-24 01:26:53,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135964721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:26:53,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:26:53,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:26:53,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322101208] [2024-10-24 01:26:53,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:26:53,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:26:53,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:26:53,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:26:53,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:26:53,607 INFO L87 Difference]: Start difference. First operand 74298 states and 107705 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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:26:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:26:56,688 INFO L93 Difference]: Finished difference Result 169930 states and 247617 transitions. [2024-10-24 01:26:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:26:56,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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:26:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:26:56,930 INFO L225 Difference]: With dead ends: 169930 [2024-10-24 01:26:56,930 INFO L226 Difference]: Without dead ends: 155656 [2024-10-24 01:26:56,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:26:56,962 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1331 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:26:56,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1457 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:26:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155656 states. [2024-10-24 01:26:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155656 to 88570. [2024-10-24 01:26:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88570 states, 88569 states have (on average 1.449457485124592) internal successors, (128377), 88569 states have internal predecessors, (128377), 0 states have call successors, (0), 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:26:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88570 states to 88570 states and 128377 transitions. [2024-10-24 01:26:59,890 INFO L78 Accepts]: Start accepts. Automaton has 88570 states and 128377 transitions. Word has length 99 [2024-10-24 01:26:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:26:59,891 INFO L471 AbstractCegarLoop]: Abstraction has 88570 states and 128377 transitions. [2024-10-24 01:26:59,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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:26:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 88570 states and 128377 transitions. [2024-10-24 01:26:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:26:59,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:26:59,900 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:26:59,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:26:59,900 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:26:59,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:26:59,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1662070060, now seen corresponding path program 1 times [2024-10-24 01:26:59,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:26:59,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911287946] [2024-10-24 01:26:59,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:26:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:26:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 01:27:00,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:00,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911287946] [2024-10-24 01:27:00,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911287946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:00,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:00,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:27:00,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76319326] [2024-10-24 01:27:00,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:00,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:27:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:27:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:27:00,157 INFO L87 Difference]: Start difference. First operand 88570 states and 128377 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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:27:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:04,112 INFO L93 Difference]: Finished difference Result 184202 states and 268289 transitions. [2024-10-24 01:27:04,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:27:04,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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:27:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:04,387 INFO L225 Difference]: With dead ends: 184202 [2024-10-24 01:27:04,388 INFO L226 Difference]: Without dead ends: 169928 [2024-10-24 01:27:04,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:27:04,426 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1213 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:04,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 1621 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169928 states. [2024-10-24 01:27:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169928 to 102842. [2024-10-24 01:27:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102842 states, 102841 states have (on average 1.4493149619315253) internal successors, (149049), 102841 states have internal predecessors, (149049), 0 states have call successors, (0), 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:27:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102842 states to 102842 states and 149049 transitions. [2024-10-24 01:27:08,008 INFO L78 Accepts]: Start accepts. Automaton has 102842 states and 149049 transitions. Word has length 99 [2024-10-24 01:27:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:08,009 INFO L471 AbstractCegarLoop]: Abstraction has 102842 states and 149049 transitions. [2024-10-24 01:27:08,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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:27:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 102842 states and 149049 transitions. [2024-10-24 01:27:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:27:08,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:08,017 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:27:08,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:27:08,017 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:08,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1023044140, now seen corresponding path program 1 times [2024-10-24 01:27:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:08,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422790493] [2024-10-24 01:27:08,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:27:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:08,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422790493] [2024-10-24 01:27:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422790493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:08,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:08,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:27:08,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777995389] [2024-10-24 01:27:08,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:08,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:27:08,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:08,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:27:08,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:27:08,249 INFO L87 Difference]: Start difference. First operand 102842 states and 149049 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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:27:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:12,472 INFO L93 Difference]: Finished difference Result 198474 states and 288961 transitions. [2024-10-24 01:27:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:27:12,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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:27:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:12,776 INFO L225 Difference]: With dead ends: 198474 [2024-10-24 01:27:12,776 INFO L226 Difference]: Without dead ends: 184200 [2024-10-24 01:27:12,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:27:12,814 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1217 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:12,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1736 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:27:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184200 states.