./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/Problem17_label00.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/Problem17_label00.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 28aa2103046ded31b2c668ebdabdc65e41c8f634ba4d86773363e431476a6327 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:44:27,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:44:27,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:44:27,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:44:27,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:44:27,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:44:27,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:44:27,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:44:27,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:44:27,637 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:44:27,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:44:27,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:44:27,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:44:27,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:44:27,640 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:44:27,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:44:27,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:44:27,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:44:27,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:44:27,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:44:27,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:44:27,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:44:27,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:44:27,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:44:27,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:44:27,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:44:27,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:44:27,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:44:27,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:44:27,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:44:27,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:44:27,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:44:27,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:44:27,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:44:27,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:44:27,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:44:27,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:44:27,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:44:27,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:44:27,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:44:27,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:44:27,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:44:27,648 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 -> 28aa2103046ded31b2c668ebdabdc65e41c8f634ba4d86773363e431476a6327 [2024-10-10 23:44:27,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:44:27,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:44:27,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:44:27,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:44:27,889 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:44:27,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label00.c [2024-10-10 23:44:29,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:44:29,582 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:44:29,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label00.c [2024-10-10 23:44:29,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/41e737d28/4b48814f6e4740de988b71ffdc18fa07/FLAG04252fea8 [2024-10-10 23:44:29,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/41e737d28/4b48814f6e4740de988b71ffdc18fa07 [2024-10-10 23:44:29,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:44:29,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:44:29,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:44:29,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:44:29,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:44:29,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:44:29" (1/1) ... [2024-10-10 23:44:29,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4139b58e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:29, skipping insertion in model container [2024-10-10 23:44:29,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:44:29" (1/1) ... [2024-10-10 23:44:29,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:44:30,065 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/Problem17_label00.c[7994,8007] [2024-10-10 23:44:30,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:44:30,397 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:44:30,418 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/Problem17_label00.c[7994,8007] [2024-10-10 23:44:30,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:44:30,598 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:44:30,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30 WrapperNode [2024-10-10 23:44:30,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:44:30,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:44:30,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:44:30,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:44:30,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:30,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:30,867 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:44:30,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:44:30,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:44:30,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:44:30,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:44:30,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:30,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:30,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:31,087 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 23:44:31,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:31,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:31,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:31,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:31,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:31,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:31,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:44:31,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:44:31,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:44:31,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:44:31,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:31,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:44:31,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:44:31,262 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 23:44:31,264 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 23:44:31,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:44:31,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:44:31,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:44:31,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:44:31,349 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:44:31,351 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:44:33,956 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:44:33,956 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:44:34,019 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:44:34,019 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:44:34,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:44:34 BoogieIcfgContainer [2024-10-10 23:44:34,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:44:34,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:44:34,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:44:34,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:44:34,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:44:29" (1/3) ... [2024-10-10 23:44:34,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395d88ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:44:34, skipping insertion in model container [2024-10-10 23:44:34,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30" (2/3) ... [2024-10-10 23:44:34,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395d88ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:44:34, skipping insertion in model container [2024-10-10 23:44:34,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:44:34" (3/3) ... [2024-10-10 23:44:34,030 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label00.c [2024-10-10 23:44:34,042 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:44:34,042 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:44:34,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:44:34,123 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;@30b4c2cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:44:34,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:44:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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 23:44:34,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 23:44:34,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:34,149 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] [2024-10-10 23:44:34,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:34,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1866133670, now seen corresponding path program 1 times [2024-10-10 23:44:34,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:34,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524272731] [2024-10-10 23:44:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:34,493 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 23:44:34,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:34,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524272731] [2024-10-10 23:44:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524272731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:34,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:34,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:34,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024481943] [2024-10-10 23:44:34,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:34,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:44:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:34,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:44:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:44:34,532 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23:44:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:34,670 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:44:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:44:34,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-10 23:44:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:34,695 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:44:34,695 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:44:34,699 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 23:44:34,701 INFO L432 NwaCegarLoop]: 935 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, 935 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 23:44:34,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:44:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:44:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:44:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states 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 23:44:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:44:34,748 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 53 [2024-10-10 23:44:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:34,748 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:44:34,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23:44:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:44:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 23:44:34,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:34,749 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] [2024-10-10 23:44:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:44:34,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:34,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 184422738, now seen corresponding path program 1 times [2024-10-10 23:44:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059061183] [2024-10-10 23:44:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:34,931 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 23:44:34,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:34,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059061183] [2024-10-10 23:44:34,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059061183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:34,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:34,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:34,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944494305] [2024-10-10 23:44:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:34,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:34,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:34,936 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23:44:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:37,029 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2024-10-10 23:44:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:37,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-10 23:44:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:37,034 INFO L225 Difference]: With dead ends: 1499 [2024-10-10 23:44:37,034 INFO L226 Difference]: Without dead ends: 974 [2024-10-10 23:44:37,034 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 23:44:37,036 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 420 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:37,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 495 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:44:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-10 23:44:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2024-10-10 23:44:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states 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 23:44:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2024-10-10 23:44:37,066 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 53 [2024-10-10 23:44:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:37,066 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2024-10-10 23:44:37,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23:44:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2024-10-10 23:44:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-10 23:44:37,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:37,072 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, 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 23:44:37,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:44:37,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:37,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1375403422, now seen corresponding path program 1 times [2024-10-10 23:44:37,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:37,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015250469] [2024-10-10 23:44:37,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:37,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:37,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:37,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015250469] [2024-10-10 23:44:37,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015250469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:37,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:37,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652515499] [2024-10-10 23:44:37,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:37,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:44:37,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:37,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:44:37,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:44:37,412 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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 23:44:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:40,734 INFO L93 Difference]: Finished difference Result 3736 states and 5654 transitions. [2024-10-10 23:44:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:44:40,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-10-10 23:44:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:40,745 INFO L225 Difference]: With dead ends: 3736 [2024-10-10 23:44:40,746 INFO L226 Difference]: Without dead ends: 2766 [2024-10-10 23:44:40,748 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 23:44:40,749 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 908 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 3334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:40,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 268 Invalid, 3334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:44:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2024-10-10 23:44:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2723. [2024-10-10 23:44:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2722 states have (on average 1.3949301983835416) internal successors, (3797), 2722 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states 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 23:44:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3797 transitions. [2024-10-10 23:44:40,807 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3797 transitions. Word has length 123 [2024-10-10 23:44:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:40,808 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 3797 transitions. [2024-10-10 23:44:40,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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 23:44:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3797 transitions. [2024-10-10 23:44:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-10 23:44:40,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:40,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:44:40,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:44:40,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:40,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:40,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2133161281, now seen corresponding path program 1 times [2024-10-10 23:44:40,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:40,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41537841] [2024-10-10 23:44:40,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:40,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:40,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:40,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41537841] [2024-10-10 23:44:40,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41537841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:40,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:40,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:40,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070749655] [2024-10-10 23:44:40,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:40,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:40,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:40,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:40,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:40,967 INFO L87 Difference]: Start difference. First operand 2723 states and 3797 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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 23:44:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:42,917 INFO L93 Difference]: Finished difference Result 8008 states and 11160 transitions. [2024-10-10 23:44:42,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:42,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-10 23:44:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:42,933 INFO L225 Difference]: With dead ends: 8008 [2024-10-10 23:44:42,933 INFO L226 Difference]: Without dead ends: 4427 [2024-10-10 23:44:42,938 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 23:44:42,939 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:42,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:44:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2024-10-10 23:44:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 4427. [2024-10-10 23:44:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 4426 states have (on average 1.2071848169905106) internal successors, (5343), 4426 states have internal predecessors, (5343), 0 states have call successors, (0), 0 states 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 23:44:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 5343 transitions. [2024-10-10 23:44:43,021 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 5343 transitions. Word has length 145 [2024-10-10 23:44:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:43,022 INFO L471 AbstractCegarLoop]: Abstraction has 4427 states and 5343 transitions. [2024-10-10 23:44:43,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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 23:44:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 5343 transitions. [2024-10-10 23:44:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-10 23:44:43,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:43,027 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:43,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:44:43,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:43,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash -437070539, now seen corresponding path program 1 times [2024-10-10 23:44:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560525369] [2024-10-10 23:44:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:43,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560525369] [2024-10-10 23:44:43,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560525369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:43,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:43,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582929384] [2024-10-10 23:44:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:43,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:43,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:43,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:43,459 INFO L87 Difference]: Start difference. First operand 4427 states and 5343 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 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 23:44:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:44,970 INFO L93 Difference]: Finished difference Result 10988 states and 13619 transitions. [2024-10-10 23:44:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:44,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 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 205 [2024-10-10 23:44:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:44,985 INFO L225 Difference]: With dead ends: 10988 [2024-10-10 23:44:44,985 INFO L226 Difference]: Without dead ends: 6562 [2024-10-10 23:44:44,990 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 23:44:44,990 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:44,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 798 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:44:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2024-10-10 23:44:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6562. [2024-10-10 23:44:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6562 states, 6561 states have (on average 1.2025605852766346) internal successors, (7890), 6561 states have internal predecessors, (7890), 0 states have call successors, (0), 0 states 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 23:44:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 7890 transitions. [2024-10-10 23:44:45,058 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 7890 transitions. Word has length 205 [2024-10-10 23:44:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:45,058 INFO L471 AbstractCegarLoop]: Abstraction has 6562 states and 7890 transitions. [2024-10-10 23:44:45,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 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 23:44:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 7890 transitions. [2024-10-10 23:44:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-10 23:44:45,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:45,060 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:45,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:44:45,060 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:45,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash -470195344, now seen corresponding path program 1 times [2024-10-10 23:44:45,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:45,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76161455] [2024-10-10 23:44:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:45,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:44:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:45,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76161455] [2024-10-10 23:44:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76161455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:45,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:45,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:45,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327069056] [2024-10-10 23:44:45,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:45,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:45,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:45,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:45,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:45,185 INFO L87 Difference]: Start difference. First operand 6562 states and 7890 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 23:44:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:46,924 INFO L93 Difference]: Finished difference Result 16520 states and 20209 transitions. [2024-10-10 23:44:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:46,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 207 [2024-10-10 23:44:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:46,943 INFO L225 Difference]: With dead ends: 16520 [2024-10-10 23:44:46,944 INFO L226 Difference]: Without dead ends: 9959 [2024-10-10 23:44:46,947 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 23:44:46,948 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 399 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:46,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 484 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:44:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9959 states. [2024-10-10 23:44:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9959 to 6960. [2024-10-10 23:44:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6960 states, 6959 states have (on average 1.1939933898548643) internal successors, (8309), 6959 states have internal predecessors, (8309), 0 states have call successors, (0), 0 states 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 23:44:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6960 states to 6960 states and 8309 transitions. [2024-10-10 23:44:47,030 INFO L78 Accepts]: Start accepts. Automaton has 6960 states and 8309 transitions. Word has length 207 [2024-10-10 23:44:47,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:47,030 INFO L471 AbstractCegarLoop]: Abstraction has 6960 states and 8309 transitions. [2024-10-10 23:44:47,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 23:44:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6960 states and 8309 transitions. [2024-10-10 23:44:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-10 23:44:47,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:47,033 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, 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, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:47,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:44:47,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:47,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1668185292, now seen corresponding path program 1 times [2024-10-10 23:44:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:47,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918296045] [2024-10-10 23:44:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:44:47,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:47,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918296045] [2024-10-10 23:44:47,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918296045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:47,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:47,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:47,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514276934] [2024-10-10 23:44:47,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:47,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:47,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:47,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:47,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:47,152 INFO L87 Difference]: Start difference. First operand 6960 states and 8309 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 23:44:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:48,803 INFO L93 Difference]: Finished difference Result 17323 states and 21058 transitions. [2024-10-10 23:44:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-10-10 23:44:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:48,828 INFO L225 Difference]: With dead ends: 17323 [2024-10-10 23:44:48,828 INFO L226 Difference]: Without dead ends: 10364 [2024-10-10 23:44:48,835 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 23:44:48,836 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 423 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:48,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 450 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:44:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10364 states. [2024-10-10 23:44:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10364 to 9508. [2024-10-10 23:44:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9508 states, 9507 states have (on average 1.1959608709372043) internal successors, (11370), 9507 states have internal predecessors, (11370), 0 states have call successors, (0), 0 states 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 23:44:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 11370 transitions. [2024-10-10 23:44:48,944 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 11370 transitions. Word has length 220 [2024-10-10 23:44:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:48,945 INFO L471 AbstractCegarLoop]: Abstraction has 9508 states and 11370 transitions. [2024-10-10 23:44:48,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 23:44:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 11370 transitions. [2024-10-10 23:44:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-10 23:44:48,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:48,947 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:44:48,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:44:48,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:48,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1774281270, now seen corresponding path program 1 times [2024-10-10 23:44:48,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:48,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848217854] [2024-10-10 23:44:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:44:49,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:49,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848217854] [2024-10-10 23:44:49,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848217854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:49,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:49,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:49,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044783063] [2024-10-10 23:44:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:49,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:49,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:49,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:49,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:49,092 INFO L87 Difference]: Start difference. First operand 9508 states and 11370 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 23:44:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:50,870 INFO L93 Difference]: Finished difference Result 25398 states and 30226 transitions. [2024-10-10 23:44:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 252 [2024-10-10 23:44:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:50,891 INFO L225 Difference]: With dead ends: 25398 [2024-10-10 23:44:50,891 INFO L226 Difference]: Without dead ends: 15891 [2024-10-10 23:44:50,900 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 23:44:50,901 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 484 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:50,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 280 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:44:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15891 states. [2024-10-10 23:44:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15891 to 14183. [2024-10-10 23:44:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14183 states, 14182 states have (on average 1.1846001974333662) internal successors, (16800), 14182 states have internal predecessors, (16800), 0 states have call successors, (0), 0 states 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 23:44:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14183 states to 14183 states and 16800 transitions. [2024-10-10 23:44:51,028 INFO L78 Accepts]: Start accepts. Automaton has 14183 states and 16800 transitions. Word has length 252 [2024-10-10 23:44:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:51,029 INFO L471 AbstractCegarLoop]: Abstraction has 14183 states and 16800 transitions. [2024-10-10 23:44:51,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 23:44:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 14183 states and 16800 transitions. [2024-10-10 23:44:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-10 23:44:51,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:51,037 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:44:51,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:44:51,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:51,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1927600320, now seen corresponding path program 1 times [2024-10-10 23:44:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644644141] [2024-10-10 23:44:51,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:51,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:44:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:51,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644644141] [2024-10-10 23:44:51,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644644141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:51,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:51,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:51,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463126524] [2024-10-10 23:44:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:51,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:51,326 INFO L87 Difference]: Start difference. First operand 14183 states and 16800 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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 23:44:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:53,416 INFO L93 Difference]: Finished difference Result 33920 states and 40605 transitions. [2024-10-10 23:44:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 269 [2024-10-10 23:44:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:53,446 INFO L225 Difference]: With dead ends: 33920 [2024-10-10 23:44:53,446 INFO L226 Difference]: Without dead ends: 19738 [2024-10-10 23:44:53,459 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 23:44:53,460 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 454 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:53,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 452 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:44:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19738 states. [2024-10-10 23:44:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19738 to 18028. [2024-10-10 23:44:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18028 states, 18027 states have (on average 1.2058578798468964) internal successors, (21738), 18027 states have internal predecessors, (21738), 0 states have call successors, (0), 0 states 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 23:44:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 21738 transitions. [2024-10-10 23:44:53,697 INFO L78 Accepts]: Start accepts. Automaton has 18028 states and 21738 transitions. Word has length 269 [2024-10-10 23:44:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:53,698 INFO L471 AbstractCegarLoop]: Abstraction has 18028 states and 21738 transitions. [2024-10-10 23:44:53,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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 23:44:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 18028 states and 21738 transitions. [2024-10-10 23:44:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-10 23:44:53,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:53,703 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, 4, 4, 4, 3, 3, 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] [2024-10-10 23:44:53,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:44:53,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:53,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:53,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1992306372, now seen corresponding path program 1 times [2024-10-10 23:44:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105359117] [2024-10-10 23:44:53,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:53,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 242 proven. 70 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-10 23:44:54,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:54,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105359117] [2024-10-10 23:44:54,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105359117] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:44:54,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320431460] [2024-10-10 23:44:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:54,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:44:54,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:44:54,044 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 23:44:54,045 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 23:44:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:54,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:44:54,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:44:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 242 proven. 70 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-10 23:44:54,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:44:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-10 23:44:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320431460] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:44:54,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:44:54,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:44:54,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314384586] [2024-10-10 23:44:54,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:54,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:44:54,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:54,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:44:54,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:44:54,620 INFO L87 Difference]: Start difference. First operand 18028 states and 21738 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:44:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:57,577 INFO L93 Difference]: Finished difference Result 49691 states and 60241 transitions. [2024-10-10 23:44:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:44:57,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2024-10-10 23:44:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:57,628 INFO L225 Difference]: With dead ends: 49691 [2024-10-10 23:44:57,632 INFO L226 Difference]: Without dead ends: 30793 [2024-10-10 23:44:57,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:44:57,663 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 880 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 736 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:57,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 151 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [736 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:44:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30793 states. [2024-10-10 23:44:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30793 to 30366. [2024-10-10 23:44:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30366 states, 30365 states have (on average 1.1689445084801582) internal successors, (35495), 30365 states have internal predecessors, (35495), 0 states have call successors, (0), 0 states 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 23:44:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30366 states to 30366 states and 35495 transitions. [2024-10-10 23:44:57,899 INFO L78 Accepts]: Start accepts. Automaton has 30366 states and 35495 transitions. Word has length 277 [2024-10-10 23:44:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:57,899 INFO L471 AbstractCegarLoop]: Abstraction has 30366 states and 35495 transitions. [2024-10-10 23:44:57,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:44:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 30366 states and 35495 transitions. [2024-10-10 23:44:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-10 23:44:57,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:57,902 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, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:57,915 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 23:44:58,103 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 23:44:58,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:58,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash -547710925, now seen corresponding path program 1 times [2024-10-10 23:44:58,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:58,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63868739] [2024-10-10 23:44:58,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:44:58,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:58,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63868739] [2024-10-10 23:44:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63868739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756490503] [2024-10-10 23:44:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:58,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:58,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:58,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:58,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:58,271 INFO L87 Difference]: Start difference. First operand 30366 states and 35495 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 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 23:45:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:00,047 INFO L93 Difference]: Finished difference Result 76488 states and 89022 transitions. [2024-10-10 23:45:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:00,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 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 285 [2024-10-10 23:45:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:00,088 INFO L225 Difference]: With dead ends: 76488 [2024-10-10 23:45:00,088 INFO L226 Difference]: Without dead ends: 44415 [2024-10-10 23:45:00,101 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 23:45:00,102 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 482 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:00,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 608 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:45:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44415 states. [2024-10-10 23:45:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44415 to 39724. [2024-10-10 23:45:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39724 states, 39723 states have (on average 1.144299272461798) internal successors, (45455), 39723 states have internal predecessors, (45455), 0 states have call successors, (0), 0 states 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 23:45:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39724 states to 39724 states and 45455 transitions. [2024-10-10 23:45:00,433 INFO L78 Accepts]: Start accepts. Automaton has 39724 states and 45455 transitions. Word has length 285 [2024-10-10 23:45:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:00,433 INFO L471 AbstractCegarLoop]: Abstraction has 39724 states and 45455 transitions. [2024-10-10 23:45:00,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 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 23:45:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 39724 states and 45455 transitions. [2024-10-10 23:45:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-10-10 23:45:00,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:00,436 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, 4, 4, 4, 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] [2024-10-10 23:45:00,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:45:00,436 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1307338848, now seen corresponding path program 1 times [2024-10-10 23:45:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:00,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882788842] [2024-10-10 23:45:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:45:00,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:00,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882788842] [2024-10-10 23:45:00,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882788842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:00,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:00,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:00,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581060125] [2024-10-10 23:45:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:00,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:00,548 INFO L87 Difference]: Start difference. First operand 39724 states and 45455 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 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 23:45:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:02,192 INFO L93 Difference]: Finished difference Result 84967 states and 97498 transitions. [2024-10-10 23:45:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 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 290 [2024-10-10 23:45:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:02,239 INFO L225 Difference]: With dead ends: 84967 [2024-10-10 23:45:02,240 INFO L226 Difference]: Without dead ends: 45244 [2024-10-10 23:45:02,267 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 23:45:02,268 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 372 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:02,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 823 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:45:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45244 states. [2024-10-10 23:45:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45244 to 44819. [2024-10-10 23:45:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44819 states, 44818 states have (on average 1.1323129099915212) internal successors, (50748), 44818 states have internal predecessors, (50748), 0 states have call successors, (0), 0 states 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 23:45:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44819 states to 44819 states and 50748 transitions. [2024-10-10 23:45:03,086 INFO L78 Accepts]: Start accepts. Automaton has 44819 states and 50748 transitions. Word has length 290 [2024-10-10 23:45:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 44819 states and 50748 transitions. [2024-10-10 23:45:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 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 23:45:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 44819 states and 50748 transitions. [2024-10-10 23:45:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-10-10 23:45:03,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:03,090 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, 4, 4, 4, 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, 1, 1, 1, 1, 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 23:45:03,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:45:03,091 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:03,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash -891598437, now seen corresponding path program 1 times [2024-10-10 23:45:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619558734] [2024-10-10 23:45:03,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:03,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:45:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:03,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619558734] [2024-10-10 23:45:03,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619558734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:03,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:03,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:45:03,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690502945] [2024-10-10 23:45:03,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:03,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:45:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:03,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:45:03,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:45:03,490 INFO L87 Difference]: Start difference. First operand 44819 states and 50748 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 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 23:45:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:06,368 INFO L93 Difference]: Finished difference Result 117358 states and 132889 transitions. [2024-10-10 23:45:06,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:45:06,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 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 313 [2024-10-10 23:45:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:06,443 INFO L225 Difference]: With dead ends: 117358 [2024-10-10 23:45:06,443 INFO L226 Difference]: Without dead ends: 70839 [2024-10-10 23:45:06,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 23:45:06,476 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 851 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 2970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:06,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 293 Invalid, 2970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:45:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70839 states. [2024-10-10 23:45:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70839 to 69510. [2024-10-10 23:45:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69510 states, 69509 states have (on average 1.1229912673179012) internal successors, (78058), 69509 states have internal predecessors, (78058), 0 states have call successors, (0), 0 states 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 23:45:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69510 states to 69510 states and 78058 transitions. [2024-10-10 23:45:07,432 INFO L78 Accepts]: Start accepts. Automaton has 69510 states and 78058 transitions. Word has length 313 [2024-10-10 23:45:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:07,433 INFO L471 AbstractCegarLoop]: Abstraction has 69510 states and 78058 transitions. [2024-10-10 23:45:07,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 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 23:45:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 69510 states and 78058 transitions. [2024-10-10 23:45:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-10 23:45:07,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:07,437 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:45:07,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:45:07,438 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:07,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1171549942, now seen corresponding path program 1 times [2024-10-10 23:45:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624780693] [2024-10-10 23:45:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-10 23:45:08,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:08,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624780693] [2024-10-10 23:45:08,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624780693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:08,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:08,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481786348] [2024-10-10 23:45:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:08,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:08,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:08,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:08,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:08,280 INFO L87 Difference]: Start difference. First operand 69510 states and 78058 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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 23:45:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:10,848 INFO L93 Difference]: Finished difference Result 149690 states and 168125 transitions. [2024-10-10 23:45:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:10,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 328 [2024-10-10 23:45:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:10,956 INFO L225 Difference]: With dead ends: 149690 [2024-10-10 23:45:10,957 INFO L226 Difference]: Without dead ends: 80181 [2024-10-10 23:45:10,980 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 23:45:10,981 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 365 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:10,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 766 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:45:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80181 states. [2024-10-10 23:45:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80181 to 79318. [2024-10-10 23:45:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79318 states, 79317 states have (on average 1.1088795592369858) internal successors, (87953), 79317 states have internal predecessors, (87953), 0 states have call successors, (0), 0 states 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 23:45:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79318 states to 79318 states and 87953 transitions. [2024-10-10 23:45:12,142 INFO L78 Accepts]: Start accepts. Automaton has 79318 states and 87953 transitions. Word has length 328 [2024-10-10 23:45:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:12,146 INFO L471 AbstractCegarLoop]: Abstraction has 79318 states and 87953 transitions. [2024-10-10 23:45:12,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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 23:45:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 79318 states and 87953 transitions. [2024-10-10 23:45:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-10 23:45:12,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:12,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:45:12,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:45:12,155 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:12,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:12,156 INFO L85 PathProgramCache]: Analyzing trace with hash -732796761, now seen corresponding path program 1 times [2024-10-10 23:45:12,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:12,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872676910] [2024-10-10 23:45:12,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:12,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:45:12,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:12,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872676910] [2024-10-10 23:45:12,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872676910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:45:12,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89527845] [2024-10-10 23:45:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:12,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:12,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:45:12,905 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 23:45:12,909 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 23:45:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:13,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:45:13,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:45:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:45:13,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:45:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:45:15,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89527845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:45:15,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:45:15,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-10 23:45:15,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859640063] [2024-10-10 23:45:15,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:45:15,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:45:15,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:15,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:45:15,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:45:15,098 INFO L87 Difference]: Start difference. First operand 79318 states and 87953 transitions. Second operand has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states 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 23:45:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:21,340 INFO L93 Difference]: Finished difference Result 195339 states and 215637 transitions. [2024-10-10 23:45:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:45:21,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 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 339 [2024-10-10 23:45:21,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:21,493 INFO L225 Difference]: With dead ends: 195339 [2024-10-10 23:45:21,493 INFO L226 Difference]: Without dead ends: 113464 [2024-10-10 23:45:21,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:45:21,535 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1626 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 8955 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 9653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 8955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:21,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 304 Invalid, 9653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 8955 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-10 23:45:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113464 states. [2024-10-10 23:45:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113464 to 97182. [2024-10-10 23:45:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97182 states, 97181 states have (on average 1.0952861155987281) internal successors, (106441), 97181 states have internal predecessors, (106441), 0 states have call successors, (0), 0 states 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 23:45:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97182 states to 97182 states and 106441 transitions. [2024-10-10 23:45:22,842 INFO L78 Accepts]: Start accepts. Automaton has 97182 states and 106441 transitions. Word has length 339 [2024-10-10 23:45:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:22,842 INFO L471 AbstractCegarLoop]: Abstraction has 97182 states and 106441 transitions. [2024-10-10 23:45:22,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states 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 23:45:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 97182 states and 106441 transitions. [2024-10-10 23:45:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-10-10 23:45:22,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:22,848 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 23:45:22,860 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 23:45:23,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 23:45:23,049 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:23,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:23,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1205068660, now seen corresponding path program 1 times [2024-10-10 23:45:23,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:23,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117682986] [2024-10-10 23:45:23,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:23,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-10 23:45:23,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:23,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117682986] [2024-10-10 23:45:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117682986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:23,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:23,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:23,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101131294] [2024-10-10 23:45:23,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:23,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:23,396 INFO L87 Difference]: Start difference. First operand 97182 states and 106441 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:45:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:25,327 INFO L93 Difference]: Finished difference Result 199050 states and 218122 transitions. [2024-10-10 23:45:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:25,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2024-10-10 23:45:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:25,456 INFO L225 Difference]: With dead ends: 199050 [2024-10-10 23:45:25,456 INFO L226 Difference]: Without dead ends: 102294 [2024-10-10 23:45:25,529 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 23:45:25,530 INFO L432 NwaCegarLoop]: 680 mSDtfsCounter, 405 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:25,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 726 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:45:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102294 states. [2024-10-10 23:45:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102294 to 89927. [2024-10-10 23:45:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89927 states, 89926 states have (on average 1.0939661499455107) internal successors, (98376), 89926 states have internal predecessors, (98376), 0 states have call successors, (0), 0 states 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 23:45:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89927 states to 89927 states and 98376 transitions. [2024-10-10 23:45:26,924 INFO L78 Accepts]: Start accepts. Automaton has 89927 states and 98376 transitions. Word has length 381 [2024-10-10 23:45:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:26,924 INFO L471 AbstractCegarLoop]: Abstraction has 89927 states and 98376 transitions. [2024-10-10 23:45:26,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:45:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 89927 states and 98376 transitions. [2024-10-10 23:45:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-10 23:45:26,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:26,930 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, 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, 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] [2024-10-10 23:45:26,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:45:26,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:26,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash -366180776, now seen corresponding path program 1 times [2024-10-10 23:45:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492081186] [2024-10-10 23:45:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-10-10 23:45:27,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:27,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492081186] [2024-10-10 23:45:27,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492081186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:27,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:27,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:45:27,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641844919] [2024-10-10 23:45:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:27,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:27,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:27,111 INFO L87 Difference]: Start difference. First operand 89927 states and 98376 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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 23:45:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:28,357 INFO L93 Difference]: Finished difference Result 177715 states and 194413 transitions. [2024-10-10 23:45:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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 23:45:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:28,449 INFO L225 Difference]: With dead ends: 177715 [2024-10-10 23:45:28,450 INFO L226 Difference]: Without dead ends: 88213 [2024-10-10 23:45:28,494 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 23:45:28,495 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 616 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:28,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 93 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:45:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88213 states. [2024-10-10 23:45:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88213 to 88204. [2024-10-10 23:45:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88204 states, 88203 states have (on average 1.0933301588381348) internal successors, (96435), 88203 states have internal predecessors, (96435), 0 states have call successors, (0), 0 states 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 23:45:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88204 states to 88204 states and 96435 transitions. [2024-10-10 23:45:29,720 INFO L78 Accepts]: Start accepts. Automaton has 88204 states and 96435 transitions. Word has length 432 [2024-10-10 23:45:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:29,720 INFO L471 AbstractCegarLoop]: Abstraction has 88204 states and 96435 transitions. [2024-10-10 23:45:29,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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 23:45:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 88204 states and 96435 transitions. [2024-10-10 23:45:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-10-10 23:45:29,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:29,731 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, 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, 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] [2024-10-10 23:45:29,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:45:29,731 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:29,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1053438296, now seen corresponding path program 1 times [2024-10-10 23:45:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732719867] [2024-10-10 23:45:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 370 proven. 52 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:45:30,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:30,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732719867] [2024-10-10 23:45:30,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732719867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:45:30,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073371911] [2024-10-10 23:45:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:30,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:30,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:45:30,884 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 23:45:30,887 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 23:45:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:31,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:45:31,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:45:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 433 proven. 82 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-10 23:45:31,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:45:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 433 proven. 82 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-10 23:45:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073371911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:45:32,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:45:32,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-10 23:45:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901157306] [2024-10-10 23:45:32,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:45:32,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 23:45:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 23:45:32,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:45:32,339 INFO L87 Difference]: Start difference. First operand 88204 states and 96435 transitions. Second operand has 9 states, 9 states have (on average 82.88888888888889) internal successors, (746), 9 states have internal predecessors, (746), 0 states have call successors, (0), 0 states 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 23:45:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:44,029 INFO L93 Difference]: Finished difference Result 220725 states and 240666 transitions. [2024-10-10 23:45:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-10 23:45:44,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.88888888888889) internal successors, (746), 9 states have internal predecessors, (746), 0 states have call successors, (0), 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 433 [2024-10-10 23:45:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:44,192 INFO L225 Difference]: With dead ends: 220725 [2024-10-10 23:45:44,192 INFO L226 Difference]: Without dead ends: 131245 [2024-10-10 23:45:44,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2024-10-10 23:45:44,223 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 9596 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 14193 mSolverCounterSat, 2418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9596 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 16611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2418 IncrementalHoareTripleChecker+Valid, 14193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:44,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9596 Valid, 402 Invalid, 16611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2418 Valid, 14193 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-10-10 23:45:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131245 states. [2024-10-10 23:45:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131245 to 106493. [2024-10-10 23:45:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106493 states, 106492 states have (on average 1.08518010742591) internal successors, (115563), 106492 states have internal predecessors, (115563), 0 states have call successors, (0), 0 states 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 23:45:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106493 states to 106493 states and 115563 transitions. [2024-10-10 23:45:45,803 INFO L78 Accepts]: Start accepts. Automaton has 106493 states and 115563 transitions. Word has length 433 [2024-10-10 23:45:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:45,803 INFO L471 AbstractCegarLoop]: Abstraction has 106493 states and 115563 transitions. [2024-10-10 23:45:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.88888888888889) internal successors, (746), 9 states have internal predecessors, (746), 0 states have call successors, (0), 0 states 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 23:45:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 106493 states and 115563 transitions. [2024-10-10 23:45:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2024-10-10 23:45:45,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:45,815 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:45:45,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:45:46,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:46,020 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:46,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:46,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2108734583, now seen corresponding path program 1 times [2024-10-10 23:45:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:46,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105649431] [2024-10-10 23:45:46,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:45:46,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:46,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105649431] [2024-10-10 23:45:46,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105649431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:46,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:46,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:46,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429160979] [2024-10-10 23:45:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:46,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:46,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:46,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:46,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:46,421 INFO L87 Difference]: Start difference. First operand 106493 states and 115563 transitions. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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 23:45:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:48,192 INFO L93 Difference]: Finished difference Result 208728 states and 226572 transitions. [2024-10-10 23:45:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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 522 [2024-10-10 23:45:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:48,320 INFO L225 Difference]: With dead ends: 208728 [2024-10-10 23:45:48,320 INFO L226 Difference]: Without dead ends: 103086 [2024-10-10 23:45:48,394 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 23:45:48,394 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 404 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:48,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 660 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:45:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103086 states. [2024-10-10 23:45:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103086 to 102230. [2024-10-10 23:45:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102230 states, 102229 states have (on average 1.0784611020356258) internal successors, (110250), 102229 states have internal predecessors, (110250), 0 states have call successors, (0), 0 states 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 23:45:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102230 states to 102230 states and 110250 transitions. [2024-10-10 23:45:49,982 INFO L78 Accepts]: Start accepts. Automaton has 102230 states and 110250 transitions. Word has length 522 [2024-10-10 23:45:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:49,982 INFO L471 AbstractCegarLoop]: Abstraction has 102230 states and 110250 transitions. [2024-10-10 23:45:49,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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 23:45:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 102230 states and 110250 transitions. [2024-10-10 23:45:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2024-10-10 23:45:49,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:49,992 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:45:49,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:45:49,992 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:49,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:49,993 INFO L85 PathProgramCache]: Analyzing trace with hash 486092691, now seen corresponding path program 1 times [2024-10-10 23:45:49,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:49,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670151612] [2024-10-10 23:45:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:49,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:45:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:50,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670151612] [2024-10-10 23:45:50,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670151612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:50,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:50,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231341853] [2024-10-10 23:45:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:50,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:50,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:50,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:50,262 INFO L87 Difference]: Start difference. First operand 102230 states and 110250 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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 23:45:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:52,167 INFO L93 Difference]: Finished difference Result 208734 states and 225181 transitions. [2024-10-10 23:45:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:52,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 549 [2024-10-10 23:45:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:52,293 INFO L225 Difference]: With dead ends: 208734 [2024-10-10 23:45:52,294 INFO L226 Difference]: Without dead ends: 106930 [2024-10-10 23:45:52,361 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 23:45:52,362 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 398 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:52,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 220 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:45:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106930 states. [2024-10-10 23:45:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106930 to 97124. [2024-10-10 23:45:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97124 states, 97123 states have (on average 1.0780350689332083) internal successors, (104702), 97123 states have internal predecessors, (104702), 0 states have call successors, (0), 0 states 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 23:45:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97124 states to 97124 states and 104702 transitions. [2024-10-10 23:45:53,636 INFO L78 Accepts]: Start accepts. Automaton has 97124 states and 104702 transitions. Word has length 549 [2024-10-10 23:45:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:53,636 INFO L471 AbstractCegarLoop]: Abstraction has 97124 states and 104702 transitions. [2024-10-10 23:45:53,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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 23:45:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 97124 states and 104702 transitions. [2024-10-10 23:45:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-10-10 23:45:53,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:53,647 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:45:53,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:45:53,648 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:53,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash 649383766, now seen corresponding path program 1 times [2024-10-10 23:45:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:53,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869465963] [2024-10-10 23:45:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 827 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:45:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:54,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869465963] [2024-10-10 23:45:54,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869465963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:54,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:45:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272690274] [2024-10-10 23:45:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:54,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:45:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:54,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:45:54,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:45:54,345 INFO L87 Difference]: Start difference. First operand 97124 states and 104702 transitions. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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 23:45:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:57,065 INFO L93 Difference]: Finished difference Result 218098 states and 235251 transitions. [2024-10-10 23:45:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:45:57,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 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 593 [2024-10-10 23:45:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:57,212 INFO L225 Difference]: With dead ends: 218098 [2024-10-10 23:45:57,213 INFO L226 Difference]: Without dead ends: 121825 [2024-10-10 23:45:57,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 23:45:57,278 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 731 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:57,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 178 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:45:57,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121825 states.