./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label55.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:12:46,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:12:46,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:12:46,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:12:46,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:12:46,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:12:46,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:12:46,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:12:46,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:12:46,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:12:46,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:12:46,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:12:46,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:12:46,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:12:46,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:12:46,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:12:46,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:12:46,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:12:46,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:12:46,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:12:46,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:12:46,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:12:46,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:12:46,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:12:46,264 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:12:46,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:12:46,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:12:46,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:12:46,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:12:46,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:12:46,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:12:46,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:12:46,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:12:46,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:12:46,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:12:46,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:12:46,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:12:46,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:12:46,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:12:46,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:12:46,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:12:46,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:12:46,276 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 [2024-11-08 11:12:46,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:12:46,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:12:46,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:12:46,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:12:46,565 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:12:46,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2024-11-08 11:12:48,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:12:48,355 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:12:48,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2024-11-08 11:12:48,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2791d3cfa/682d4c59645f40e8b29fec34ed28048a/FLAGe6b67fb03 [2024-11-08 11:12:48,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2791d3cfa/682d4c59645f40e8b29fec34ed28048a [2024-11-08 11:12:48,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:12:48,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:12:48,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:12:48,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:12:48,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:12:48,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:48" (1/1) ... [2024-11-08 11:12:48,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@999d43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:48, skipping insertion in model container [2024-11-08 11:12:48,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:48" (1/1) ... [2024-11-08 11:12:48,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:12:48,950 WARN L250 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/Problem11_label55.c[6546,6559] [2024-11-08 11:12:49,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:12:49,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:12:49,215 WARN L250 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/Problem11_label55.c[6546,6559] [2024-11-08 11:12:49,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:12:49,397 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:12:49,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49 WrapperNode [2024-11-08 11:12:49,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:12:49,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:12:49,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:12:49,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:12:49,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,538 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-08 11:12:49,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:12:49,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:12:49,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:12:49,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:12:49,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,636 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-11-08 11:12:49,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:12:49,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:12:49,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:12:49,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:12:49,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (1/1) ... [2024-11-08 11:12:49,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:12:49,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:12:49,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:12:49,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:12:49,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:12:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:12:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:12:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:12:49,872 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:12:49,874 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:12:51,311 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 11:12:51,311 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:12:51,337 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:12:51,338 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:12:51,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:51 BoogieIcfgContainer [2024-11-08 11:12:51,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:12:51,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:12:51,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:12:51,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:12:51,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:12:48" (1/3) ... [2024-11-08 11:12:51,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9f2415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:51, skipping insertion in model container [2024-11-08 11:12:51,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:49" (2/3) ... [2024-11-08 11:12:51,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9f2415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:51, skipping insertion in model container [2024-11-08 11:12:51,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:51" (3/3) ... [2024-11-08 11:12:51,348 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label55.c [2024-11-08 11:12:51,364 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:12:51,364 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:12:51,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:12:51,445 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;@7bfef503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:12:51,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:12:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 11:12:51,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:51,461 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] [2024-11-08 11:12:51,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:51,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2024-11-08 11:12:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:51,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039601176] [2024-11-08 11:12:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:51,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:51,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039601176] [2024-11-08 11:12:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039601176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:51,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:51,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780595986] [2024-11-08 11:12:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:51,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:51,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:51,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:51,932 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:52,955 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-08 11:12:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:52,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-11-08 11:12:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:52,971 INFO L225 Difference]: With dead ends: 776 [2024-11-08 11:12:52,972 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 11:12:52,976 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-11-08 11:12:52,979 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 182 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:52,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:12:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 11:12:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-08 11:12:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-08 11:12:53,032 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 45 [2024-11-08 11:12:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:53,032 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-08 11:12:53,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-08 11:12:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 11:12:53,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:53,036 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, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:12:53,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:12:53,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:53,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash -954308976, now seen corresponding path program 1 times [2024-11-08 11:12:53,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:53,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595675025] [2024-11-08 11:12:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595675025] [2024-11-08 11:12:53,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595675025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:53,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:53,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376774406] [2024-11-08 11:12:53,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:53,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:53,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:53,286 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:54,092 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-08 11:12:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:54,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-08 11:12:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:54,099 INFO L225 Difference]: With dead ends: 1209 [2024-11-08 11:12:54,100 INFO L226 Difference]: Without dead ends: 800 [2024-11-08 11:12:54,102 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-11-08 11:12:54,105 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:54,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:12:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-08 11:12:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-08 11:12:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2024-11-08 11:12:54,158 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 113 [2024-11-08 11:12:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:54,161 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2024-11-08 11:12:54,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2024-11-08 11:12:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 11:12:54,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:54,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:12:54,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:12:54,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:54,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash 975979568, now seen corresponding path program 1 times [2024-11-08 11:12:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:54,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513274098] [2024-11-08 11:12:54,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:54,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:54,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513274098] [2024-11-08 11:12:54,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513274098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:54,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:54,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581426929] [2024-11-08 11:12:54,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:54,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:54,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:54,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:54,593 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:55,279 INFO L93 Difference]: Finished difference Result 1942 states and 2631 transitions. [2024-11-08 11:12:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:55,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-08 11:12:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:55,285 INFO L225 Difference]: With dead ends: 1942 [2024-11-08 11:12:55,286 INFO L226 Difference]: Without dead ends: 1157 [2024-11-08 11:12:55,288 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-11-08 11:12:55,290 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:55,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:12:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-08 11:12:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-08 11:12:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2024-11-08 11:12:55,318 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 114 [2024-11-08 11:12:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:55,319 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2024-11-08 11:12:55,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2024-11-08 11:12:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 11:12:55,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:55,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:12:55,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:12:55,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:55,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash -103496756, now seen corresponding path program 1 times [2024-11-08 11:12:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:55,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86114130] [2024-11-08 11:12:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-08 11:12:55,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86114130] [2024-11-08 11:12:55,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86114130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:55,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:55,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031765534] [2024-11-08 11:12:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:55,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:55,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:55,597 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:56,403 INFO L93 Difference]: Finished difference Result 2502 states and 3339 transitions. [2024-11-08 11:12:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:56,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 157 [2024-11-08 11:12:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:56,409 INFO L225 Difference]: With dead ends: 2502 [2024-11-08 11:12:56,409 INFO L226 Difference]: Without dead ends: 1532 [2024-11-08 11:12:56,411 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-11-08 11:12:56,411 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:56,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:12:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-08 11:12:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-08 11:12:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2619203135205748) internal successors, (1932), 1531 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1932 transitions. [2024-11-08 11:12:56,439 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1932 transitions. Word has length 157 [2024-11-08 11:12:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1932 transitions. [2024-11-08 11:12:56,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1932 transitions. [2024-11-08 11:12:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 11:12:56,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:56,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:12:56,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:12:56,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:56,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1015853899, now seen corresponding path program 1 times [2024-11-08 11:12:56,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:56,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52748838] [2024-11-08 11:12:56,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52748838] [2024-11-08 11:12:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52748838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268968349] [2024-11-08 11:12:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:56,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:56,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:56,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:56,680 INFO L87 Difference]: Start difference. First operand 1532 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:57,423 INFO L93 Difference]: Finished difference Result 3644 states and 4738 transitions. [2024-11-08 11:12:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:57,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-11-08 11:12:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:57,432 INFO L225 Difference]: With dead ends: 3644 [2024-11-08 11:12:57,432 INFO L226 Difference]: Without dead ends: 2298 [2024-11-08 11:12:57,434 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-11-08 11:12:57,437 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 190 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:57,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:12:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-08 11:12:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2295. [2024-11-08 11:12:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2654751525719268) internal successors, (2903), 2294 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2903 transitions. [2024-11-08 11:12:57,480 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2903 transitions. Word has length 172 [2024-11-08 11:12:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:57,480 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2903 transitions. [2024-11-08 11:12:57,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2903 transitions. [2024-11-08 11:12:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 11:12:57,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:57,484 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, 2, 2, 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] [2024-11-08 11:12:57,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:12:57,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:57,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1543850387, now seen corresponding path program 1 times [2024-11-08 11:12:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:57,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871882626] [2024-11-08 11:12:57,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:57,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:57,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:57,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871882626] [2024-11-08 11:12:57,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871882626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:57,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:57,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561372574] [2024-11-08 11:12:57,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:57,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:57,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:57,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:57,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:57,765 INFO L87 Difference]: Start difference. First operand 2295 states and 2903 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:58,539 INFO L93 Difference]: Finished difference Result 5528 states and 7095 transitions. [2024-11-08 11:12:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-08 11:12:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:58,551 INFO L225 Difference]: With dead ends: 5528 [2024-11-08 11:12:58,552 INFO L226 Difference]: Without dead ends: 3419 [2024-11-08 11:12:58,555 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-11-08 11:12:58,556 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:58,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 340 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:12:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2024-11-08 11:12:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3218. [2024-11-08 11:12:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3217 states have (on average 1.2377991917935964) internal successors, (3982), 3217 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 3982 transitions. [2024-11-08 11:12:58,619 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 3982 transitions. Word has length 225 [2024-11-08 11:12:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:58,621 INFO L471 AbstractCegarLoop]: Abstraction has 3218 states and 3982 transitions. [2024-11-08 11:12:58,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 3982 transitions. [2024-11-08 11:12:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-08 11:12:58,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:58,625 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, 2, 2, 2, 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] [2024-11-08 11:12:58,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:12:58,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:58,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1109508493, now seen corresponding path program 1 times [2024-11-08 11:12:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750835370] [2024-11-08 11:12:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 11:12:58,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750835370] [2024-11-08 11:12:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750835370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:58,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:58,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:58,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597152095] [2024-11-08 11:12:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:58,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:58,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:58,898 INFO L87 Difference]: Start difference. First operand 3218 states and 3982 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:59,625 INFO L93 Difference]: Finished difference Result 7371 states and 9143 transitions. [2024-11-08 11:12:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2024-11-08 11:12:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:59,640 INFO L225 Difference]: With dead ends: 7371 [2024-11-08 11:12:59,640 INFO L226 Difference]: Without dead ends: 4155 [2024-11-08 11:12:59,645 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-11-08 11:12:59,646 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:59,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 345 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:12:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2024-11-08 11:12:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 4138. [2024-11-08 11:12:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4138 states, 4137 states have (on average 1.2211747643219724) internal successors, (5052), 4137 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 5052 transitions. [2024-11-08 11:12:59,716 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 5052 transitions. Word has length 226 [2024-11-08 11:12:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:59,716 INFO L471 AbstractCegarLoop]: Abstraction has 4138 states and 5052 transitions. [2024-11-08 11:12:59,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 5052 transitions. [2024-11-08 11:12:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 11:12:59,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:59,720 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, 2, 2, 2, 2, 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] [2024-11-08 11:12:59,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:12:59,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:59,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash 616043864, now seen corresponding path program 1 times [2024-11-08 11:12:59,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:59,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012630256] [2024-11-08 11:12:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:59,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 11:12:59,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:59,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012630256] [2024-11-08 11:12:59,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012630256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:59,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:59,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677341871] [2024-11-08 11:12:59,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:59,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:59,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:59,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:59,952 INFO L87 Difference]: Start difference. First operand 4138 states and 5052 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:00,745 INFO L93 Difference]: Finished difference Result 9207 states and 11353 transitions. [2024-11-08 11:13:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:00,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 227 [2024-11-08 11:13:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:00,766 INFO L225 Difference]: With dead ends: 9207 [2024-11-08 11:13:00,766 INFO L226 Difference]: Without dead ends: 5071 [2024-11-08 11:13:00,772 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-11-08 11:13:00,774 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 152 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:00,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 379 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:13:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5071 states. [2024-11-08 11:13:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5071 to 4874. [2024-11-08 11:13:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4873 states have (on average 1.2087010055407346) internal successors, (5890), 4873 states have internal predecessors, (5890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 5890 transitions. [2024-11-08 11:13:00,858 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 5890 transitions. Word has length 227 [2024-11-08 11:13:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:00,859 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 5890 transitions. [2024-11-08 11:13:00,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 5890 transitions. [2024-11-08 11:13:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 11:13:00,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:00,863 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:13:00,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:13:00,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:00,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash 213296906, now seen corresponding path program 1 times [2024-11-08 11:13:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:00,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241747944] [2024-11-08 11:13:00,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:01,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:01,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241747944] [2024-11-08 11:13:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241747944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:01,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:01,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:13:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263690997] [2024-11-08 11:13:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:01,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:01,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:01,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:01,260 INFO L87 Difference]: Start difference. First operand 4874 states and 5890 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:02,426 INFO L93 Difference]: Finished difference Result 15870 states and 19335 transitions. [2024-11-08 11:13:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:02,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2024-11-08 11:13:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:02,467 INFO L225 Difference]: With dead ends: 15870 [2024-11-08 11:13:02,468 INFO L226 Difference]: Without dead ends: 10998 [2024-11-08 11:13:02,475 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-11-08 11:13:02,478 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 290 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:02,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 193 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:13:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10998 states. [2024-11-08 11:13:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10998 to 8953. [2024-11-08 11:13:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8953 states, 8952 states have (on average 1.1907953529937445) internal successors, (10660), 8952 states have internal predecessors, (10660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8953 states to 8953 states and 10660 transitions. [2024-11-08 11:13:02,642 INFO L78 Accepts]: Start accepts. Automaton has 8953 states and 10660 transitions. Word has length 247 [2024-11-08 11:13:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:02,643 INFO L471 AbstractCegarLoop]: Abstraction has 8953 states and 10660 transitions. [2024-11-08 11:13:02,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8953 states and 10660 transitions. [2024-11-08 11:13:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-08 11:13:02,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:02,649 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-08 11:13:02,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:13:02,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:02,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 389049443, now seen corresponding path program 1 times [2024-11-08 11:13:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:02,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896257291] [2024-11-08 11:13:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:03,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896257291] [2024-11-08 11:13:03,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896257291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:03,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:03,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:13:03,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400658577] [2024-11-08 11:13:03,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:03,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:03,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:03,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:03,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:03,081 INFO L87 Difference]: Start difference. First operand 8953 states and 10660 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:04,429 INFO L93 Difference]: Finished difference Result 22713 states and 27383 transitions. [2024-11-08 11:13:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:04,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2024-11-08 11:13:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:04,465 INFO L225 Difference]: With dead ends: 22713 [2024-11-08 11:13:04,465 INFO L226 Difference]: Without dead ends: 13762 [2024-11-08 11:13:04,477 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-11-08 11:13:04,478 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 300 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:04,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 120 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:13:04,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2024-11-08 11:13:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 13378. [2024-11-08 11:13:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13378 states, 13377 states have (on average 1.1920460491889064) internal successors, (15946), 13377 states have internal predecessors, (15946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13378 states to 13378 states and 15946 transitions. [2024-11-08 11:13:04,766 INFO L78 Accepts]: Start accepts. Automaton has 13378 states and 15946 transitions. Word has length 257 [2024-11-08 11:13:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:04,767 INFO L471 AbstractCegarLoop]: Abstraction has 13378 states and 15946 transitions. [2024-11-08 11:13:04,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 13378 states and 15946 transitions. [2024-11-08 11:13:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-08 11:13:04,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:04,774 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:13:04,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:13:04,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:04,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1785532527, now seen corresponding path program 1 times [2024-11-08 11:13:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438931394] [2024-11-08 11:13:04,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-08 11:13:05,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:05,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438931394] [2024-11-08 11:13:05,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438931394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:13:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616115502] [2024-11-08 11:13:05,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:05,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:13:05,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:13:05,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:13:05,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:13:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:05,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:13:05,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:13:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-08 11:13:05,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:13:05,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616115502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:05,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:13:05,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:13:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976633588] [2024-11-08 11:13:05,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:05,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:05,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:05,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:05,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:13:05,411 INFO L87 Difference]: Start difference. First operand 13378 states and 15946 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:06,152 INFO L93 Difference]: Finished difference Result 32089 states and 38433 transitions. [2024-11-08 11:13:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 259 [2024-11-08 11:13:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:06,184 INFO L225 Difference]: With dead ends: 32089 [2024-11-08 11:13:06,184 INFO L226 Difference]: Without dead ends: 18713 [2024-11-08 11:13:06,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:13:06,201 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 155 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:06,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 375 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2024-11-08 11:13:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 17789. [2024-11-08 11:13:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17789 states, 17788 states have (on average 1.1721385203507984) internal successors, (20850), 17788 states have internal predecessors, (20850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17789 states to 17789 states and 20850 transitions. [2024-11-08 11:13:06,570 INFO L78 Accepts]: Start accepts. Automaton has 17789 states and 20850 transitions. Word has length 259 [2024-11-08 11:13:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:06,570 INFO L471 AbstractCegarLoop]: Abstraction has 17789 states and 20850 transitions. [2024-11-08 11:13:06,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17789 states and 20850 transitions. [2024-11-08 11:13:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-08 11:13:06,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:06,576 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:13:06,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:13:06,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 11:13:06,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:06,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash -909161094, now seen corresponding path program 1 times [2024-11-08 11:13:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:06,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915465847] [2024-11-08 11:13:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:06,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 11:13:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915465847] [2024-11-08 11:13:07,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915465847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:07,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555767680] [2024-11-08 11:13:07,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:07,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:07,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:07,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:07,163 INFO L87 Difference]: Start difference. First operand 17789 states and 20850 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:07,949 INFO L93 Difference]: Finished difference Result 35586 states and 41718 transitions. [2024-11-08 11:13:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:07,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 264 [2024-11-08 11:13:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:07,985 INFO L225 Difference]: With dead ends: 35586 [2024-11-08 11:13:07,985 INFO L226 Difference]: Without dead ends: 17799 [2024-11-08 11:13:08,007 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-11-08 11:13:08,008 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 155 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:08,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 377 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:13:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17799 states. [2024-11-08 11:13:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17799 to 17788. [2024-11-08 11:13:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17788 states, 17787 states have (on average 1.1440377804014168) internal successors, (20349), 17787 states have internal predecessors, (20349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 20349 transitions. [2024-11-08 11:13:08,262 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 20349 transitions. Word has length 264 [2024-11-08 11:13:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:08,263 INFO L471 AbstractCegarLoop]: Abstraction has 17788 states and 20349 transitions. [2024-11-08 11:13:08,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 20349 transitions. [2024-11-08 11:13:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-08 11:13:08,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:08,271 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:13:08,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:13:08,271 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:08,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1936772335, now seen corresponding path program 1 times [2024-11-08 11:13:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:08,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7424105] [2024-11-08 11:13:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 141 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:08,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:08,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7424105] [2024-11-08 11:13:08,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7424105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:13:08,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905786675] [2024-11-08 11:13:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:08,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:13:08,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:13:08,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:13:08,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:13:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:09,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:13:09,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:13:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:09,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:13:09,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905786675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:09,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:13:09,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:13:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573887801] [2024-11-08 11:13:09,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:09,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:09,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:09,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:09,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:13:09,558 INFO L87 Difference]: Start difference. First operand 17788 states and 20349 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:10,418 INFO L93 Difference]: Finished difference Result 35578 states and 40702 transitions. [2024-11-08 11:13:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:10,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2024-11-08 11:13:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:10,443 INFO L225 Difference]: With dead ends: 35578 [2024-11-08 11:13:10,443 INFO L226 Difference]: Without dead ends: 17792 [2024-11-08 11:13:10,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:13:10,458 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 172 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:10,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 177 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:13:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17792 states. [2024-11-08 11:13:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17792 to 17788. [2024-11-08 11:13:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17788 states, 17787 states have (on average 1.1430258053634677) internal successors, (20331), 17787 states have internal predecessors, (20331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 20331 transitions. [2024-11-08 11:13:10,799 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 20331 transitions. Word has length 278 [2024-11-08 11:13:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:10,800 INFO L471 AbstractCegarLoop]: Abstraction has 17788 states and 20331 transitions. [2024-11-08 11:13:10,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 20331 transitions. [2024-11-08 11:13:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-08 11:13:10,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:10,810 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:13:10,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:13:11,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 11:13:11,011 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:11,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:11,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1415119139, now seen corresponding path program 1 times [2024-11-08 11:13:11,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:11,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248398272] [2024-11-08 11:13:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-08 11:13:11,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248398272] [2024-11-08 11:13:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248398272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:11,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:13:11,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559215531] [2024-11-08 11:13:11,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:11,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:11,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:11,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:11,247 INFO L87 Difference]: Start difference. First operand 17788 states and 20331 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:12,019 INFO L93 Difference]: Finished difference Result 33137 states and 37923 transitions. [2024-11-08 11:13:12,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 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 304 [2024-11-08 11:13:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:12,037 INFO L225 Difference]: With dead ends: 33137 [2024-11-08 11:13:12,037 INFO L226 Difference]: Without dead ends: 15351 [2024-11-08 11:13:12,049 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-11-08 11:13:12,050 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 124 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:12,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 149 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15351 states. [2024-11-08 11:13:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15351 to 10741. [2024-11-08 11:13:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10741 states, 10740 states have (on average 1.116294227188082) internal successors, (11989), 10740 states have internal predecessors, (11989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 11989 transitions. [2024-11-08 11:13:12,183 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 11989 transitions. Word has length 304 [2024-11-08 11:13:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:12,184 INFO L471 AbstractCegarLoop]: Abstraction has 10741 states and 11989 transitions. [2024-11-08 11:13:12,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 11989 transitions. [2024-11-08 11:13:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-08 11:13:12,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:12,194 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:13:12,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:13:12,195 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:12,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash 63979177, now seen corresponding path program 1 times [2024-11-08 11:13:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:12,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970824511] [2024-11-08 11:13:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-08 11:13:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970824511] [2024-11-08 11:13:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970824511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:12,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:12,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262565719] [2024-11-08 11:13:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:12,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:12,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:12,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:12,414 INFO L87 Difference]: Start difference. First operand 10741 states and 11989 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:13,000 INFO L93 Difference]: Finished difference Result 23503 states and 26240 transitions. [2024-11-08 11:13:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 312 [2024-11-08 11:13:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:13,016 INFO L225 Difference]: With dead ends: 23503 [2024-11-08 11:13:13,016 INFO L226 Difference]: Without dead ends: 12764 [2024-11-08 11:13:13,024 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-11-08 11:13:13,025 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 176 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:13,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 144 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12764 states. [2024-11-08 11:13:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12764 to 10924. [2024-11-08 11:13:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10924 states, 10923 states have (on average 1.1170008239494644) internal successors, (12201), 10923 states have internal predecessors, (12201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10924 states to 10924 states and 12201 transitions. [2024-11-08 11:13:13,152 INFO L78 Accepts]: Start accepts. Automaton has 10924 states and 12201 transitions. Word has length 312 [2024-11-08 11:13:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:13,152 INFO L471 AbstractCegarLoop]: Abstraction has 10924 states and 12201 transitions. [2024-11-08 11:13:13,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 10924 states and 12201 transitions. [2024-11-08 11:13:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-08 11:13:13,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:13,160 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-11-08 11:13:13,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:13:13,160 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:13,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1564114315, now seen corresponding path program 1 times [2024-11-08 11:13:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:13,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230834676] [2024-11-08 11:13:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 11:13:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:13,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230834676] [2024-11-08 11:13:13,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230834676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:13,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:13,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:13:13,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040794713] [2024-11-08 11:13:13,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:13,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:13,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:13,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:13,734 INFO L87 Difference]: Start difference. First operand 10924 states and 12201 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:14,760 INFO L93 Difference]: Finished difference Result 27404 states and 30590 transitions. [2024-11-08 11:13:14,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:14,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 316 [2024-11-08 11:13:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:14,780 INFO L225 Difference]: With dead ends: 27404 [2024-11-08 11:13:14,780 INFO L226 Difference]: Without dead ends: 15741 [2024-11-08 11:13:14,790 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-11-08 11:13:14,791 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 295 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:14,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 399 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:13:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15741 states. [2024-11-08 11:13:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15741 to 12413. [2024-11-08 11:13:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12413 states, 12412 states have (on average 1.117386400257815) internal successors, (13869), 12412 states have internal predecessors, (13869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 13869 transitions. [2024-11-08 11:13:14,964 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 13869 transitions. Word has length 316 [2024-11-08 11:13:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:14,964 INFO L471 AbstractCegarLoop]: Abstraction has 12413 states and 13869 transitions. [2024-11-08 11:13:14,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 13869 transitions. [2024-11-08 11:13:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-08 11:13:14,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:14,973 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-11-08 11:13:14,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:13:14,974 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:14,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1085023565, now seen corresponding path program 1 times [2024-11-08 11:13:14,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:14,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576775295] [2024-11-08 11:13:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:14,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 174 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 11:13:16,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576775295] [2024-11-08 11:13:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576775295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:13:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497503008] [2024-11-08 11:13:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:16,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:13:16,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:13:16,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:13:16,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:13:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:16,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:13:16,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:13:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 11:13:16,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:13:16,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497503008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:16,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:13:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:13:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210929132] [2024-11-08 11:13:16,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:16,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:16,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:16,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:16,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:13:16,778 INFO L87 Difference]: Start difference. First operand 12413 states and 13869 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:17,576 INFO L93 Difference]: Finished difference Result 25010 states and 27928 transitions. [2024-11-08 11:13:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:17,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 332 [2024-11-08 11:13:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:17,588 INFO L225 Difference]: With dead ends: 25010 [2024-11-08 11:13:17,589 INFO L226 Difference]: Without dead ends: 12599 [2024-11-08 11:13:17,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:13:17,600 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 293 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:17,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 150 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:13:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12599 states. [2024-11-08 11:13:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12599 to 12413. [2024-11-08 11:13:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12413 states, 12412 states have (on average 1.116419593941347) internal successors, (13857), 12412 states have internal predecessors, (13857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 13857 transitions. [2024-11-08 11:13:17,786 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 13857 transitions. Word has length 332 [2024-11-08 11:13:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:17,786 INFO L471 AbstractCegarLoop]: Abstraction has 12413 states and 13857 transitions. [2024-11-08 11:13:17,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 13857 transitions. [2024-11-08 11:13:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-08 11:13:17,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:17,796 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:13:17,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:13:17,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:13:17,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:17,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash 474538808, now seen corresponding path program 1 times [2024-11-08 11:13:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:17,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565785254] [2024-11-08 11:13:17,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 11:13:18,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:18,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565785254] [2024-11-08 11:13:18,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565785254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:18,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:18,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:13:18,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693494982] [2024-11-08 11:13:18,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:18,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:18,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:18,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:18,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:18,546 INFO L87 Difference]: Start difference. First operand 12413 states and 13857 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:19,589 INFO L93 Difference]: Finished difference Result 29071 states and 32393 transitions. [2024-11-08 11:13:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:19,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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 354 [2024-11-08 11:13:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:19,668 INFO L225 Difference]: With dead ends: 29071 [2024-11-08 11:13:19,669 INFO L226 Difference]: Without dead ends: 16103 [2024-11-08 11:13:19,675 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-11-08 11:13:19,675 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 289 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:19,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 368 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:13:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16103 states. [2024-11-08 11:13:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16103 to 10550. [2024-11-08 11:13:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10550 states, 10549 states have (on average 1.1117641482604985) internal successors, (11728), 10549 states have internal predecessors, (11728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10550 states to 10550 states and 11728 transitions. [2024-11-08 11:13:19,784 INFO L78 Accepts]: Start accepts. Automaton has 10550 states and 11728 transitions. Word has length 354 [2024-11-08 11:13:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:19,785 INFO L471 AbstractCegarLoop]: Abstraction has 10550 states and 11728 transitions. [2024-11-08 11:13:19,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 10550 states and 11728 transitions. [2024-11-08 11:13:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-11-08 11:13:19,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:19,792 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-11-08 11:13:19,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 11:13:19,793 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:19,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:19,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1672122884, now seen corresponding path program 1 times [2024-11-08 11:13:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:19,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186354804] [2024-11-08 11:13:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:19,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-08 11:13:20,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:20,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186354804] [2024-11-08 11:13:20,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186354804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:20,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:20,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:13:20,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123766393] [2024-11-08 11:13:20,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:20,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:20,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:20,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:20,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:20,157 INFO L87 Difference]: Start difference. First operand 10550 states and 11728 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:20,871 INFO L93 Difference]: Finished difference Result 23312 states and 25815 transitions. [2024-11-08 11:13:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:20,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 367 [2024-11-08 11:13:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:20,883 INFO L225 Difference]: With dead ends: 23312 [2024-11-08 11:13:20,883 INFO L226 Difference]: Without dead ends: 12764 [2024-11-08 11:13:20,890 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-11-08 11:13:20,891 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 312 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:20,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 57 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:13:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12764 states. [2024-11-08 11:13:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12764 to 10177. [2024-11-08 11:13:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10177 states, 10176 states have (on average 1.1077044025157232) internal successors, (11272), 10176 states have internal predecessors, (11272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10177 states to 10177 states and 11272 transitions. [2024-11-08 11:13:20,981 INFO L78 Accepts]: Start accepts. Automaton has 10177 states and 11272 transitions. Word has length 367 [2024-11-08 11:13:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:20,981 INFO L471 AbstractCegarLoop]: Abstraction has 10177 states and 11272 transitions. [2024-11-08 11:13:20,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 10177 states and 11272 transitions. [2024-11-08 11:13:20,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-08 11:13:20,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:20,987 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:20,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:13:20,988 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:20,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash 555394427, now seen corresponding path program 1 times [2024-11-08 11:13:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:20,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042841935] [2024-11-08 11:13:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:20,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-08 11:13:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042841935] [2024-11-08 11:13:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042841935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:21,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:21,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844924163] [2024-11-08 11:13:21,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:21,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:21,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:21,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:21,216 INFO L87 Difference]: Start difference. First operand 10177 states and 11272 transitions. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:22,128 INFO L93 Difference]: Finished difference Result 27179 states and 30081 transitions. [2024-11-08 11:13:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:22,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 402 [2024-11-08 11:13:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:22,150 INFO L225 Difference]: With dead ends: 27179 [2024-11-08 11:13:22,150 INFO L226 Difference]: Without dead ends: 17004 [2024-11-08 11:13:22,158 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-11-08 11:13:22,159 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 201 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:22,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 71 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:13:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17004 states. [2024-11-08 11:13:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17004 to 15891. [2024-11-08 11:13:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15891 states, 15890 states have (on average 1.1056639395846444) internal successors, (17569), 15890 states have internal predecessors, (17569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15891 states to 15891 states and 17569 transitions. [2024-11-08 11:13:22,307 INFO L78 Accepts]: Start accepts. Automaton has 15891 states and 17569 transitions. Word has length 402 [2024-11-08 11:13:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:22,308 INFO L471 AbstractCegarLoop]: Abstraction has 15891 states and 17569 transitions. [2024-11-08 11:13:22,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15891 states and 17569 transitions. [2024-11-08 11:13:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-11-08 11:13:22,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:22,321 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:22,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 11:13:22,321 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:22,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1873288126, now seen corresponding path program 1 times [2024-11-08 11:13:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:22,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379956777] [2024-11-08 11:13:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-08 11:13:22,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:22,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379956777] [2024-11-08 11:13:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379956777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:22,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169235961] [2024-11-08 11:13:22,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:22,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:22,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:22,704 INFO L87 Difference]: Start difference. First operand 15891 states and 17569 transitions. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:23,583 INFO L93 Difference]: Finished difference Result 30497 states and 33716 transitions. [2024-11-08 11:13:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:23,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 547 [2024-11-08 11:13:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:23,599 INFO L225 Difference]: With dead ends: 30497 [2024-11-08 11:13:23,599 INFO L226 Difference]: Without dead ends: 17004 [2024-11-08 11:13:23,606 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-11-08 11:13:23,607 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 175 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:23,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 71 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:13:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17004 states. [2024-11-08 11:13:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17004 to 15707. [2024-11-08 11:13:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15707 states, 15706 states have (on average 1.1050553928434994) internal successors, (17356), 15706 states have internal predecessors, (17356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15707 states to 15707 states and 17356 transitions. [2024-11-08 11:13:23,738 INFO L78 Accepts]: Start accepts. Automaton has 15707 states and 17356 transitions. Word has length 547 [2024-11-08 11:13:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:23,738 INFO L471 AbstractCegarLoop]: Abstraction has 15707 states and 17356 transitions. [2024-11-08 11:13:23,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15707 states and 17356 transitions. [2024-11-08 11:13:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2024-11-08 11:13:23,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:23,751 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:23,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 11:13:23,752 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:23,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1519719464, now seen corresponding path program 1 times [2024-11-08 11:13:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:23,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444035781] [2024-11-08 11:13:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-08 11:13:24,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:24,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444035781] [2024-11-08 11:13:24,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444035781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:24,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:24,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:24,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758485938] [2024-11-08 11:13:24,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:24,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:24,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:24,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:24,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:24,014 INFO L87 Difference]: Start difference. First operand 15707 states and 17356 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:24,549 INFO L93 Difference]: Finished difference Result 29218 states and 32305 transitions. [2024-11-08 11:13:24,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:24,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 561 [2024-11-08 11:13:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:24,566 INFO L225 Difference]: With dead ends: 29218 [2024-11-08 11:13:24,566 INFO L226 Difference]: Without dead ends: 15725 [2024-11-08 11:13:24,575 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-11-08 11:13:24,575 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 102 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:24,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 160 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15725 states. [2024-11-08 11:13:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15725 to 15339. [2024-11-08 11:13:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15339 states, 15338 states have (on average 1.0973399400182553) internal successors, (16831), 15338 states have internal predecessors, (16831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 16831 transitions. [2024-11-08 11:13:24,697 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 16831 transitions. Word has length 561 [2024-11-08 11:13:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:24,698 INFO L471 AbstractCegarLoop]: Abstraction has 15339 states and 16831 transitions. [2024-11-08 11:13:24,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 16831 transitions. [2024-11-08 11:13:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2024-11-08 11:13:24,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:24,709 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:24,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 11:13:24,709 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:24,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1808687197, now seen corresponding path program 1 times [2024-11-08 11:13:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370070468] [2024-11-08 11:13:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:24,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-08 11:13:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:24,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370070468] [2024-11-08 11:13:24,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370070468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:24,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:24,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:24,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528726231] [2024-11-08 11:13:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:24,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:24,951 INFO L87 Difference]: Start difference. First operand 15339 states and 16831 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:25,557 INFO L93 Difference]: Finished difference Result 31775 states and 34829 transitions. [2024-11-08 11:13:25,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:25,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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 562 [2024-11-08 11:13:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:25,559 INFO L225 Difference]: With dead ends: 31775 [2024-11-08 11:13:25,559 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:13:25,572 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-11-08 11:13:25,573 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 101 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:25,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 127 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:13:25,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:13:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:13:25,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 562 [2024-11-08 11:13:25,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:25,575 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:13:25,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:13:25,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:13:25,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:13:25,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 11:13:25,581 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:25,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:13:32,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:13:32,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:13:32 BoogieIcfgContainer [2024-11-08 11:13:32,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:13:32,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:13:32,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:13:32,412 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:13:32,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:51" (3/4) ... [2024-11-08 11:13:32,415 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:13:32,441 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:13:32,443 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:13:32,444 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:13:32,445 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:13:32,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:13:32,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:13:32,633 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:13:32,637 INFO L158 Benchmark]: Toolchain (without parser) took 44005.40ms. Allocated memory was 163.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 102.7MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-08 11:13:32,637 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 123.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:13:32,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.26ms. Allocated memory was 163.6MB in the beginning and 228.6MB in the end (delta: 65.0MB). Free memory was 102.7MB in the beginning and 182.8MB in the end (delta: -80.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-11-08 11:13:32,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.85ms. Allocated memory is still 228.6MB. Free memory was 182.8MB in the beginning and 165.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 11:13:32,638 INFO L158 Benchmark]: Boogie Preprocessor took 176.20ms. Allocated memory is still 228.6MB. Free memory was 165.0MB in the beginning and 139.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 11:13:32,638 INFO L158 Benchmark]: RCFGBuilder took 1622.52ms. Allocated memory is still 228.6MB. Free memory was 139.8MB in the beginning and 90.1MB in the end (delta: 49.7MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-11-08 11:13:32,638 INFO L158 Benchmark]: TraceAbstraction took 41070.24ms. Allocated memory was 228.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 90.1MB in the beginning and 651.7MB in the end (delta: -561.6MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-08 11:13:32,639 INFO L158 Benchmark]: Witness Printer took 220.73ms. Allocated memory is still 2.1GB. Free memory was 651.7MB in the beginning and 1.9GB in the end (delta: -1.2GB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 11:13:32,640 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 123.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.26ms. Allocated memory was 163.6MB in the beginning and 228.6MB in the end (delta: 65.0MB). Free memory was 102.7MB in the beginning and 182.8MB in the end (delta: -80.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.85ms. Allocated memory is still 228.6MB. Free memory was 182.8MB in the beginning and 165.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 176.20ms. Allocated memory is still 228.6MB. Free memory was 165.0MB in the beginning and 139.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1622.52ms. Allocated memory is still 228.6MB. Free memory was 139.8MB in the beginning and 90.1MB in the end (delta: 49.7MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41070.24ms. Allocated memory was 228.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 90.1MB in the beginning and 651.7MB in the end (delta: -561.6MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 220.73ms. Allocated memory is still 2.1GB. Free memory was 651.7MB in the beginning and 1.9GB in the end (delta: -1.2GB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 151]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4329 SdHoareTripleChecker+Valid, 17.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4329 mSDsluCounter, 4986 SdHoareTripleChecker+Invalid, 14.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 2144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17194 IncrementalHoareTripleChecker+Invalid, 19338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2144 mSolverCounterUnsat, 4312 mSDtfsCounter, 17194 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 939 GetRequests, 897 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17789occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 24702 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 7510 NumberOfCodeBlocks, 7510 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 7484 ConstructedInterpolants, 0 QuantifiedInterpolants, 23061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1222 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 7701/7924 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a25 <= 10) && (a4 == 1)) && (312 <= a23)) && (a29 <= 130)) || (((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a29 <= 220))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || ((((307 <= a23) && (a29 <= 599999)) && (a4 == 1)) && (a25 == 10))) || (((((long long) a23 + 43) <= 0) && (a25 == 11)) && (a29 <= 130))) || (((a25 == 13) && (a29 <= 599999)) && (a4 == 1))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 9))) || (((a4 == 0) && (a25 == 10)) && (a29 <= 130))) || (((a29 <= 275) && (a25 == 12)) && (a4 == 0))) || ((((a25 == 13) && (a4 == 0)) && (((long long) 35913 + a29) <= 0)) && (a23 <= 137))) || (((a29 <= 275) && (a4 == 1)) && (a25 == 10))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a29 <= 599999)) && (a25 == 9))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11)) && (a29 <= 599999))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 10))) || (((a25 == 12) && (a29 <= 599999)) && (a4 == 1))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 137))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599999)) && (a23 <= 137))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (a4 == 0))) || ((((((((long long) a23 + 43) <= 0) && (((long long) a29 + 275824) <= 0)) && (a25 == 9)) || ((((a29 <= 275) && (a25 <= 10)) && (a23 <= 262)) && (a4 == 1))) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))) && (a29 <= 599999))) || (((a29 <= 599999) && (a25 == 9)) && (a4 == 1))) || ((((a29 <= 275) && (a4 == 0)) && (a25 == 11)) && (a23 <= 262))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:13:32,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE