./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label18.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/eca-rers2012/Problem03_label18.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 d08db41ae0d7ec8078cc06035e9e84ddb6f4cbeccb0dd0eb818a13f85c4c66c1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:36:47,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:36:47,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:36:47,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:36:47,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:36:47,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:36:47,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:36:47,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:36:47,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:36:47,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:36:47,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:36:47,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:36:47,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:36:47,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:36:47,598 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:36:47,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:36:47,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:36:47,599 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:36:47,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:36:47,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:36:47,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:36:47,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:36:47,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:36:47,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:36:47,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:36:47,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:36:47,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:36:47,603 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:36:47,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:36:47,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:36:47,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:36:47,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:36:47,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:36:47,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:36:47,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:36:47,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:36:47,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:36:47,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:36:47,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:36:47,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:36:47,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:36:47,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:36:47,607 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 -> d08db41ae0d7ec8078cc06035e9e84ddb6f4cbeccb0dd0eb818a13f85c4c66c1 [2024-10-10 22:36:47,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:36:47,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:36:47,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:36:47,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:36:47,896 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:36:47,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label18.c [2024-10-10 22:36:49,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:36:49,501 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:36:49,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label18.c [2024-10-10 22:36:49,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e8fb2672/ee9a2d0c4e274a509ee6cd42022107ea/FLAGd9ab07d32 [2024-10-10 22:36:49,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e8fb2672/ee9a2d0c4e274a509ee6cd42022107ea [2024-10-10 22:36:49,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:36:49,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:36:49,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:36:49,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:36:49,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:36:49,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:36:49" (1/1) ... [2024-10-10 22:36:49,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe01468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:49, skipping insertion in model container [2024-10-10 22:36:49,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:36:49" (1/1) ... [2024-10-10 22:36:49,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:36:50,244 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/eca-rers2012/Problem03_label18.c[61636,61649] [2024-10-10 22:36:50,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:36:50,280 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:36:50,401 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/eca-rers2012/Problem03_label18.c[61636,61649] [2024-10-10 22:36:50,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:36:50,424 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:36:50,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50 WrapperNode [2024-10-10 22:36:50,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:36:50,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:36:50,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:36:50,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:36:50,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,577 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:36:50,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:36:50,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:36:50,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:36:50,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:36:50,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,638 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-10 22:36:50,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:36:50,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:36:50,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:36:50,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:36:50,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (1/1) ... [2024-10-10 22:36:50,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:36:50,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:50,756 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-10 22:36:50,759 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-10 22:36:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:36:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:36:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:36:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:36:50,953 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:36:50,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:36:52,408 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:36:52,408 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:36:52,462 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:36:52,463 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:36:52,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:36:52 BoogieIcfgContainer [2024-10-10 22:36:52,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:36:52,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:36:52,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:36:52,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:36:52,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:36:49" (1/3) ... [2024-10-10 22:36:52,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d293c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:36:52, skipping insertion in model container [2024-10-10 22:36:52,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:36:50" (2/3) ... [2024-10-10 22:36:52,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d293c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:36:52, skipping insertion in model container [2024-10-10 22:36:52,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:36:52" (3/3) ... [2024-10-10 22:36:52,472 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label18.c [2024-10-10 22:36:52,485 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:36:52,486 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:36:52,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:36:52,545 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;@4e9c5886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:36:52,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:36:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-10 22:36:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-10 22:36:52,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:52,566 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] [2024-10-10 22:36:52,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:52,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1313278425, now seen corresponding path program 1 times [2024-10-10 22:36:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:52,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247057517] [2024-10-10 22:36:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:52,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:53,026 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-10 22:36:53,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:53,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247057517] [2024-10-10 22:36:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247057517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:53,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:53,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:36:53,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60515680] [2024-10-10 22:36:53,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:53,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:36:53,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:53,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:36:53,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:36:53,056 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:53,091 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:36:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:36:53,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2024-10-10 22:36:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:53,102 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:36:53,102 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:36:53,105 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-10 22:36:53,109 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:53,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:36:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:36:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:36:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-10 22:36:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:36:53,161 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 202 [2024-10-10 22:36:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:53,162 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:36:53,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:36:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-10 22:36:53,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:53,170 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] [2024-10-10 22:36:53,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:36:53,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:53,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1857362597, now seen corresponding path program 1 times [2024-10-10 22:36:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:53,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929079173] [2024-10-10 22:36:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:53,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-10 22:36:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929079173] [2024-10-10 22:36:53,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929079173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:53,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:53,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:36:53,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222074825] [2024-10-10 22:36:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:53,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:53,772 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:54,558 INFO L93 Difference]: Finished difference Result 680 states and 1128 transitions. [2024-10-10 22:36:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:54,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2024-10-10 22:36:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:54,562 INFO L225 Difference]: With dead ends: 680 [2024-10-10 22:36:54,562 INFO L226 Difference]: Without dead ends: 443 [2024-10-10 22:36:54,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:54,563 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:54,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 184 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:36:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-10 22:36:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 442. [2024-10-10 22:36:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.4195011337868482) internal successors, (626), 441 states have internal predecessors, (626), 0 states have call successors, (0), 0 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-10 22:36:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2024-10-10 22:36:54,585 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 202 [2024-10-10 22:36:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:54,586 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2024-10-10 22:36:54,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2024-10-10 22:36:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-10 22:36:54,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:54,591 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:36:54,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:36:54,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:54,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1616440922, now seen corresponding path program 1 times [2024-10-10 22:36:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:54,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892302112] [2024-10-10 22:36:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:36:54,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892302112] [2024-10-10 22:36:54,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892302112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:54,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:54,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:36:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643569902] [2024-10-10 22:36:54,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:54,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:54,770 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-10 22:36:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:55,462 INFO L93 Difference]: Finished difference Result 1309 states and 1860 transitions. [2024-10-10 22:36:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 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 210 [2024-10-10 22:36:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:55,465 INFO L225 Difference]: With dead ends: 1309 [2024-10-10 22:36:55,465 INFO L226 Difference]: Without dead ends: 868 [2024-10-10 22:36:55,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:55,468 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:55,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:36:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-10 22:36:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 854. [2024-10-10 22:36:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 1.388042203985932) internal successors, (1184), 853 states have internal predecessors, (1184), 0 states have call successors, (0), 0 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-10 22:36:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1184 transitions. [2024-10-10 22:36:55,514 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1184 transitions. Word has length 210 [2024-10-10 22:36:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:55,514 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1184 transitions. [2024-10-10 22:36:55,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-10 22:36:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1184 transitions. [2024-10-10 22:36:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-10 22:36:55,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:55,518 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:36:55,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:36:55,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:55,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1407926298, now seen corresponding path program 1 times [2024-10-10 22:36:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:55,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594467428] [2024-10-10 22:36:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 22:36:55,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594467428] [2024-10-10 22:36:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594467428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:55,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:36:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090529236] [2024-10-10 22:36:55,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:55,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:55,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:55,811 INFO L87 Difference]: Start difference. First operand 854 states and 1184 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-10 22:36:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:56,679 INFO L93 Difference]: Finished difference Result 2546 states and 3534 transitions. [2024-10-10 22:36:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:56,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 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 219 [2024-10-10 22:36:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:56,688 INFO L225 Difference]: With dead ends: 2546 [2024-10-10 22:36:56,689 INFO L226 Difference]: Without dead ends: 1693 [2024-10-10 22:36:56,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:56,695 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 275 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:56,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 225 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:36:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2024-10-10 22:36:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1686. [2024-10-10 22:36:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1685 states have (on average 1.372700296735905) internal successors, (2313), 1685 states have internal predecessors, (2313), 0 states have call successors, (0), 0 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-10 22:36:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2313 transitions. [2024-10-10 22:36:56,734 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2313 transitions. Word has length 219 [2024-10-10 22:36:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:56,734 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2313 transitions. [2024-10-10 22:36:56,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-10 22:36:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2313 transitions. [2024-10-10 22:36:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-10 22:36:56,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:56,739 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:36:56,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:36:56,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:56,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash -429705185, now seen corresponding path program 1 times [2024-10-10 22:36:56,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:56,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914569919] [2024-10-10 22:36:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:36:57,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914569919] [2024-10-10 22:36:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914569919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:57,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:57,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:36:57,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271802624] [2024-10-10 22:36:57,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:57,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:57,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:57,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:57,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:57,047 INFO L87 Difference]: Start difference. First operand 1686 states and 2313 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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-10 22:36:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:57,737 INFO L93 Difference]: Finished difference Result 4189 states and 5943 transitions. [2024-10-10 22:36:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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-10 22:36:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:57,744 INFO L225 Difference]: With dead ends: 4189 [2024-10-10 22:36:57,744 INFO L226 Difference]: Without dead ends: 2504 [2024-10-10 22:36:57,746 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-10 22:36:57,746 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 236 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:57,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 402 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:36:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2024-10-10 22:36:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2501. [2024-10-10 22:36:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.3104) internal successors, (3276), 2500 states have internal predecessors, (3276), 0 states have call successors, (0), 0 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-10 22:36:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3276 transitions. [2024-10-10 22:36:57,780 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3276 transitions. Word has length 222 [2024-10-10 22:36:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:57,780 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3276 transitions. [2024-10-10 22:36:57,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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-10 22:36:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3276 transitions. [2024-10-10 22:36:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-10 22:36:57,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:57,785 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:36:57,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:36:57,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:57,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1384632627, now seen corresponding path program 1 times [2024-10-10 22:36:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:57,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710637890] [2024-10-10 22:36:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:36:58,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:58,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710637890] [2024-10-10 22:36:58,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710637890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:58,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:58,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:36:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290991362] [2024-10-10 22:36:58,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:58,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:58,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:58,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:58,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:58,144 INFO L87 Difference]: Start difference. First operand 2501 states and 3276 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-10 22:36:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:58,744 INFO L93 Difference]: Finished difference Result 5826 states and 7689 transitions. [2024-10-10 22:36:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:58,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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-10 22:36:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:58,756 INFO L225 Difference]: With dead ends: 5826 [2024-10-10 22:36:58,757 INFO L226 Difference]: Without dead ends: 3326 [2024-10-10 22:36:58,760 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-10 22:36:58,761 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:58,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 361 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:36:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2024-10-10 22:36:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3316. [2024-10-10 22:36:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 3315 states have (on average 1.2832579185520363) internal successors, (4254), 3315 states have internal predecessors, (4254), 0 states have call successors, (0), 0 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-10 22:36:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 4254 transitions. [2024-10-10 22:36:58,819 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 4254 transitions. Word has length 230 [2024-10-10 22:36:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:58,820 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 4254 transitions. [2024-10-10 22:36:58,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-10 22:36:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 4254 transitions. [2024-10-10 22:36:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-10 22:36:58,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:58,827 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:36:58,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:36:58,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:58,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1877991693, now seen corresponding path program 1 times [2024-10-10 22:36:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:58,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449088443] [2024-10-10 22:36:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:58,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:36:59,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:59,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449088443] [2024-10-10 22:36:59,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449088443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:59,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:59,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:36:59,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394680991] [2024-10-10 22:36:59,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:59,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:59,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:59,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:59,104 INFO L87 Difference]: Start difference. First operand 3316 states and 4254 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:59,781 INFO L93 Difference]: Finished difference Result 9080 states and 11774 transitions. [2024-10-10 22:36:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2024-10-10 22:36:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:59,799 INFO L225 Difference]: With dead ends: 9080 [2024-10-10 22:36:59,799 INFO L226 Difference]: Without dead ends: 5765 [2024-10-10 22:36:59,804 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-10 22:36:59,807 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:59,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 383 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:36:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2024-10-10 22:36:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5759. [2024-10-10 22:36:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5759 states, 5758 states have (on average 1.2401875651267802) internal successors, (7141), 5758 states have internal predecessors, (7141), 0 states have call successors, (0), 0 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-10 22:36:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5759 states to 5759 states and 7141 transitions. [2024-10-10 22:36:59,946 INFO L78 Accepts]: Start accepts. Automaton has 5759 states and 7141 transitions. Word has length 237 [2024-10-10 22:36:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:59,946 INFO L471 AbstractCegarLoop]: Abstraction has 5759 states and 7141 transitions. [2024-10-10 22:36:59,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 5759 states and 7141 transitions. [2024-10-10 22:36:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-10 22:36:59,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:59,955 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:36:59,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:36:59,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:59,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1168852920, now seen corresponding path program 1 times [2024-10-10 22:36:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553794940] [2024-10-10 22:36:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:00,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553794940] [2024-10-10 22:37:00,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553794940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:00,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:00,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362471470] [2024-10-10 22:37:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:00,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:00,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:00,219 INFO L87 Difference]: Start difference. First operand 5759 states and 7141 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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-10 22:37:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:01,250 INFO L93 Difference]: Finished difference Result 11543 states and 14333 transitions. [2024-10-10 22:37:01,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:01,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2024-10-10 22:37:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:01,269 INFO L225 Difference]: With dead ends: 11543 [2024-10-10 22:37:01,270 INFO L226 Difference]: Without dead ends: 5785 [2024-10-10 22:37:01,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:01,278 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 405 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:01,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 196 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 22:37:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2024-10-10 22:37:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 4947. [2024-10-10 22:37:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4947 states, 4946 states have (on average 1.2460574201374848) internal successors, (6163), 4946 states have internal predecessors, (6163), 0 states have call successors, (0), 0 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-10 22:37:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 6163 transitions. [2024-10-10 22:37:01,357 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 6163 transitions. Word has length 246 [2024-10-10 22:37:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:01,358 INFO L471 AbstractCegarLoop]: Abstraction has 4947 states and 6163 transitions. [2024-10-10 22:37:01,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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-10 22:37:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 6163 transitions. [2024-10-10 22:37:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-10 22:37:01,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:01,366 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:01,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:37:01,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:01,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:01,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1513320667, now seen corresponding path program 1 times [2024-10-10 22:37:01,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:01,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164739712] [2024-10-10 22:37:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:01,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 22:37:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164739712] [2024-10-10 22:37:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164739712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:01,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:01,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92052579] [2024-10-10 22:37:01,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:01,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:01,729 INFO L87 Difference]: Start difference. First operand 4947 states and 6163 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:02,403 INFO L93 Difference]: Finished difference Result 14392 states and 17934 transitions. [2024-10-10 22:37:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2024-10-10 22:37:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:02,429 INFO L225 Difference]: With dead ends: 14392 [2024-10-10 22:37:02,432 INFO L226 Difference]: Without dead ends: 9446 [2024-10-10 22:37:02,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:02,443 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 218 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:02,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 194 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9446 states. [2024-10-10 22:37:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9446 to 9435. [2024-10-10 22:37:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9435 states, 9434 states have (on average 1.2218571125715496) internal successors, (11527), 9434 states have internal predecessors, (11527), 0 states have call successors, (0), 0 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-10 22:37:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9435 states to 9435 states and 11527 transitions. [2024-10-10 22:37:02,581 INFO L78 Accepts]: Start accepts. Automaton has 9435 states and 11527 transitions. Word has length 250 [2024-10-10 22:37:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:02,582 INFO L471 AbstractCegarLoop]: Abstraction has 9435 states and 11527 transitions. [2024-10-10 22:37:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9435 states and 11527 transitions. [2024-10-10 22:37:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-10 22:37:02,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:02,600 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:02,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:37:02,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash -141193175, now seen corresponding path program 1 times [2024-10-10 22:37:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229101231] [2024-10-10 22:37:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:37:02,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229101231] [2024-10-10 22:37:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229101231] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041382867] [2024-10-10 22:37:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:02,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:02,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:02,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:02,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:37:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:03,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:03,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:37:03,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:03,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041382867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:03,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:03,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202317586] [2024-10-10 22:37:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:03,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:03,276 INFO L87 Difference]: Start difference. First operand 9435 states and 11527 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-10 22:37:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:03,954 INFO L93 Difference]: Finished difference Result 25188 states and 30910 transitions. [2024-10-10 22:37:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:03,955 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 253 [2024-10-10 22:37:03,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:03,992 INFO L225 Difference]: With dead ends: 25188 [2024-10-10 22:37:03,992 INFO L226 Difference]: Without dead ends: 16160 [2024-10-10 22:37:04,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:04,004 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 52 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:04,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 173 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16160 states. [2024-10-10 22:37:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16160 to 15343. [2024-10-10 22:37:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15343 states, 15342 states have (on average 1.2000391083300743) internal successors, (18411), 15342 states have internal predecessors, (18411), 0 states have call successors, (0), 0 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-10 22:37:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15343 states to 15343 states and 18411 transitions. [2024-10-10 22:37:04,227 INFO L78 Accepts]: Start accepts. Automaton has 15343 states and 18411 transitions. Word has length 253 [2024-10-10 22:37:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:04,228 INFO L471 AbstractCegarLoop]: Abstraction has 15343 states and 18411 transitions. [2024-10-10 22:37:04,228 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-10 22:37:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15343 states and 18411 transitions. [2024-10-10 22:37:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-10 22:37:04,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:04,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:04,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:37:04,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 22:37:04,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:04,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1551105241, now seen corresponding path program 1 times [2024-10-10 22:37:04,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:04,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610534945] [2024-10-10 22:37:04,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:04,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:04,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610534945] [2024-10-10 22:37:04,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610534945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:04,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:04,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:04,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051763734] [2024-10-10 22:37:04,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:04,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:04,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:04,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:04,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:04,955 INFO L87 Difference]: Start difference. First operand 15343 states and 18411 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 0 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-10 22:37:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:05,560 INFO L93 Difference]: Finished difference Result 30077 states and 36113 transitions. [2024-10-10 22:37:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:05,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2024-10-10 22:37:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:05,582 INFO L225 Difference]: With dead ends: 30077 [2024-10-10 22:37:05,583 INFO L226 Difference]: Without dead ends: 15141 [2024-10-10 22:37:05,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:05,598 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 133 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:05,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 197 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15141 states. [2024-10-10 22:37:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15141 to 15140. [2024-10-10 22:37:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15140 states, 15139 states have (on average 1.1957196644428298) internal successors, (18102), 15139 states have internal predecessors, (18102), 0 states have call successors, (0), 0 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-10 22:37:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15140 states to 15140 states and 18102 transitions. [2024-10-10 22:37:05,766 INFO L78 Accepts]: Start accepts. Automaton has 15140 states and 18102 transitions. Word has length 276 [2024-10-10 22:37:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:05,767 INFO L471 AbstractCegarLoop]: Abstraction has 15140 states and 18102 transitions. [2024-10-10 22:37:05,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 0 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-10 22:37:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 15140 states and 18102 transitions. [2024-10-10 22:37:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-10 22:37:05,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:05,790 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:05,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:37:05,790 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:05,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash 62189626, now seen corresponding path program 1 times [2024-10-10 22:37:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879077250] [2024-10-10 22:37:05,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-10 22:37:06,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:06,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879077250] [2024-10-10 22:37:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879077250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:06,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:06,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756968847] [2024-10-10 22:37:06,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:06,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:06,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:06,291 INFO L87 Difference]: Start difference. First operand 15140 states and 18102 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 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-10 22:37:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:07,080 INFO L93 Difference]: Finished difference Result 34998 states and 42357 transitions. [2024-10-10 22:37:07,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:07,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 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 280 [2024-10-10 22:37:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:07,107 INFO L225 Difference]: With dead ends: 34998 [2024-10-10 22:37:07,107 INFO L226 Difference]: Without dead ends: 20468 [2024-10-10 22:37:07,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:07,123 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:07,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 242 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20468 states. [2024-10-10 22:37:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20468 to 20437. [2024-10-10 22:37:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20437 states, 20436 states have (on average 1.2137893912703073) internal successors, (24805), 20436 states have internal predecessors, (24805), 0 states have call successors, (0), 0 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-10 22:37:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20437 states to 20437 states and 24805 transitions. [2024-10-10 22:37:07,327 INFO L78 Accepts]: Start accepts. Automaton has 20437 states and 24805 transitions. Word has length 280 [2024-10-10 22:37:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:07,327 INFO L471 AbstractCegarLoop]: Abstraction has 20437 states and 24805 transitions. [2024-10-10 22:37:07,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 2 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-10 22:37:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 20437 states and 24805 transitions. [2024-10-10 22:37:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-10 22:37:07,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:07,465 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:07,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:37:07,466 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:07,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:07,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1678338696, now seen corresponding path program 1 times [2024-10-10 22:37:07,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:07,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003389494] [2024-10-10 22:37:07,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:07,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 92 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-10 22:37:07,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:07,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003389494] [2024-10-10 22:37:07,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003389494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:07,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075110154] [2024-10-10 22:37:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:07,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:07,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:07,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:07,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:37:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:07,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:37:07,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-10 22:37:08,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:08,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075110154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:08,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:08,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:37:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741706544] [2024-10-10 22:37:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:08,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:08,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:08,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:08,021 INFO L87 Difference]: Start difference. First operand 20437 states and 24805 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 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-10 22:37:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:08,398 INFO L93 Difference]: Finished difference Result 38170 states and 46444 transitions. [2024-10-10 22:37:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:08,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 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 283 [2024-10-10 22:37:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:08,423 INFO L225 Difference]: With dead ends: 38170 [2024-10-10 22:37:08,423 INFO L226 Difference]: Without dead ends: 18750 [2024-10-10 22:37:08,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:08,440 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:08,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 29 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:37:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18750 states. [2024-10-10 22:37:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18750 to 18750. [2024-10-10 22:37:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18750 states, 18749 states have (on average 1.1911568616992907) internal successors, (22333), 18749 states have internal predecessors, (22333), 0 states have call successors, (0), 0 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-10 22:37:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18750 states to 18750 states and 22333 transitions. [2024-10-10 22:37:08,741 INFO L78 Accepts]: Start accepts. Automaton has 18750 states and 22333 transitions. Word has length 283 [2024-10-10 22:37:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:08,742 INFO L471 AbstractCegarLoop]: Abstraction has 18750 states and 22333 transitions. [2024-10-10 22:37:08,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 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-10 22:37:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 18750 states and 22333 transitions. [2024-10-10 22:37:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-10-10 22:37:08,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:08,761 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:08,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:37:08,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:08,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:08,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 175639812, now seen corresponding path program 1 times [2024-10-10 22:37:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:08,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618090807] [2024-10-10 22:37:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:08,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:37:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618090807] [2024-10-10 22:37:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618090807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309469027] [2024-10-10 22:37:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:09,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:09,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:09,207 INFO L87 Difference]: Start difference. First operand 18750 states and 22333 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:09,859 INFO L93 Difference]: Finished difference Result 40544 states and 48862 transitions. [2024-10-10 22:37:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:09,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 303 [2024-10-10 22:37:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:09,884 INFO L225 Difference]: With dead ends: 40544 [2024-10-10 22:37:09,884 INFO L226 Difference]: Without dead ends: 21391 [2024-10-10 22:37:09,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:09,898 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 566 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:09,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 55 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21391 states. [2024-10-10 22:37:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21391 to 21390. [2024-10-10 22:37:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21390 states, 21389 states have (on average 1.1180980878021414) internal successors, (23915), 21389 states have internal predecessors, (23915), 0 states have call successors, (0), 0 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-10 22:37:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21390 states to 21390 states and 23915 transitions. [2024-10-10 22:37:10,152 INFO L78 Accepts]: Start accepts. Automaton has 21390 states and 23915 transitions. Word has length 303 [2024-10-10 22:37:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:10,152 INFO L471 AbstractCegarLoop]: Abstraction has 21390 states and 23915 transitions. [2024-10-10 22:37:10,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 21390 states and 23915 transitions. [2024-10-10 22:37:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-10-10 22:37:10,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:10,167 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:10,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:37:10,167 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:10,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -146089621, now seen corresponding path program 1 times [2024-10-10 22:37:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:10,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346124763] [2024-10-10 22:37:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:10,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:10,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346124763] [2024-10-10 22:37:10,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346124763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:10,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:10,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253547061] [2024-10-10 22:37:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:10,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:10,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:10,367 INFO L87 Difference]: Start difference. First operand 21390 states and 23915 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-10 22:37:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:10,906 INFO L93 Difference]: Finished difference Result 45217 states and 51088 transitions. [2024-10-10 22:37:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 305 [2024-10-10 22:37:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:10,938 INFO L225 Difference]: With dead ends: 45217 [2024-10-10 22:37:10,938 INFO L226 Difference]: Without dead ends: 24845 [2024-10-10 22:37:10,964 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-10 22:37:10,964 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 238 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:10,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 299 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24845 states. [2024-10-10 22:37:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24845 to 24841. [2024-10-10 22:37:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24841 states, 24840 states have (on average 1.1308373590982286) internal successors, (28090), 24840 states have internal predecessors, (28090), 0 states have call successors, (0), 0 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-10 22:37:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24841 states to 24841 states and 28090 transitions. [2024-10-10 22:37:11,384 INFO L78 Accepts]: Start accepts. Automaton has 24841 states and 28090 transitions. Word has length 305 [2024-10-10 22:37:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:11,385 INFO L471 AbstractCegarLoop]: Abstraction has 24841 states and 28090 transitions. [2024-10-10 22:37:11,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-10 22:37:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 24841 states and 28090 transitions. [2024-10-10 22:37:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-10 22:37:11,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:11,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:11,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:37:11,408 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:11,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1658292738, now seen corresponding path program 1 times [2024-10-10 22:37:11,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:11,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043161312] [2024-10-10 22:37:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-10 22:37:11,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:11,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043161312] [2024-10-10 22:37:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043161312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422504973] [2024-10-10 22:37:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:11,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:11,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:11,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:11,846 INFO L87 Difference]: Start difference. First operand 24841 states and 28090 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 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-10 22:37:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:12,530 INFO L93 Difference]: Finished difference Result 54979 states and 62306 transitions. [2024-10-10 22:37:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:12,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 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 310 [2024-10-10 22:37:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:12,569 INFO L225 Difference]: With dead ends: 54979 [2024-10-10 22:37:12,569 INFO L226 Difference]: Without dead ends: 31359 [2024-10-10 22:37:12,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:12,591 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 212 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:12,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 130 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31359 states. [2024-10-10 22:37:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31359 to 31356. [2024-10-10 22:37:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31356 states, 31355 states have (on average 1.1323552862382396) internal successors, (35505), 31355 states have internal predecessors, (35505), 0 states have call successors, (0), 0 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-10 22:37:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31356 states to 31356 states and 35505 transitions. [2024-10-10 22:37:13,028 INFO L78 Accepts]: Start accepts. Automaton has 31356 states and 35505 transitions. Word has length 310 [2024-10-10 22:37:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:13,028 INFO L471 AbstractCegarLoop]: Abstraction has 31356 states and 35505 transitions. [2024-10-10 22:37:13,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 2 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-10 22:37:13,029 INFO L276 IsEmpty]: Start isEmpty. Operand 31356 states and 35505 transitions. [2024-10-10 22:37:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-10-10 22:37:13,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:13,053 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:13,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 22:37:13,054 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:13,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:13,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1140147561, now seen corresponding path program 1 times [2024-10-10 22:37:13,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:13,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804839663] [2024-10-10 22:37:13,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:13,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804839663] [2024-10-10 22:37:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804839663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:13,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152799004] [2024-10-10 22:37:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:13,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:13,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:13,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:13,196 INFO L87 Difference]: Start difference. First operand 31356 states and 35505 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-10 22:37:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:13,792 INFO L93 Difference]: Finished difference Result 72258 states and 82137 transitions. [2024-10-10 22:37:13,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:13,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 317 [2024-10-10 22:37:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:13,841 INFO L225 Difference]: With dead ends: 72258 [2024-10-10 22:37:13,842 INFO L226 Difference]: Without dead ends: 42123 [2024-10-10 22:37:13,865 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-10 22:37:13,866 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 208 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:13,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 319 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42123 states. [2024-10-10 22:37:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42123 to 41710. [2024-10-10 22:37:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41710 states, 41709 states have (on average 1.1140760986837372) internal successors, (46467), 41709 states have internal predecessors, (46467), 0 states have call successors, (0), 0 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-10 22:37:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41710 states to 41710 states and 46467 transitions. [2024-10-10 22:37:14,277 INFO L78 Accepts]: Start accepts. Automaton has 41710 states and 46467 transitions. Word has length 317 [2024-10-10 22:37:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:14,277 INFO L471 AbstractCegarLoop]: Abstraction has 41710 states and 46467 transitions. [2024-10-10 22:37:14,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-10 22:37:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 41710 states and 46467 transitions. [2024-10-10 22:37:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-10 22:37:14,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:14,310 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:14,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 22:37:14,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:14,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash 615792565, now seen corresponding path program 1 times [2024-10-10 22:37:14,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:14,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741999401] [2024-10-10 22:37:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:14,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-10 22:37:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741999401] [2024-10-10 22:37:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741999401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:14,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:14,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968164754] [2024-10-10 22:37:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:14,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:14,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:14,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:14,546 INFO L87 Difference]: Start difference. First operand 41710 states and 46467 transitions. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-10 22:37:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:15,326 INFO L93 Difference]: Finished difference Result 74501 states and 82953 transitions. [2024-10-10 22:37:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 323 [2024-10-10 22:37:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:15,377 INFO L225 Difference]: With dead ends: 74501 [2024-10-10 22:37:15,377 INFO L226 Difference]: Without dead ends: 42963 [2024-10-10 22:37:15,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:15,404 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 329 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:15,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 110 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42963 states. [2024-10-10 22:37:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42963 to 42529. [2024-10-10 22:37:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42529 states, 42528 states have (on average 1.1131254702784048) internal successors, (47339), 42528 states have internal predecessors, (47339), 0 states have call successors, (0), 0 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-10 22:37:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42529 states to 42529 states and 47339 transitions. [2024-10-10 22:37:15,980 INFO L78 Accepts]: Start accepts. Automaton has 42529 states and 47339 transitions. Word has length 323 [2024-10-10 22:37:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:15,980 INFO L471 AbstractCegarLoop]: Abstraction has 42529 states and 47339 transitions. [2024-10-10 22:37:15,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-10 22:37:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42529 states and 47339 transitions. [2024-10-10 22:37:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-10 22:37:16,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:16,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:37:16,008 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1074496770, now seen corresponding path program 1 times [2024-10-10 22:37:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:16,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815448441] [2024-10-10 22:37:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 131 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815448441] [2024-10-10 22:37:16,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815448441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048599441] [2024-10-10 22:37:16,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:16,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:16,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:16,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:16,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:37:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:16,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:16,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-10 22:37:16,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:16,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048599441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:16,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:16,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:37:16,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315674491] [2024-10-10 22:37:16,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:16,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:16,801 INFO L87 Difference]: Start difference. First operand 42529 states and 47339 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-10 22:37:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:17,346 INFO L93 Difference]: Finished difference Result 81201 states and 90523 transitions. [2024-10-10 22:37:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:17,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 334 [2024-10-10 22:37:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:17,416 INFO L225 Difference]: With dead ends: 81201 [2024-10-10 22:37:17,416 INFO L226 Difference]: Without dead ends: 40906 [2024-10-10 22:37:17,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:17,444 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 52 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:17,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 81 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40906 states. [2024-10-10 22:37:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40906 to 37454. [2024-10-10 22:37:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37454 states, 37453 states have (on average 1.0978826796251302) internal successors, (41119), 37453 states have internal predecessors, (41119), 0 states have call successors, (0), 0 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-10 22:37:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37454 states to 37454 states and 41119 transitions. [2024-10-10 22:37:17,937 INFO L78 Accepts]: Start accepts. Automaton has 37454 states and 41119 transitions. Word has length 334 [2024-10-10 22:37:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:17,937 INFO L471 AbstractCegarLoop]: Abstraction has 37454 states and 41119 transitions. [2024-10-10 22:37:17,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-10 22:37:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 37454 states and 41119 transitions. [2024-10-10 22:37:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-10 22:37:17,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:17,964 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:17,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 22:37:18,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:18,164 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:18,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1183516497, now seen corresponding path program 1 times [2024-10-10 22:37:18,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:18,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367842231] [2024-10-10 22:37:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-10 22:37:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367842231] [2024-10-10 22:37:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367842231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:18,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:18,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:18,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828783099] [2024-10-10 22:37:18,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:18,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:18,561 INFO L87 Difference]: Start difference. First operand 37454 states and 41119 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 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-10 22:37:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:19,121 INFO L93 Difference]: Finished difference Result 72274 states and 79396 transitions. [2024-10-10 22:37:19,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:19,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 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 377 [2024-10-10 22:37:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:19,166 INFO L225 Difference]: With dead ends: 72274 [2024-10-10 22:37:19,166 INFO L226 Difference]: Without dead ends: 44180 [2024-10-10 22:37:19,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:19,314 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:19,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 135 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44180 states. [2024-10-10 22:37:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44180 to 44174. [2024-10-10 22:37:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44174 states, 44173 states have (on average 1.0956013854617075) internal successors, (48396), 44173 states have internal predecessors, (48396), 0 states have call successors, (0), 0 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-10 22:37:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44174 states to 44174 states and 48396 transitions. [2024-10-10 22:37:19,866 INFO L78 Accepts]: Start accepts. Automaton has 44174 states and 48396 transitions. Word has length 377 [2024-10-10 22:37:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:19,866 INFO L471 AbstractCegarLoop]: Abstraction has 44174 states and 48396 transitions. [2024-10-10 22:37:19,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 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-10 22:37:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 44174 states and 48396 transitions. [2024-10-10 22:37:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-10-10 22:37:19,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:19,906 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:19,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:37:19,906 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:19,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2118200640, now seen corresponding path program 1 times [2024-10-10 22:37:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:19,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682842694] [2024-10-10 22:37:19,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:19,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-10 22:37:20,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682842694] [2024-10-10 22:37:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682842694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:20,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:20,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:20,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398017027] [2024-10-10 22:37:20,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:20,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:20,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:20,600 INFO L87 Difference]: Start difference. First operand 44174 states and 48396 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 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-10 22:37:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:21,413 INFO L93 Difference]: Finished difference Result 87141 states and 95540 transitions. [2024-10-10 22:37:21,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:21,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 384 [2024-10-10 22:37:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:21,471 INFO L225 Difference]: With dead ends: 87141 [2024-10-10 22:37:21,471 INFO L226 Difference]: Without dead ends: 45404 [2024-10-10 22:37:21,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:21,501 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 500 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:21,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 105 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45404 states. [2024-10-10 22:37:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45404 to 44991. [2024-10-10 22:37:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44991 states, 44990 states have (on average 1.0946654812180485) internal successors, (49249), 44990 states have internal predecessors, (49249), 0 states have call successors, (0), 0 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-10 22:37:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44991 states to 44991 states and 49249 transitions. [2024-10-10 22:37:22,162 INFO L78 Accepts]: Start accepts. Automaton has 44991 states and 49249 transitions. Word has length 384 [2024-10-10 22:37:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 44991 states and 49249 transitions. [2024-10-10 22:37:22,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 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-10 22:37:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 44991 states and 49249 transitions. [2024-10-10 22:37:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-10 22:37:22,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:22,207 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:22,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:37:22,208 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:22,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:22,208 INFO L85 PathProgramCache]: Analyzing trace with hash -561846913, now seen corresponding path program 1 times [2024-10-10 22:37:22,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:22,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174466238] [2024-10-10 22:37:22,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:22,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 183 proven. 6 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-10 22:37:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:22,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174466238] [2024-10-10 22:37:22,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174466238] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:22,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220105982] [2024-10-10 22:37:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:22,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:22,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:37:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:22,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:22,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-10 22:37:22,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220105982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:22,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:22,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871495207] [2024-10-10 22:37:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:22,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:22,916 INFO L87 Difference]: Start difference. First operand 44991 states and 49249 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-10 22:37:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:23,499 INFO L93 Difference]: Finished difference Result 85097 states and 93211 transitions. [2024-10-10 22:37:23,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:23,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 432 [2024-10-10 22:37:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:23,551 INFO L225 Difference]: With dead ends: 85097 [2024-10-10 22:37:23,551 INFO L226 Difference]: Without dead ends: 42547 [2024-10-10 22:37:23,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:23,584 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 216 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:23,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 80 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42547 states. [2024-10-10 22:37:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42547 to 40503. [2024-10-10 22:37:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40503 states, 40502 states have (on average 1.083724260530344) internal successors, (43893), 40502 states have internal predecessors, (43893), 0 states have call successors, (0), 0 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-10 22:37:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40503 states to 40503 states and 43893 transitions. [2024-10-10 22:37:24,092 INFO L78 Accepts]: Start accepts. Automaton has 40503 states and 43893 transitions. Word has length 432 [2024-10-10 22:37:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:24,093 INFO L471 AbstractCegarLoop]: Abstraction has 40503 states and 43893 transitions. [2024-10-10 22:37:24,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-10 22:37:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 40503 states and 43893 transitions. [2024-10-10 22:37:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-10-10 22:37:24,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:24,131 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:24,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:37:24,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-10 22:37:24,332 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:24,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash -832725514, now seen corresponding path program 1 times [2024-10-10 22:37:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:24,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196914953] [2024-10-10 22:37:24,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-10-10 22:37:24,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:24,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196914953] [2024-10-10 22:37:24,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196914953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:24,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773869285] [2024-10-10 22:37:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:24,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:24,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:24,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:37:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:24,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:24,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-10 22:37:25,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773869285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:25,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154744315] [2024-10-10 22:37:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:25,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:25,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:25,010 INFO L87 Difference]: Start difference. First operand 40503 states and 43893 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-10 22:37:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:25,596 INFO L93 Difference]: Finished difference Result 78163 states and 84732 transitions. [2024-10-10 22:37:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:25,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 467 [2024-10-10 22:37:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:25,646 INFO L225 Difference]: With dead ends: 78163 [2024-10-10 22:37:25,646 INFO L226 Difference]: Without dead ends: 39898 [2024-10-10 22:37:25,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:25,674 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 159 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:25,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 108 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39898 states. [2024-10-10 22:37:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39898 to 36644. [2024-10-10 22:37:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36644 states, 36643 states have (on average 1.0686625003411292) internal successors, (39159), 36643 states have internal predecessors, (39159), 0 states have call successors, (0), 0 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-10 22:37:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36644 states to 36644 states and 39159 transitions. [2024-10-10 22:37:26,084 INFO L78 Accepts]: Start accepts. Automaton has 36644 states and 39159 transitions. Word has length 467 [2024-10-10 22:37:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:26,085 INFO L471 AbstractCegarLoop]: Abstraction has 36644 states and 39159 transitions. [2024-10-10 22:37:26,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-10 22:37:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 36644 states and 39159 transitions. [2024-10-10 22:37:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-10-10 22:37:26,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:26,113 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:26,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 22:37:26,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-10 22:37:26,314 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:26,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash 30565433, now seen corresponding path program 1 times [2024-10-10 22:37:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:26,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272111575] [2024-10-10 22:37:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 449 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-10 22:37:26,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:26,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272111575] [2024-10-10 22:37:26,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272111575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:26,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209247877] [2024-10-10 22:37:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:26,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:26,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:26,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:26,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:37:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:26,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:26,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-10-10 22:37:27,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:27,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209247877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:27,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:27,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-10 22:37:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872445375] [2024-10-10 22:37:27,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:27,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:27,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:27,137 INFO L87 Difference]: Start difference. First operand 36644 states and 39159 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 2 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-10 22:37:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:27,452 INFO L93 Difference]: Finished difference Result 94873 states and 101343 transitions. [2024-10-10 22:37:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:27,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 2 states have internal predecessors, (332), 0 states have call successors, (0), 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 471 [2024-10-10 22:37:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:27,519 INFO L225 Difference]: With dead ends: 94873 [2024-10-10 22:37:27,519 INFO L226 Difference]: Without dead ends: 60467 [2024-10-10 22:37:27,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:27,551 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 162 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:27,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 473 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:37:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60467 states. [2024-10-10 22:37:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60467 to 54756. [2024-10-10 22:37:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54756 states, 54755 states have (on average 1.065345630536024) internal successors, (58333), 54755 states have internal predecessors, (58333), 0 states have call successors, (0), 0 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-10 22:37:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54756 states to 54756 states and 58333 transitions. [2024-10-10 22:37:28,231 INFO L78 Accepts]: Start accepts. Automaton has 54756 states and 58333 transitions. Word has length 471 [2024-10-10 22:37:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:28,232 INFO L471 AbstractCegarLoop]: Abstraction has 54756 states and 58333 transitions. [2024-10-10 22:37:28,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 2 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-10 22:37:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 54756 states and 58333 transitions. [2024-10-10 22:37:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-10-10 22:37:28,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:28,264 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:28,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 22:37:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-10 22:37:28,465 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1919537038, now seen corresponding path program 1 times [2024-10-10 22:37:28,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:28,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397997116] [2024-10-10 22:37:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:28,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-10-10 22:37:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397997116] [2024-10-10 22:37:28,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397997116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:28,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:28,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:28,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320642470] [2024-10-10 22:37:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:28,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:28,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:28,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:28,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:28,778 INFO L87 Difference]: Start difference. First operand 54756 states and 58333 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-10 22:37:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:29,473 INFO L93 Difference]: Finished difference Result 121755 states and 129863 transitions. [2024-10-10 22:37:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:29,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 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 483 [2024-10-10 22:37:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:29,566 INFO L225 Difference]: With dead ends: 121755 [2024-10-10 22:37:29,566 INFO L226 Difference]: Without dead ends: 75134 [2024-10-10 22:37:29,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:29,603 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 114 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:29,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 115 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75134 states. [2024-10-10 22:37:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75134 to 73705. [2024-10-10 22:37:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73705 states, 73704 states have (on average 1.0674725930750026) internal successors, (78677), 73704 states have internal predecessors, (78677), 0 states have call successors, (0), 0 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-10 22:37:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73705 states to 73705 states and 78677 transitions. [2024-10-10 22:37:30,611 INFO L78 Accepts]: Start accepts. Automaton has 73705 states and 78677 transitions. Word has length 483 [2024-10-10 22:37:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:30,611 INFO L471 AbstractCegarLoop]: Abstraction has 73705 states and 78677 transitions. [2024-10-10 22:37:30,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-10 22:37:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 73705 states and 78677 transitions. [2024-10-10 22:37:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-10 22:37:30,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:30,655 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:30,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 22:37:30,655 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash 302457533, now seen corresponding path program 1 times [2024-10-10 22:37:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738101105] [2024-10-10 22:37:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 278 proven. 6 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-10-10 22:37:32,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738101105] [2024-10-10 22:37:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738101105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911066071] [2024-10-10 22:37:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:32,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:32,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:32,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:32,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:37:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:32,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:32,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-10 22:37:33,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911066071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:33,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:33,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:37:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683538652] [2024-10-10 22:37:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:33,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:33,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:33,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:33,061 INFO L87 Difference]: Start difference. First operand 73705 states and 78677 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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-10 22:37:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:33,679 INFO L93 Difference]: Finished difference Result 73725 states and 78703 transitions. [2024-10-10 22:37:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:33,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 490 [2024-10-10 22:37:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:33,760 INFO L225 Difference]: With dead ends: 73725 [2024-10-10 22:37:33,760 INFO L226 Difference]: Without dead ends: 73723 [2024-10-10 22:37:33,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:33,781 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:33,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 56 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73723 states. [2024-10-10 22:37:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73723 to 73705. [2024-10-10 22:37:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73705 states, 73704 states have (on average 1.0674590252903506) internal successors, (78676), 73704 states have internal predecessors, (78676), 0 states have call successors, (0), 0 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-10 22:37:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73705 states to 73705 states and 78676 transitions. [2024-10-10 22:37:34,606 INFO L78 Accepts]: Start accepts. Automaton has 73705 states and 78676 transitions. Word has length 490 [2024-10-10 22:37:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:34,607 INFO L471 AbstractCegarLoop]: Abstraction has 73705 states and 78676 transitions. [2024-10-10 22:37:34,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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-10 22:37:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 73705 states and 78676 transitions. [2024-10-10 22:37:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-10-10 22:37:34,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:34,649 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:34,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-10 22:37:34,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:34,850 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:34,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1161339399, now seen corresponding path program 1 times [2024-10-10 22:37:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:34,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937808819] [2024-10-10 22:37:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 377 proven. 95 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-10 22:37:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937808819] [2024-10-10 22:37:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937808819] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681219657] [2024-10-10 22:37:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:35,447 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:35,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:37:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:35,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:35,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-10 22:37:35,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681219657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:35,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:35,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:35,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328211754] [2024-10-10 22:37:35,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:35,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:35,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:35,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:35,715 INFO L87 Difference]: Start difference. First operand 73705 states and 78676 transitions. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 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-10 22:37:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:36,488 INFO L93 Difference]: Finished difference Result 147425 states and 157503 transitions. [2024-10-10 22:37:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:36,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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 491 [2024-10-10 22:37:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:36,578 INFO L225 Difference]: With dead ends: 147425 [2024-10-10 22:37:36,579 INFO L226 Difference]: Without dead ends: 74127 [2024-10-10 22:37:36,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:36,593 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 129 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:36,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 290 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74127 states. [2024-10-10 22:37:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74127 to 73697. [2024-10-10 22:37:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73697 states, 73696 states have (on average 1.066394376899696) internal successors, (78589), 73696 states have internal predecessors, (78589), 0 states have call successors, (0), 0 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-10 22:37:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73697 states to 73697 states and 78589 transitions. [2024-10-10 22:37:37,604 INFO L78 Accepts]: Start accepts. Automaton has 73697 states and 78589 transitions. Word has length 491 [2024-10-10 22:37:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:37,604 INFO L471 AbstractCegarLoop]: Abstraction has 73697 states and 78589 transitions. [2024-10-10 22:37:37,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 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-10 22:37:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 73697 states and 78589 transitions. [2024-10-10 22:37:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-10-10 22:37:37,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:37,670 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:37,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-10 22:37:37,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-10 22:37:37,871 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:37,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:37,871 INFO L85 PathProgramCache]: Analyzing trace with hash -541163721, now seen corresponding path program 1 times [2024-10-10 22:37:37,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:37,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343682218] [2024-10-10 22:37:37,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:37,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-10-10 22:37:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343682218] [2024-10-10 22:37:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343682218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362521414] [2024-10-10 22:37:38,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:38,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:38,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:38,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:38,424 INFO L87 Difference]: Start difference. First operand 73697 states and 78589 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-10 22:37:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:39,129 INFO L93 Difference]: Finished difference Result 203602 states and 217326 transitions. [2024-10-10 22:37:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:39,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 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 504 [2024-10-10 22:37:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:39,286 INFO L225 Difference]: With dead ends: 203602 [2024-10-10 22:37:39,286 INFO L226 Difference]: Without dead ends: 131532 [2024-10-10 22:37:39,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:39,315 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 178 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:39,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 470 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:37:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131532 states. [2024-10-10 22:37:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131532 to 129702. [2024-10-10 22:37:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129702 states, 129701 states have (on average 1.066529941943393) internal successors, (138330), 129701 states have internal predecessors, (138330), 0 states have call successors, (0), 0 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-10 22:37:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129702 states to 129702 states and 138330 transitions. [2024-10-10 22:37:41,497 INFO L78 Accepts]: Start accepts. Automaton has 129702 states and 138330 transitions. Word has length 504 [2024-10-10 22:37:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:41,498 INFO L471 AbstractCegarLoop]: Abstraction has 129702 states and 138330 transitions. [2024-10-10 22:37:41,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-10 22:37:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 129702 states and 138330 transitions. [2024-10-10 22:37:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2024-10-10 22:37:41,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:41,600 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:41,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-10 22:37:41,600 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:41,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1019277016, now seen corresponding path program 1 times [2024-10-10 22:37:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851154062] [2024-10-10 22:37:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-10 22:37:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:42,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851154062] [2024-10-10 22:37:42,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851154062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:42,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:42,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728283025] [2024-10-10 22:37:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:42,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:42,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:42,126 INFO L87 Difference]: Start difference. First operand 129702 states and 138330 transitions. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-10 22:37:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:43,582 INFO L93 Difference]: Finished difference Result 309678 states and 330344 transitions. [2024-10-10 22:37:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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 520 [2024-10-10 22:37:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:43,831 INFO L225 Difference]: With dead ends: 309678 [2024-10-10 22:37:43,831 INFO L226 Difference]: Without dead ends: 182215 [2024-10-10 22:37:43,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:43,887 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 316 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:43,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 426 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182215 states. [2024-10-10 22:37:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182215 to 180386. [2024-10-10 22:37:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180386 states, 180385 states have (on average 1.066430135543421) internal successors, (192368), 180385 states have internal predecessors, (192368), 0 states have call successors, (0), 0 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-10 22:37:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180386 states to 180386 states and 192368 transitions. [2024-10-10 22:37:46,695 INFO L78 Accepts]: Start accepts. Automaton has 180386 states and 192368 transitions. Word has length 520 [2024-10-10 22:37:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:46,695 INFO L471 AbstractCegarLoop]: Abstraction has 180386 states and 192368 transitions. [2024-10-10 22:37:46,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-10 22:37:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 180386 states and 192368 transitions. [2024-10-10 22:37:47,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2024-10-10 22:37:47,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:47,144 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:47,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-10 22:37:47,145 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:47,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash -279632389, now seen corresponding path program 1 times [2024-10-10 22:37:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:47,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540740298] [2024-10-10 22:37:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 361 proven. 9 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-10-10 22:37:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540740298] [2024-10-10 22:37:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540740298] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427549609] [2024-10-10 22:37:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:47,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:47,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:47,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:47,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:37:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:48,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:37:48,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-10-10 22:37:48,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427549609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:48,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:48,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:37:48,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854859845] [2024-10-10 22:37:48,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:48,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:48,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:48,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:48,202 INFO L87 Difference]: Start difference. First operand 180386 states and 192368 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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-10 22:37:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:49,478 INFO L93 Difference]: Finished difference Result 359988 states and 384069 transitions. [2024-10-10 22:37:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:49,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 533 [2024-10-10 22:37:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:49,740 INFO L225 Difference]: With dead ends: 359988 [2024-10-10 22:37:49,741 INFO L226 Difference]: Without dead ends: 181227 [2024-10-10 22:37:49,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:49,814 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 210 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:49,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 321 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181227 states. [2024-10-10 22:37:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181227 to 177537. [2024-10-10 22:37:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177537 states, 177536 states have (on average 1.0660091474405191) internal successors, (189255), 177536 states have internal predecessors, (189255), 0 states have call successors, (0), 0 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-10 22:37:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177537 states to 177537 states and 189255 transitions. [2024-10-10 22:37:52,965 INFO L78 Accepts]: Start accepts. Automaton has 177537 states and 189255 transitions. Word has length 533 [2024-10-10 22:37:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:52,966 INFO L471 AbstractCegarLoop]: Abstraction has 177537 states and 189255 transitions. [2024-10-10 22:37:52,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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-10 22:37:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 177537 states and 189255 transitions. [2024-10-10 22:37:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2024-10-10 22:37:53,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:53,039 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:53,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-10 22:37:53,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:53,241 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 540634205, now seen corresponding path program 1 times [2024-10-10 22:37:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828559818] [2024-10-10 22:37:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 148 proven. 6 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2024-10-10 22:37:54,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828559818] [2024-10-10 22:37:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828559818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:54,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146936127] [2024-10-10 22:37:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:54,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:54,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:54,101 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:54,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-10 22:37:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:54,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:37:54,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-10-10 22:37:54,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:54,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146936127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:54,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:54,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:54,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271320745] [2024-10-10 22:37:54,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:54,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:54,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:54,508 INFO L87 Difference]: Start difference. First operand 177537 states and 189255 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 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-10 22:37:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:55,846 INFO L93 Difference]: Finished difference Result 342041 states and 364552 transitions. [2024-10-10 22:37:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:55,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 548 [2024-10-10 22:37:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:56,079 INFO L225 Difference]: With dead ends: 342041 [2024-10-10 22:37:56,080 INFO L226 Difference]: Without dead ends: 163689 [2024-10-10 22:37:56,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:56,188 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 99 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:56,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 295 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:56,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163689 states. [2024-10-10 22:37:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163689 to 152488. [2024-10-10 22:37:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152488 states, 152487 states have (on average 1.0542210155619822) internal successors, (160755), 152487 states have internal predecessors, (160755), 0 states have call successors, (0), 0 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-10 22:37:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152488 states to 152488 states and 160755 transitions. [2024-10-10 22:37:58,648 INFO L78 Accepts]: Start accepts. Automaton has 152488 states and 160755 transitions. Word has length 548 [2024-10-10 22:37:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:58,649 INFO L471 AbstractCegarLoop]: Abstraction has 152488 states and 160755 transitions. [2024-10-10 22:37:58,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 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-10 22:37:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 152488 states and 160755 transitions. [2024-10-10 22:37:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2024-10-10 22:37:58,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:58,710 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:37:58,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-10 22:37:58,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-10 22:37:58,913 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:58,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:58,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1447790125, now seen corresponding path program 1 times [2024-10-10 22:37:58,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:58,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150455107] [2024-10-10 22:37:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 549 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150455107] [2024-10-10 22:37:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150455107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282807933] [2024-10-10 22:37:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:59,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:59,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:59,907 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:59,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-10 22:38:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:00,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:38:00,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 22:38:00,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:38:00,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282807933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:38:00,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:38:00,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-10 22:38:00,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636455875] [2024-10-10 22:38:00,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:38:00,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:38:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:38:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:38:00,293 INFO L87 Difference]: Start difference. First operand 152488 states and 160755 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)