./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_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6cc7ef7e5cfcea54541e5555a1065ebb68875de99e452e2755d94724a415589e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:27:29,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:27:29,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:27:29,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:27:29,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:27:29,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:27:29,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:27:29,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:27:29,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:27:29,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:27:29,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:27:29,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:27:29,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:27:29,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:27:29,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:27:29,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:27:29,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:27:29,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:27:29,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:27:29,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:27:29,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:27:29,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:27:29,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:27:29,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:27:29,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:27:29,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:27:29,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:27:29,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:27:29,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:27:29,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:27:29,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:27:29,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:27:29,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:27:29,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:27:29,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:27:29,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:27:29,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:27:29,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:27:29,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:27:29,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:27:29,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:27:29,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:27:29,320 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-clean/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-clean/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 -> 6cc7ef7e5cfcea54541e5555a1065ebb68875de99e452e2755d94724a415589e [2024-10-11 03:27:29,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:27:29,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:27:29,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:27:29,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:27:29,665 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:27:29,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c [2024-10-11 03:27:31,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:27:31,453 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:27:31,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c [2024-10-11 03:27:31,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e53ac41ce/85b74e98d6044e5ca84f78b0ef878daf/FLAGedb00bc78 [2024-10-11 03:27:31,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e53ac41ce/85b74e98d6044e5ca84f78b0ef878daf [2024-10-11 03:27:31,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:27:31,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:27:31,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:27:31,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:27:31,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:27:31,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:27:31" (1/1) ... [2024-10-11 03:27:31,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf3ab8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:31, skipping insertion in model container [2024-10-11 03:27:31,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:27:31" (1/1) ... [2024-10-11 03:27:31,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:27:32,034 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_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c[65471,65484] [2024-10-11 03:27:32,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:27:32,058 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:27:32,166 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_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c[65471,65484] [2024-10-11 03:27:32,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:27:32,202 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:27:32,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32 WrapperNode [2024-10-11 03:27:32,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:27:32,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:27:32,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:27:32,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:27:32,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,315 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2140 [2024-10-11 03:27:32,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:27:32,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:27:32,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:27:32,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:27:32,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,394 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-11 03:27:32,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:27:32,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:27:32,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:27:32,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:27:32,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (1/1) ... [2024-10-11 03:27:32,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:27:32,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:27:32,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:27:32,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:27:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:27:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:27:32,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:27:32,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:27:32,864 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:27:32,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:27:34,828 INFO L? ?]: Removed 240 outVars from TransFormulas that were not future-live. [2024-10-11 03:27:34,830 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:27:34,951 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:27:34,951 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:27:34,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:27:34 BoogieIcfgContainer [2024-10-11 03:27:34,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:27:34,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:27:34,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:27:34,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:27:34,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:27:31" (1/3) ... [2024-10-11 03:27:34,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8a1b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:27:34, skipping insertion in model container [2024-10-11 03:27:34,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:27:32" (2/3) ... [2024-10-11 03:27:34,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8a1b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:27:34, skipping insertion in model container [2024-10-11 03:27:34,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:27:34" (3/3) ... [2024-10-11 03:27:34,962 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c [2024-10-11 03:27:34,979 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:27:34,979 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:27:35,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:27:35,094 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;@2b4f93bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:27:35,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:27:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 691 states, 689 states have (on average 1.876632801161103) internal successors, (1293), 690 states have internal predecessors, (1293), 0 states have call successors, (0), 0 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-11 03:27:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:27:35,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:35,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:35,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:35,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash 213064800, now seen corresponding path program 1 times [2024-10-11 03:27:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:35,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418611350] [2024-10-11 03:27:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:35,899 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-11 03:27:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418611350] [2024-10-11 03:27:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418611350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:35,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:27:35,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757009433] [2024-10-11 03:27:35,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:35,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:27:35,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:27:35,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:27:35,941 INFO L87 Difference]: Start difference. First operand has 691 states, 689 states have (on average 1.876632801161103) internal successors, (1293), 690 states have internal predecessors, (1293), 0 states have call successors, (0), 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 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:36,047 INFO L93 Difference]: Finished difference Result 834 states and 1552 transitions. [2024-10-11 03:27:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:27:36,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-11 03:27:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:36,086 INFO L225 Difference]: With dead ends: 834 [2024-10-11 03:27:36,086 INFO L226 Difference]: Without dead ends: 689 [2024-10-11 03:27:36,091 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-11 03:27:36,095 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:36,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1286 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:27:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-11 03:27:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2024-10-11 03:27:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.872093023255814) internal successors, (1288), 688 states have internal predecessors, (1288), 0 states have call successors, (0), 0 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-11 03:27:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1288 transitions. [2024-10-11 03:27:36,193 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1288 transitions. Word has length 150 [2024-10-11 03:27:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:36,194 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1288 transitions. [2024-10-11 03:27:36,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1288 transitions. [2024-10-11 03:27:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:27:36,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:36,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:36,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:27:36,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:36,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:36,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2136292834, now seen corresponding path program 1 times [2024-10-11 03:27:36,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:36,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534759389] [2024-10-11 03:27:36,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:36,801 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-11 03:27:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534759389] [2024-10-11 03:27:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534759389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:27:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220300921] [2024-10-11 03:27:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:36,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:27:36,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:36,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:27:36,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:27:36,810 INFO L87 Difference]: Start difference. First operand 689 states and 1288 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:36,981 INFO L93 Difference]: Finished difference Result 832 states and 1545 transitions. [2024-10-11 03:27:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:27:36,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-11 03:27:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:36,988 INFO L225 Difference]: With dead ends: 832 [2024-10-11 03:27:36,989 INFO L226 Difference]: Without dead ends: 689 [2024-10-11 03:27:36,990 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-11 03:27:36,992 INFO L432 NwaCegarLoop]: 1285 mSDtfsCounter, 0 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3787 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:36,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3787 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:27:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-11 03:27:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2024-10-11 03:27:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.7776162790697674) internal successors, (1223), 688 states have internal predecessors, (1223), 0 states have call successors, (0), 0 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-11 03:27:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1223 transitions. [2024-10-11 03:27:37,024 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1223 transitions. Word has length 150 [2024-10-11 03:27:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:37,024 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1223 transitions. [2024-10-11 03:27:37,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1223 transitions. [2024-10-11 03:27:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 03:27:37,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:37,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:37,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:27:37,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:37,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:37,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1498037184, now seen corresponding path program 1 times [2024-10-11 03:27:37,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:37,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904123538] [2024-10-11 03:27:37,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:37,386 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-11 03:27:37,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:37,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904123538] [2024-10-11 03:27:37,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904123538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:37,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:37,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:37,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801186728] [2024-10-11 03:27:37,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:37,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:37,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:37,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:37,394 INFO L87 Difference]: Start difference. First operand 689 states and 1223 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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-11 03:27:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:37,512 INFO L93 Difference]: Finished difference Result 955 states and 1705 transitions. [2024-10-11 03:27:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:37,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2024-10-11 03:27:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:37,519 INFO L225 Difference]: With dead ends: 955 [2024-10-11 03:27:37,520 INFO L226 Difference]: Without dead ends: 815 [2024-10-11 03:27:37,522 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-11 03:27:37,525 INFO L432 NwaCegarLoop]: 1219 mSDtfsCounter, 220 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:37,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2374 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:27:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-10-11 03:27:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 813. [2024-10-11 03:27:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 812 states have (on average 1.7795566502463054) internal successors, (1445), 812 states have internal predecessors, (1445), 0 states have call successors, (0), 0 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-11 03:27:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1445 transitions. [2024-10-11 03:27:37,548 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1445 transitions. Word has length 214 [2024-10-11 03:27:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:37,550 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1445 transitions. [2024-10-11 03:27:37,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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-11 03:27:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1445 transitions. [2024-10-11 03:27:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 03:27:37,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:37,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:37,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:27:37,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:37,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:37,556 INFO L85 PathProgramCache]: Analyzing trace with hash 843594662, now seen corresponding path program 1 times [2024-10-11 03:27:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:37,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999734611] [2024-10-11 03:27:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:37,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:37,850 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-11 03:27:37,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:37,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999734611] [2024-10-11 03:27:37,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999734611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:37,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:37,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:37,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102477199] [2024-10-11 03:27:37,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:37,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:37,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:37,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:37,857 INFO L87 Difference]: Start difference. First operand 813 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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-11 03:27:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:37,985 INFO L93 Difference]: Finished difference Result 1317 states and 2353 transitions. [2024-10-11 03:27:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2024-10-11 03:27:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:37,992 INFO L225 Difference]: With dead ends: 1317 [2024-10-11 03:27:37,992 INFO L226 Difference]: Without dead ends: 1053 [2024-10-11 03:27:37,993 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-11 03:27:37,994 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 220 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:37,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2382 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:27:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-10-11 03:27:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1051. [2024-10-11 03:27:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.7847619047619048) internal successors, (1874), 1050 states have internal predecessors, (1874), 0 states have call successors, (0), 0 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-11 03:27:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1874 transitions. [2024-10-11 03:27:38,043 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1874 transitions. Word has length 218 [2024-10-11 03:27:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:38,044 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1874 transitions. [2024-10-11 03:27:38,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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-11 03:27:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1874 transitions. [2024-10-11 03:27:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 03:27:38,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:38,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:38,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:27:38,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:38,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1319265996, now seen corresponding path program 1 times [2024-10-11 03:27:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:38,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507154383] [2024-10-11 03:27:38,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:38,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:38,359 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-11 03:27:38,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507154383] [2024-10-11 03:27:38,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507154383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:38,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:38,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:38,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204570831] [2024-10-11 03:27:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:38,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:38,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:38,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:38,365 INFO L87 Difference]: Start difference. First operand 1051 states and 1874 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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-11 03:27:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:38,433 INFO L93 Difference]: Finished difference Result 2007 states and 3596 transitions. [2024-10-11 03:27:38,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:38,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2024-10-11 03:27:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:38,440 INFO L225 Difference]: With dead ends: 2007 [2024-10-11 03:27:38,441 INFO L226 Difference]: Without dead ends: 1505 [2024-10-11 03:27:38,442 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-11 03:27:38,445 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 212 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:38,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 2383 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:27:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-11 03:27:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2024-10-11 03:27:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1502 states have (on average 1.7882822902796272) internal successors, (2686), 1502 states have internal predecessors, (2686), 0 states have call successors, (0), 0 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-11 03:27:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2686 transitions. [2024-10-11 03:27:38,485 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2686 transitions. Word has length 222 [2024-10-11 03:27:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:38,485 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 2686 transitions. [2024-10-11 03:27:38,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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-11 03:27:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2686 transitions. [2024-10-11 03:27:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-11 03:27:38,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:38,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:38,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:27:38,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:38,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:38,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1204960562, now seen corresponding path program 1 times [2024-10-11 03:27:38,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:38,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929089273] [2024-10-11 03:27:38,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:38,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:38,757 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-11 03:27:38,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:38,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929089273] [2024-10-11 03:27:38,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929089273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:38,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:38,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:38,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990271342] [2024-10-11 03:27:38,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:38,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:38,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:38,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:38,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:38,760 INFO L87 Difference]: Start difference. First operand 1503 states and 2686 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:38,827 INFO L93 Difference]: Finished difference Result 3315 states and 5944 transitions. [2024-10-11 03:27:38,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:38,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2024-10-11 03:27:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:38,837 INFO L225 Difference]: With dead ends: 3315 [2024-10-11 03:27:38,838 INFO L226 Difference]: Without dead ends: 2361 [2024-10-11 03:27:38,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:38,840 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 204 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:38,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 2384 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:27:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-10-11 03:27:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2359. [2024-10-11 03:27:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2358 states have (on average 1.7888040712468194) internal successors, (4218), 2358 states have internal predecessors, (4218), 0 states have call successors, (0), 0 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-11 03:27:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4218 transitions. [2024-10-11 03:27:38,896 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4218 transitions. Word has length 226 [2024-10-11 03:27:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:38,897 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 4218 transitions. [2024-10-11 03:27:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4218 transitions. [2024-10-11 03:27:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 03:27:38,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:38,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:38,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:27:38,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:38,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -870236456, now seen corresponding path program 1 times [2024-10-11 03:27:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:38,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789577975] [2024-10-11 03:27:38,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:39,193 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-11 03:27:39,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:39,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789577975] [2024-10-11 03:27:39,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789577975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:39,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234349197] [2024-10-11 03:27:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:39,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:39,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:39,197 INFO L87 Difference]: Start difference. First operand 2359 states and 4218 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-11 03:27:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:39,273 INFO L93 Difference]: Finished difference Result 5787 states and 10364 transitions. [2024-10-11 03:27:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:39,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2024-10-11 03:27:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:39,288 INFO L225 Difference]: With dead ends: 5787 [2024-10-11 03:27:39,289 INFO L226 Difference]: Without dead ends: 3977 [2024-10-11 03:27:39,293 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-11 03:27:39,294 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 196 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:39,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 2385 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:27:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2024-10-11 03:27:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3975. [2024-10-11 03:27:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3974 states have (on average 1.78610971313538) internal successors, (7098), 3974 states have internal predecessors, (7098), 0 states have call successors, (0), 0 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-11 03:27:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7098 transitions. [2024-10-11 03:27:39,394 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7098 transitions. Word has length 230 [2024-10-11 03:27:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:39,395 INFO L471 AbstractCegarLoop]: Abstraction has 3975 states and 7098 transitions. [2024-10-11 03:27:39,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-11 03:27:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7098 transitions. [2024-10-11 03:27:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 03:27:39,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:39,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:39,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:27:39,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:39,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash -22484034, now seen corresponding path program 1 times [2024-10-11 03:27:39,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:39,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612255827] [2024-10-11 03:27:39,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:39,860 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-11 03:27:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:39,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612255827] [2024-10-11 03:27:39,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612255827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:39,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:39,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:27:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129839771] [2024-10-11 03:27:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:39,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:27:39,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:39,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:27:39,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:27:39,864 INFO L87 Difference]: Start difference. First operand 3975 states and 7098 transitions. Second operand has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:40,594 INFO L93 Difference]: Finished difference Result 23595 states and 42436 transitions. [2024-10-11 03:27:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:27:40,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-10-11 03:27:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:40,743 INFO L225 Difference]: With dead ends: 23595 [2024-10-11 03:27:40,743 INFO L226 Difference]: Without dead ends: 20169 [2024-10-11 03:27:40,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:27:40,755 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 2614 mSDsluCounter, 10161 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2614 SdHoareTripleChecker+Valid, 11376 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:40,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2614 Valid, 11376 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:27:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20169 states. [2024-10-11 03:27:41,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20169 to 7263. [2024-10-11 03:27:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7263 states, 7262 states have (on average 1.786422473147893) internal successors, (12973), 7262 states have internal predecessors, (12973), 0 states have call successors, (0), 0 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-11 03:27:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7263 states to 7263 states and 12973 transitions. [2024-10-11 03:27:41,110 INFO L78 Accepts]: Start accepts. Automaton has 7263 states and 12973 transitions. Word has length 234 [2024-10-11 03:27:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:41,111 INFO L471 AbstractCegarLoop]: Abstraction has 7263 states and 12973 transitions. [2024-10-11 03:27:41,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7263 states and 12973 transitions. [2024-10-11 03:27:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-11 03:27:41,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:41,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:41,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:27:41,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:41,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:41,119 INFO L85 PathProgramCache]: Analyzing trace with hash -770747648, now seen corresponding path program 1 times [2024-10-11 03:27:41,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:41,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021715218] [2024-10-11 03:27:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:41,455 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-11 03:27:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:41,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021715218] [2024-10-11 03:27:41,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021715218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:41,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:41,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:27:41,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269916043] [2024-10-11 03:27:41,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:41,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:27:41,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:41,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:27:41,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:27:41,458 INFO L87 Difference]: Start difference. First operand 7263 states and 12973 transitions. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:41,866 INFO L93 Difference]: Finished difference Result 21097 states and 37841 transitions. [2024-10-11 03:27:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:27:41,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2024-10-11 03:27:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:41,901 INFO L225 Difference]: With dead ends: 21097 [2024-10-11 03:27:41,901 INFO L226 Difference]: Without dead ends: 14383 [2024-10-11 03:27:41,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:27:41,918 INFO L432 NwaCegarLoop]: 1216 mSDtfsCounter, 732 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 3832 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:41,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 3832 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:27:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14383 states. [2024-10-11 03:27:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14383 to 10790. [2024-10-11 03:27:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10790 states, 10789 states have (on average 1.7870052831587728) internal successors, (19280), 10789 states have internal predecessors, (19280), 0 states have call successors, (0), 0 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-11 03:27:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10790 states to 10790 states and 19280 transitions. [2024-10-11 03:27:42,230 INFO L78 Accepts]: Start accepts. Automaton has 10790 states and 19280 transitions. Word has length 235 [2024-10-11 03:27:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:42,231 INFO L471 AbstractCegarLoop]: Abstraction has 10790 states and 19280 transitions. [2024-10-11 03:27:42,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 10790 states and 19280 transitions. [2024-10-11 03:27:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 03:27:42,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:42,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:42,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:27:42,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:42,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash 757143896, now seen corresponding path program 1 times [2024-10-11 03:27:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:42,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009693806] [2024-10-11 03:27:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:42,505 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-11 03:27:42,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:42,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009693806] [2024-10-11 03:27:42,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009693806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:42,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:42,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007132865] [2024-10-11 03:27:42,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:42,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:42,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:42,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:42,511 INFO L87 Difference]: Start difference. First operand 10790 states and 19280 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:42,734 INFO L93 Difference]: Finished difference Result 23791 states and 42624 transitions. [2024-10-11 03:27:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:42,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-11 03:27:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:42,770 INFO L225 Difference]: With dead ends: 23791 [2024-10-11 03:27:42,771 INFO L226 Difference]: Without dead ends: 16614 [2024-10-11 03:27:42,787 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-11 03:27:42,787 INFO L432 NwaCegarLoop]: 1419 mSDtfsCounter, 229 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:42,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 2605 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:27:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16614 states. [2024-10-11 03:27:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16614 to 16612. [2024-10-11 03:27:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16612 states, 16611 states have (on average 1.7836373487448076) internal successors, (29628), 16611 states have internal predecessors, (29628), 0 states have call successors, (0), 0 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-11 03:27:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16612 states to 16612 states and 29628 transitions. [2024-10-11 03:27:43,242 INFO L78 Accepts]: Start accepts. Automaton has 16612 states and 29628 transitions. Word has length 236 [2024-10-11 03:27:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:43,242 INFO L471 AbstractCegarLoop]: Abstraction has 16612 states and 29628 transitions. [2024-10-11 03:27:43,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 16612 states and 29628 transitions. [2024-10-11 03:27:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 03:27:43,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:43,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:43,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:27:43,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:43,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1595409544, now seen corresponding path program 1 times [2024-10-11 03:27:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:43,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363527813] [2024-10-11 03:27:43,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:43,517 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-11 03:27:43,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363527813] [2024-10-11 03:27:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363527813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:43,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902903519] [2024-10-11 03:27:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:43,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:43,521 INFO L87 Difference]: Start difference. First operand 16612 states and 29628 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:43,835 INFO L93 Difference]: Finished difference Result 32116 states and 57267 transitions. [2024-10-11 03:27:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:43,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-11 03:27:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:43,892 INFO L225 Difference]: With dead ends: 32116 [2024-10-11 03:27:43,892 INFO L226 Difference]: Without dead ends: 23490 [2024-10-11 03:27:43,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:43,917 INFO L432 NwaCegarLoop]: 1408 mSDtfsCounter, 221 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:43,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 2595 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:27:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23490 states. [2024-10-11 03:27:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23490 to 23488. [2024-10-11 03:27:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23488 states, 23487 states have (on average 1.7769830118789118) internal successors, (41736), 23487 states have internal predecessors, (41736), 0 states have call successors, (0), 0 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-11 03:27:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23488 states to 23488 states and 41736 transitions. [2024-10-11 03:27:44,575 INFO L78 Accepts]: Start accepts. Automaton has 23488 states and 41736 transitions. Word has length 236 [2024-10-11 03:27:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:44,575 INFO L471 AbstractCegarLoop]: Abstraction has 23488 states and 41736 transitions. [2024-10-11 03:27:44,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 23488 states and 41736 transitions. [2024-10-11 03:27:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 03:27:44,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:44,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:44,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:27:44,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:44,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1908212328, now seen corresponding path program 1 times [2024-10-11 03:27:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:44,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703757971] [2024-10-11 03:27:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:44,763 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-11 03:27:44,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:44,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703757971] [2024-10-11 03:27:44,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703757971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:44,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:44,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:44,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226434220] [2024-10-11 03:27:44,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:44,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:44,766 INFO L87 Difference]: Start difference. First operand 23488 states and 41736 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:45,213 INFO L93 Difference]: Finished difference Result 45456 states and 80743 transitions. [2024-10-11 03:27:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-11 03:27:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:45,290 INFO L225 Difference]: With dead ends: 45456 [2024-10-11 03:27:45,291 INFO L226 Difference]: Without dead ends: 33158 [2024-10-11 03:27:45,411 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-11 03:27:45,412 INFO L432 NwaCegarLoop]: 1388 mSDtfsCounter, 213 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:45,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2576 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:27:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33158 states. [2024-10-11 03:27:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33158 to 33156. [2024-10-11 03:27:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33156 states, 33155 states have (on average 1.7695068617101493) internal successors, (58668), 33155 states have internal predecessors, (58668), 0 states have call successors, (0), 0 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-11 03:27:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33156 states to 33156 states and 58668 transitions. [2024-10-11 03:27:46,267 INFO L78 Accepts]: Start accepts. Automaton has 33156 states and 58668 transitions. Word has length 236 [2024-10-11 03:27:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:46,268 INFO L471 AbstractCegarLoop]: Abstraction has 33156 states and 58668 transitions. [2024-10-11 03:27:46,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33156 states and 58668 transitions. [2024-10-11 03:27:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 03:27:46,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:46,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:46,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:27:46,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:46,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1532108728, now seen corresponding path program 1 times [2024-10-11 03:27:46,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:46,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293865928] [2024-10-11 03:27:46,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:46,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:46,644 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-11 03:27:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:46,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293865928] [2024-10-11 03:27:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293865928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:46,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402229736] [2024-10-11 03:27:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:46,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:46,648 INFO L87 Difference]: Start difference. First operand 33156 states and 58668 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:47,246 INFO L93 Difference]: Finished difference Result 64180 states and 113507 transitions. [2024-10-11 03:27:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-11 03:27:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:47,364 INFO L225 Difference]: With dead ends: 64180 [2024-10-11 03:27:47,365 INFO L226 Difference]: Without dead ends: 46694 [2024-10-11 03:27:47,403 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-11 03:27:47,405 INFO L432 NwaCegarLoop]: 1368 mSDtfsCounter, 205 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:47,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 2557 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:27:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46694 states. [2024-10-11 03:27:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46694 to 46692. [2024-10-11 03:27:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46692 states, 46691 states have (on average 1.7610674434045106) internal successors, (82226), 46691 states have internal predecessors, (82226), 0 states have call successors, (0), 0 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-11 03:27:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46692 states to 46692 states and 82226 transitions. [2024-10-11 03:27:48,618 INFO L78 Accepts]: Start accepts. Automaton has 46692 states and 82226 transitions. Word has length 236 [2024-10-11 03:27:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:48,619 INFO L471 AbstractCegarLoop]: Abstraction has 46692 states and 82226 transitions. [2024-10-11 03:27:48,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 46692 states and 82226 transitions. [2024-10-11 03:27:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 03:27:48,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:48,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:48,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:27:48,624 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:48,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1909104168, now seen corresponding path program 1 times [2024-10-11 03:27:48,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:48,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226568284] [2024-10-11 03:27:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:49,031 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-11 03:27:49,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:49,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226568284] [2024-10-11 03:27:49,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226568284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:49,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:27:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629105577] [2024-10-11 03:27:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:49,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:27:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:27:49,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:27:49,034 INFO L87 Difference]: Start difference. First operand 46692 states and 82226 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:50,027 INFO L93 Difference]: Finished difference Result 90340 states and 158983 transitions. [2024-10-11 03:27:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:27:50,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-11 03:27:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:50,202 INFO L225 Difference]: With dead ends: 90340 [2024-10-11 03:27:50,203 INFO L226 Difference]: Without dead ends: 65552 [2024-10-11 03:27:50,239 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-11 03:27:50,240 INFO L432 NwaCegarLoop]: 1348 mSDtfsCounter, 197 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:50,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 2538 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:27:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65552 states. [2024-10-11 03:27:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65552 to 65550. [2024-10-11 03:27:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65550 states, 65549 states have (on average 1.751483622938565) internal successors, (114808), 65549 states have internal predecessors, (114808), 0 states have call successors, (0), 0 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-11 03:27:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65550 states to 65550 states and 114808 transitions. [2024-10-11 03:27:52,091 INFO L78 Accepts]: Start accepts. Automaton has 65550 states and 114808 transitions. Word has length 236 [2024-10-11 03:27:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:52,092 INFO L471 AbstractCegarLoop]: Abstraction has 65550 states and 114808 transitions. [2024-10-11 03:27:52,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 65550 states and 114808 transitions. [2024-10-11 03:27:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 03:27:52,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:52,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:52,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:27:52,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1808335847, now seen corresponding path program 1 times [2024-10-11 03:27:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058078859] [2024-10-11 03:27:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:52,347 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-11 03:27:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:52,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058078859] [2024-10-11 03:27:52,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058078859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:52,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:52,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:27:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428835827] [2024-10-11 03:27:52,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:52,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:27:52,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:52,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:27:52,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:27:52,350 INFO L87 Difference]: Start difference. First operand 65550 states and 114808 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:27:54,179 INFO L93 Difference]: Finished difference Result 216841 states and 379871 transitions. [2024-10-11 03:27:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:27:54,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-11 03:27:54,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:27:54,472 INFO L225 Difference]: With dead ends: 216841 [2024-10-11 03:27:54,473 INFO L226 Difference]: Without dead ends: 151890 [2024-10-11 03:27:54,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:27:54,815 INFO L432 NwaCegarLoop]: 1213 mSDtfsCounter, 730 mSDsluCounter, 2618 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:27:54,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3831 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:27:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151890 states. [2024-10-11 03:27:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151890 to 108451. [2024-10-11 03:27:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108451 states, 108450 states have (on average 1.743891194098663) internal successors, (189125), 108450 states have internal predecessors, (189125), 0 states have call successors, (0), 0 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-11 03:27:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108451 states to 108451 states and 189125 transitions. [2024-10-11 03:27:57,595 INFO L78 Accepts]: Start accepts. Automaton has 108451 states and 189125 transitions. Word has length 236 [2024-10-11 03:27:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:27:57,596 INFO L471 AbstractCegarLoop]: Abstraction has 108451 states and 189125 transitions. [2024-10-11 03:27:57,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:27:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 108451 states and 189125 transitions. [2024-10-11 03:27:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-11 03:27:57,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:27:57,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:27:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:27:57,600 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:27:57,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:27:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 160997321, now seen corresponding path program 1 times [2024-10-11 03:27:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:27:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946097151] [2024-10-11 03:27:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:27:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:27:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:27:57,881 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-11 03:27:57,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:27:57,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946097151] [2024-10-11 03:27:57,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946097151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:27:57,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:27:57,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:27:57,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139765630] [2024-10-11 03:27:57,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:27:57,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:27:57,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:27:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:27:57,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:27:57,883 INFO L87 Difference]: Start difference. First operand 108451 states and 189125 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:28:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:28:00,712 INFO L93 Difference]: Finished difference Result 358831 states and 625901 transitions. [2024-10-11 03:28:00,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:28:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2024-10-11 03:28:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:28:01,754 INFO L225 Difference]: With dead ends: 358831 [2024-10-11 03:28:01,754 INFO L226 Difference]: Without dead ends: 250979 [2024-10-11 03:28:01,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:28:01,838 INFO L432 NwaCegarLoop]: 1209 mSDtfsCounter, 728 mSDsluCounter, 2620 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 3829 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:28:01,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 3829 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:28:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250979 states. [2024-10-11 03:28:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250979 to 179272. [2024-10-11 03:28:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179272 states, 179271 states have (on average 1.736309832599807) internal successors, (311270), 179271 states have internal predecessors, (311270), 0 states have call successors, (0), 0 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-11 03:28:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179272 states to 179272 states and 311270 transitions. [2024-10-11 03:28:05,783 INFO L78 Accepts]: Start accepts. Automaton has 179272 states and 311270 transitions. Word has length 237 [2024-10-11 03:28:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:28:05,784 INFO L471 AbstractCegarLoop]: Abstraction has 179272 states and 311270 transitions. [2024-10-11 03:28:05,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:28:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 179272 states and 311270 transitions. [2024-10-11 03:28:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 03:28:05,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:28:05,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:28:05,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:28:05,789 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:28:05,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:28:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash 638562320, now seen corresponding path program 1 times [2024-10-11 03:28:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:28:05,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902100126] [2024-10-11 03:28:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:28:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:28:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:28:06,091 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-11 03:28:06,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:28:06,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902100126] [2024-10-11 03:28:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902100126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:28:06,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:28:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:28:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406408322] [2024-10-11 03:28:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:28:06,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:28:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:28:06,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:28:06,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:28:06,094 INFO L87 Difference]: Start difference. First operand 179272 states and 311270 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 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-11 03:28:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:28:10,517 INFO L93 Difference]: Finished difference Result 591525 states and 1027347 transitions. [2024-10-11 03:28:10,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:28:10,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2024-10-11 03:28:10,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:28:11,428 INFO L225 Difference]: With dead ends: 591525 [2024-10-11 03:28:11,428 INFO L226 Difference]: Without dead ends: 412852 [2024-10-11 03:28:11,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:28:11,588 INFO L432 NwaCegarLoop]: 1209 mSDtfsCounter, 726 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:28:11,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 3831 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:28:11,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412852 states. [2024-10-11 03:28:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412852 to 295337. [2024-10-11 03:28:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295337 states, 295336 states have (on average 1.7288207329956389) internal successors, (510583), 295336 states have internal predecessors, (510583), 0 states have call successors, (0), 0 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-11 03:28:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295337 states to 295337 states and 510583 transitions. [2024-10-11 03:28:18,653 INFO L78 Accepts]: Start accepts. Automaton has 295337 states and 510583 transitions. Word has length 238 [2024-10-11 03:28:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:28:18,654 INFO L471 AbstractCegarLoop]: Abstraction has 295337 states and 510583 transitions. [2024-10-11 03:28:18,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 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-11 03:28:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 295337 states and 510583 transitions. [2024-10-11 03:28:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 03:28:18,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:28:18,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:28:18,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:28:18,656 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:28:18,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:28:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1731340142, now seen corresponding path program 1 times [2024-10-11 03:28:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:28:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324120306] [2024-10-11 03:28:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:28:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:28:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:28:18,877 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-11 03:28:18,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:28:18,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324120306] [2024-10-11 03:28:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324120306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:28:18,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:28:18,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:28:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606621952] [2024-10-11 03:28:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:28:18,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:28:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:28:18,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:28:18,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:28:18,880 INFO L87 Difference]: Start difference. First operand 295337 states and 510583 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:28:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:28:25,431 INFO L93 Difference]: Finished difference Result 967699 states and 1673593 transitions. [2024-10-11 03:28:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:28:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-10-11 03:28:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:28:27,462 INFO L225 Difference]: With dead ends: 967699 [2024-10-11 03:28:27,462 INFO L226 Difference]: Without dead ends: 672961 [2024-10-11 03:28:27,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:28:27,743 INFO L432 NwaCegarLoop]: 1209 mSDtfsCounter, 724 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:28:27,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 3833 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:28:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672961 states.