./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:31:05,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:31:05,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:31:05,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:31:05,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:31:05,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:31:05,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:31:05,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:31:05,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:31:05,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:31:05,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:31:05,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:31:05,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:31:05,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:31:05,239 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:31:05,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:31:05,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:31:05,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:31:05,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:31:05,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:31:05,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:31:05,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:31:05,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:31:05,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:31:05,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:31:05,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:31:05,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:31:05,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:31:05,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:31:05,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:31:05,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:31:05,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:31:05,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:31:05,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:31:05,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:31:05,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:31:05,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:31:05,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:31:05,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:31:05,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:31:05,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:31:05,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:31:05,253 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2024-10-10 22:31:05,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:31:05,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:31:05,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:31:05,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:31:05,544 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:31:05,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2024-10-10 22:31:07,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:31:07,222 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:31:07,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2024-10-10 22:31:07,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c2550cb87/808db807e3f54e9b979d7545cd3e0097/FLAG323d89493 [2024-10-10 22:31:07,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c2550cb87/808db807e3f54e9b979d7545cd3e0097 [2024-10-10 22:31:07,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:31:07,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:31:07,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:31:07,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:31:07,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:31:07,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39063a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07, skipping insertion in model container [2024-10-10 22:31:07,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:31:07,454 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2024-10-10 22:31:07,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:31:07,466 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:31:07,486 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2024-10-10 22:31:07,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:31:07,501 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:31:07,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07 WrapperNode [2024-10-10 22:31:07,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:31:07,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:31:07,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:31:07,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:31:07,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,544 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2024-10-10 22:31:07,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:31:07,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:31:07,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:31:07,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:31:07,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,574 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:31:07,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:31:07,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:31:07,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:31:07,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:31:07,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (1/1) ... [2024-10-10 22:31:07,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:31:07,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:31:07,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:31:07,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:31:07,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:31:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:31:07,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:31:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:31:07,755 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:31:07,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:31:08,062 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-10 22:31:08,062 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:31:08,093 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:31:08,093 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:31:08,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:31:08 BoogieIcfgContainer [2024-10-10 22:31:08,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:31:08,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:31:08,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:31:08,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:31:08,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:31:07" (1/3) ... [2024-10-10 22:31:08,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4678b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:31:08, skipping insertion in model container [2024-10-10 22:31:08,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:07" (2/3) ... [2024-10-10 22:31:08,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4678b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:31:08, skipping insertion in model container [2024-10-10 22:31:08,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:31:08" (3/3) ... [2024-10-10 22:31:08,103 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2024-10-10 22:31:08,118 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:31:08,119 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:31:08,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:31:08,195 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;@3b177f57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:31:08,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:31:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-10 22:31:08,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:08,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:08,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:08,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash 42336344, now seen corresponding path program 1 times [2024-10-10 22:31:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367405146] [2024-10-10 22:31:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:08,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:08,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367405146] [2024-10-10 22:31:08,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367405146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:08,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:08,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:08,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712808752] [2024-10-10 22:31:08,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:08,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:08,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:08,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:08,472 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:08,523 INFO L93 Difference]: Finished difference Result 72 states and 129 transitions. [2024-10-10 22:31:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:08,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-10 22:31:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:08,536 INFO L225 Difference]: With dead ends: 72 [2024-10-10 22:31:08,536 INFO L226 Difference]: Without dead ends: 62 [2024-10-10 22:31:08,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:08,544 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 45 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:08,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 118 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-10 22:31:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2024-10-10 22:31:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2024-10-10 22:31:08,582 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 15 [2024-10-10 22:31:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:08,582 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 77 transitions. [2024-10-10 22:31:08,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 77 transitions. [2024-10-10 22:31:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-10 22:31:08,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:08,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:08,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:31:08,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:08,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 300501782, now seen corresponding path program 1 times [2024-10-10 22:31:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222563956] [2024-10-10 22:31:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:08,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:08,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222563956] [2024-10-10 22:31:08,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222563956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:08,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705066116] [2024-10-10 22:31:08,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:08,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:08,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:08,684 INFO L87 Difference]: Start difference. First operand 42 states and 77 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:08,708 INFO L93 Difference]: Finished difference Result 103 states and 188 transitions. [2024-10-10 22:31:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:08,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-10 22:31:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:08,710 INFO L225 Difference]: With dead ends: 103 [2024-10-10 22:31:08,710 INFO L226 Difference]: Without dead ends: 62 [2024-10-10 22:31:08,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:08,711 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:08,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 126 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-10 22:31:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-10-10 22:31:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.847457627118644) internal successors, (109), 59 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2024-10-10 22:31:08,721 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 15 [2024-10-10 22:31:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:08,721 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2024-10-10 22:31:08,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2024-10-10 22:31:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:31:08,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:08,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:08,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:31:08,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:08,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1312640336, now seen corresponding path program 1 times [2024-10-10 22:31:08,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:08,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810593097] [2024-10-10 22:31:08,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:08,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810593097] [2024-10-10 22:31:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810593097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:08,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569089210] [2024-10-10 22:31:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:08,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:08,797 INFO L87 Difference]: Start difference. First operand 60 states and 109 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:08,822 INFO L93 Difference]: Finished difference Result 95 states and 167 transitions. [2024-10-10 22:31:08,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:08,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:31:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:08,828 INFO L225 Difference]: With dead ends: 95 [2024-10-10 22:31:08,828 INFO L226 Difference]: Without dead ends: 65 [2024-10-10 22:31:08,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:08,829 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 45 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:08,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 141 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-10 22:31:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-10-10 22:31:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.7903225806451613) internal successors, (111), 62 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 111 transitions. [2024-10-10 22:31:08,843 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 111 transitions. Word has length 16 [2024-10-10 22:31:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:08,843 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 111 transitions. [2024-10-10 22:31:08,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2024-10-10 22:31:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:31:08,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:08,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:31:08,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 725834322, now seen corresponding path program 1 times [2024-10-10 22:31:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:08,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955170225] [2024-10-10 22:31:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:08,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955170225] [2024-10-10 22:31:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955170225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:08,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043607443] [2024-10-10 22:31:08,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:08,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:08,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:08,906 INFO L87 Difference]: Start difference. First operand 63 states and 111 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:08,931 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2024-10-10 22:31:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:31:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:08,933 INFO L225 Difference]: With dead ends: 120 [2024-10-10 22:31:08,934 INFO L226 Difference]: Without dead ends: 118 [2024-10-10 22:31:08,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:08,935 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 40 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:08,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 110 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-10 22:31:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2024-10-10 22:31:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.783132530120482) internal successors, (148), 83 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 148 transitions. [2024-10-10 22:31:08,948 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 148 transitions. Word has length 16 [2024-10-10 22:31:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:08,949 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 148 transitions. [2024-10-10 22:31:08,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 148 transitions. [2024-10-10 22:31:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:31:08,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:08,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:08,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:31:08,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:08,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash 983999760, now seen corresponding path program 1 times [2024-10-10 22:31:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645682336] [2024-10-10 22:31:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645682336] [2024-10-10 22:31:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645682336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274155404] [2024-10-10 22:31:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,007 INFO L87 Difference]: Start difference. First operand 84 states and 148 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,032 INFO L93 Difference]: Finished difference Result 200 states and 354 transitions. [2024-10-10 22:31:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:31:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,035 INFO L225 Difference]: With dead ends: 200 [2024-10-10 22:31:09,038 INFO L226 Difference]: Without dead ends: 120 [2024-10-10 22:31:09,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,040 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-10 22:31:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-10 22:31:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.7606837606837606) internal successors, (206), 117 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2024-10-10 22:31:09,064 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 16 [2024-10-10 22:31:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,065 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2024-10-10 22:31:09,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2024-10-10 22:31:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:31:09,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:09,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:31:09,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1026241515, now seen corresponding path program 1 times [2024-10-10 22:31:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525071778] [2024-10-10 22:31:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525071778] [2024-10-10 22:31:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525071778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729856732] [2024-10-10 22:31:09,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,121 INFO L87 Difference]: Start difference. First operand 118 states and 206 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,139 INFO L93 Difference]: Finished difference Result 179 states and 309 transitions. [2024-10-10 22:31:09,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-10 22:31:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,142 INFO L225 Difference]: With dead ends: 179 [2024-10-10 22:31:09,142 INFO L226 Difference]: Without dead ends: 122 [2024-10-10 22:31:09,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,144 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 44 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 137 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-10 22:31:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-10-10 22:31:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.73109243697479) internal successors, (206), 119 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 206 transitions. [2024-10-10 22:31:09,158 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 206 transitions. Word has length 17 [2024-10-10 22:31:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,159 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 206 transitions. [2024-10-10 22:31:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 206 transitions. [2024-10-10 22:31:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:31:09,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:09,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:31:09,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 439435501, now seen corresponding path program 1 times [2024-10-10 22:31:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974887020] [2024-10-10 22:31:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974887020] [2024-10-10 22:31:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974887020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315064361] [2024-10-10 22:31:09,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,210 INFO L87 Difference]: Start difference. First operand 120 states and 206 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,233 INFO L93 Difference]: Finished difference Result 344 states and 592 transitions. [2024-10-10 22:31:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-10 22:31:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,235 INFO L225 Difference]: With dead ends: 344 [2024-10-10 22:31:09,235 INFO L226 Difference]: Without dead ends: 230 [2024-10-10 22:31:09,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,237 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 112 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-10 22:31:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-10-10 22:31:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.7004405286343611) internal successors, (386), 227 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 386 transitions. [2024-10-10 22:31:09,271 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 386 transitions. Word has length 17 [2024-10-10 22:31:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,271 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 386 transitions. [2024-10-10 22:31:09,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 386 transitions. [2024-10-10 22:31:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:31:09,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:09,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:31:09,277 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash 181270063, now seen corresponding path program 1 times [2024-10-10 22:31:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379486041] [2024-10-10 22:31:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379486041] [2024-10-10 22:31:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379486041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251950780] [2024-10-10 22:31:09,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,333 INFO L87 Difference]: Start difference. First operand 228 states and 386 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,353 INFO L93 Difference]: Finished difference Result 288 states and 492 transitions. [2024-10-10 22:31:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-10 22:31:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,355 INFO L225 Difference]: With dead ends: 288 [2024-10-10 22:31:09,355 INFO L226 Difference]: Without dead ends: 286 [2024-10-10 22:31:09,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,359 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 37 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-10 22:31:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 228. [2024-10-10 22:31:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6828193832599119) internal successors, (382), 227 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 382 transitions. [2024-10-10 22:31:09,382 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 382 transitions. Word has length 17 [2024-10-10 22:31:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,382 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 382 transitions. [2024-10-10 22:31:09,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 382 transitions. [2024-10-10 22:31:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-10 22:31:09,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:09,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:31:09,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash 737812997, now seen corresponding path program 1 times [2024-10-10 22:31:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928499943] [2024-10-10 22:31:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928499943] [2024-10-10 22:31:09,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928499943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460297579] [2024-10-10 22:31:09,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,428 INFO L87 Difference]: Start difference. First operand 228 states and 382 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,451 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2024-10-10 22:31:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-10 22:31:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,453 INFO L225 Difference]: With dead ends: 420 [2024-10-10 22:31:09,454 INFO L226 Difference]: Without dead ends: 418 [2024-10-10 22:31:09,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,455 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 34 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-10 22:31:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 320. [2024-10-10 22:31:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.6489028213166144) internal successors, (526), 319 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 526 transitions. [2024-10-10 22:31:09,474 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 526 transitions. Word has length 18 [2024-10-10 22:31:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,475 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 526 transitions. [2024-10-10 22:31:09,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 526 transitions. [2024-10-10 22:31:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-10 22:31:09,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:09,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:31:09,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 995978435, now seen corresponding path program 1 times [2024-10-10 22:31:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351847943] [2024-10-10 22:31:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351847943] [2024-10-10 22:31:09,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351847943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161858474] [2024-10-10 22:31:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,525 INFO L87 Difference]: Start difference. First operand 320 states and 526 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,551 INFO L93 Difference]: Finished difference Result 756 states and 1248 transitions. [2024-10-10 22:31:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-10 22:31:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,554 INFO L225 Difference]: With dead ends: 756 [2024-10-10 22:31:09,554 INFO L226 Difference]: Without dead ends: 442 [2024-10-10 22:31:09,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,559 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 40 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-10 22:31:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2024-10-10 22:31:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.6264236902050113) internal successors, (714), 439 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 714 transitions. [2024-10-10 22:31:09,579 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 714 transitions. Word has length 18 [2024-10-10 22:31:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,580 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 714 transitions. [2024-10-10 22:31:09,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 714 transitions. [2024-10-10 22:31:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 22:31:09,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:09,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:31:09,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1397581122, now seen corresponding path program 1 times [2024-10-10 22:31:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055533249] [2024-10-10 22:31:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055533249] [2024-10-10 22:31:09,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055533249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325668041] [2024-10-10 22:31:09,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,621 INFO L87 Difference]: Start difference. First operand 440 states and 714 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,644 INFO L93 Difference]: Finished difference Result 668 states and 1080 transitions. [2024-10-10 22:31:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-10 22:31:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,647 INFO L225 Difference]: With dead ends: 668 [2024-10-10 22:31:09,647 INFO L226 Difference]: Without dead ends: 454 [2024-10-10 22:31:09,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,648 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 42 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-10-10 22:31:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2024-10-10 22:31:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.6008869179600886) internal successors, (722), 451 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 722 transitions. [2024-10-10 22:31:09,661 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 722 transitions. Word has length 19 [2024-10-10 22:31:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,662 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 722 transitions. [2024-10-10 22:31:09,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 722 transitions. [2024-10-10 22:31:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 22:31:09,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:09,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:31:09,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash 810775108, now seen corresponding path program 1 times [2024-10-10 22:31:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399297228] [2024-10-10 22:31:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399297228] [2024-10-10 22:31:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399297228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25202897] [2024-10-10 22:31:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,704 INFO L87 Difference]: Start difference. First operand 452 states and 722 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,736 INFO L93 Difference]: Finished difference Result 808 states and 1308 transitions. [2024-10-10 22:31:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-10 22:31:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,739 INFO L225 Difference]: With dead ends: 808 [2024-10-10 22:31:09,740 INFO L226 Difference]: Without dead ends: 806 [2024-10-10 22:31:09,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,742 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 104 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-10 22:31:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 644. [2024-10-10 22:31:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.5583203732503887) internal successors, (1002), 643 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1002 transitions. [2024-10-10 22:31:09,761 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1002 transitions. Word has length 19 [2024-10-10 22:31:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,762 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 1002 transitions. [2024-10-10 22:31:09,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1002 transitions. [2024-10-10 22:31:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 22:31:09,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:09,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:31:09,764 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1068940546, now seen corresponding path program 1 times [2024-10-10 22:31:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429335462] [2024-10-10 22:31:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429335462] [2024-10-10 22:31:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429335462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386284568] [2024-10-10 22:31:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,790 INFO L87 Difference]: Start difference. First operand 644 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,818 INFO L93 Difference]: Finished difference Result 1496 states and 2332 transitions. [2024-10-10 22:31:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-10 22:31:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,822 INFO L225 Difference]: With dead ends: 1496 [2024-10-10 22:31:09,822 INFO L226 Difference]: Without dead ends: 870 [2024-10-10 22:31:09,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,825 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 39 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 130 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-10-10 22:31:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 868. [2024-10-10 22:31:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.5340253748558246) internal successors, (1330), 867 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2024-10-10 22:31:09,853 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 19 [2024-10-10 22:31:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,853 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2024-10-10 22:31:09,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2024-10-10 22:31:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-10 22:31:09,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,855 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] [2024-10-10 22:31:09,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:31:09,856 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash -635560392, now seen corresponding path program 1 times [2024-10-10 22:31:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441894868] [2024-10-10 22:31:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441894868] [2024-10-10 22:31:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441894868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102829879] [2024-10-10 22:31:09,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,884 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,909 INFO L93 Difference]: Finished difference Result 1304 states and 1988 transitions. [2024-10-10 22:31:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:09,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-10 22:31:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,914 INFO L225 Difference]: With dead ends: 1304 [2024-10-10 22:31:09,914 INFO L226 Difference]: Without dead ends: 886 [2024-10-10 22:31:09,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,916 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-10 22:31:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2024-10-10 22:31:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 1.506228765571914) internal successors, (1330), 883 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1330 transitions. [2024-10-10 22:31:09,941 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1330 transitions. Word has length 20 [2024-10-10 22:31:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,942 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1330 transitions. [2024-10-10 22:31:09,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1330 transitions. [2024-10-10 22:31:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-10 22:31:09,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,943 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] [2024-10-10 22:31:09,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:31:09,943 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1222366406, now seen corresponding path program 1 times [2024-10-10 22:31:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:09,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583425718] [2024-10-10 22:31:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583425718] [2024-10-10 22:31:09,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583425718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:09,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257417805] [2024-10-10 22:31:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:09,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:09,975 INFO L87 Difference]: Start difference. First operand 884 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:10,011 INFO L93 Difference]: Finished difference Result 1544 states and 2356 transitions. [2024-10-10 22:31:10,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:10,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-10 22:31:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:10,016 INFO L225 Difference]: With dead ends: 1544 [2024-10-10 22:31:10,016 INFO L226 Difference]: Without dead ends: 1542 [2024-10-10 22:31:10,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,019 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 28 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:10,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-10-10 22:31:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1284. [2024-10-10 22:31:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1283 states have (on average 1.460639127045986) internal successors, (1874), 1283 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1874 transitions. [2024-10-10 22:31:10,054 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1874 transitions. Word has length 20 [2024-10-10 22:31:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:10,055 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1874 transitions. [2024-10-10 22:31:10,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1874 transitions. [2024-10-10 22:31:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-10 22:31:10,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:10,057 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] [2024-10-10 22:31:10,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:31:10,057 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:10,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:10,057 INFO L85 PathProgramCache]: Analyzing trace with hash -964200968, now seen corresponding path program 1 times [2024-10-10 22:31:10,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:10,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237157750] [2024-10-10 22:31:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:10,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:10,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:10,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237157750] [2024-10-10 22:31:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237157750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:10,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:10,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653656949] [2024-10-10 22:31:10,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:10,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:10,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,085 INFO L87 Difference]: Start difference. First operand 1284 states and 1874 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:10,143 INFO L93 Difference]: Finished difference Result 2952 states and 4308 transitions. [2024-10-10 22:31:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:10,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-10 22:31:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:10,151 INFO L225 Difference]: With dead ends: 2952 [2024-10-10 22:31:10,151 INFO L226 Difference]: Without dead ends: 1702 [2024-10-10 22:31:10,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,153 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:10,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 131 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2024-10-10 22:31:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1700. [2024-10-10 22:31:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1699 states have (on average 1.4326074161271336) internal successors, (2434), 1699 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2434 transitions. [2024-10-10 22:31:10,212 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2434 transitions. Word has length 20 [2024-10-10 22:31:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:10,212 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2434 transitions. [2024-10-10 22:31:10,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2434 transitions. [2024-10-10 22:31:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:31:10,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:10,214 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] [2024-10-10 22:31:10,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 22:31:10,215 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:10,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:10,215 INFO L85 PathProgramCache]: Analyzing trace with hash 761562455, now seen corresponding path program 1 times [2024-10-10 22:31:10,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:10,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434062007] [2024-10-10 22:31:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:10,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:10,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:10,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434062007] [2024-10-10 22:31:10,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434062007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:10,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:10,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996718035] [2024-10-10 22:31:10,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:10,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:10,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:10,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:10,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,242 INFO L87 Difference]: Start difference. First operand 1700 states and 2434 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:10,296 INFO L93 Difference]: Finished difference Result 2552 states and 3636 transitions. [2024-10-10 22:31:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-10 22:31:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:10,303 INFO L225 Difference]: With dead ends: 2552 [2024-10-10 22:31:10,303 INFO L226 Difference]: Without dead ends: 1734 [2024-10-10 22:31:10,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,305 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:10,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-10-10 22:31:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2024-10-10 22:31:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1731 states have (on average 1.4061236279607163) internal successors, (2434), 1731 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2434 transitions. [2024-10-10 22:31:10,360 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2434 transitions. Word has length 21 [2024-10-10 22:31:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:10,361 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2434 transitions. [2024-10-10 22:31:10,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2434 transitions. [2024-10-10 22:31:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:31:10,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:10,363 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] [2024-10-10 22:31:10,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 22:31:10,363 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash 174756441, now seen corresponding path program 1 times [2024-10-10 22:31:10,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:10,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334792014] [2024-10-10 22:31:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:10,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:10,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334792014] [2024-10-10 22:31:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334792014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:10,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:10,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208365102] [2024-10-10 22:31:10,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:10,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:10,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:10,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,384 INFO L87 Difference]: Start difference. First operand 1732 states and 2434 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:10,482 INFO L93 Difference]: Finished difference Result 2952 states and 4196 transitions. [2024-10-10 22:31:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:10,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-10 22:31:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:10,491 INFO L225 Difference]: With dead ends: 2952 [2024-10-10 22:31:10,491 INFO L226 Difference]: Without dead ends: 2950 [2024-10-10 22:31:10,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,493 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:10,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 100 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2024-10-10 22:31:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2564. [2024-10-10 22:31:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2563 states have (on average 1.3616855247756536) internal successors, (3490), 2563 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3490 transitions. [2024-10-10 22:31:10,566 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3490 transitions. Word has length 21 [2024-10-10 22:31:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:10,566 INFO L471 AbstractCegarLoop]: Abstraction has 2564 states and 3490 transitions. [2024-10-10 22:31:10,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3490 transitions. [2024-10-10 22:31:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:31:10,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:10,569 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] [2024-10-10 22:31:10,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:31:10,570 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:10,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 432921879, now seen corresponding path program 1 times [2024-10-10 22:31:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436188918] [2024-10-10 22:31:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:10,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:10,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436188918] [2024-10-10 22:31:10,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436188918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:10,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:10,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:10,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296717776] [2024-10-10 22:31:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:10,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:10,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,591 INFO L87 Difference]: Start difference. First operand 2564 states and 3490 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:10,677 INFO L93 Difference]: Finished difference Result 5832 states and 7908 transitions. [2024-10-10 22:31:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:10,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-10 22:31:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:10,687 INFO L225 Difference]: With dead ends: 5832 [2024-10-10 22:31:10,688 INFO L226 Difference]: Without dead ends: 3334 [2024-10-10 22:31:10,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,691 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:10,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 132 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2024-10-10 22:31:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3332. [2024-10-10 22:31:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 3331 states have (on average 1.3263284299009306) internal successors, (4418), 3331 states have internal predecessors, (4418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4418 transitions. [2024-10-10 22:31:10,851 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4418 transitions. Word has length 21 [2024-10-10 22:31:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:10,852 INFO L471 AbstractCegarLoop]: Abstraction has 3332 states and 4418 transitions. [2024-10-10 22:31:10,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4418 transitions. [2024-10-10 22:31:10,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:31:10,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:10,856 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] [2024-10-10 22:31:10,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 22:31:10,857 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:10,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1122698093, now seen corresponding path program 1 times [2024-10-10 22:31:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740614198] [2024-10-10 22:31:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:10,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:10,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740614198] [2024-10-10 22:31:10,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740614198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:10,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:10,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046260489] [2024-10-10 22:31:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:10,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:10,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:10,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,878 INFO L87 Difference]: Start difference. First operand 3332 states and 4418 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:10,952 INFO L93 Difference]: Finished difference Result 5000 states and 6596 transitions. [2024-10-10 22:31:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-10 22:31:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:10,964 INFO L225 Difference]: With dead ends: 5000 [2024-10-10 22:31:10,965 INFO L226 Difference]: Without dead ends: 3398 [2024-10-10 22:31:10,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,968 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 39 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:10,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 117 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2024-10-10 22:31:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3396. [2024-10-10 22:31:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3395 states have (on average 1.3013254786450663) internal successors, (4418), 3395 states have internal predecessors, (4418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4418 transitions. [2024-10-10 22:31:11,094 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4418 transitions. Word has length 22 [2024-10-10 22:31:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:11,094 INFO L471 AbstractCegarLoop]: Abstraction has 3396 states and 4418 transitions. [2024-10-10 22:31:11,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4418 transitions. [2024-10-10 22:31:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:31:11,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:11,098 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] [2024-10-10 22:31:11,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:31:11,098 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:11,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:11,099 INFO L85 PathProgramCache]: Analyzing trace with hash 535892079, now seen corresponding path program 1 times [2024-10-10 22:31:11,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:11,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996351833] [2024-10-10 22:31:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:11,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:11,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996351833] [2024-10-10 22:31:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996351833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:11,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:11,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353382423] [2024-10-10 22:31:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:11,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:11,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:11,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:11,124 INFO L87 Difference]: Start difference. First operand 3396 states and 4418 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:11,233 INFO L93 Difference]: Finished difference Result 5640 states and 7364 transitions. [2024-10-10 22:31:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:11,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-10 22:31:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:11,250 INFO L225 Difference]: With dead ends: 5640 [2024-10-10 22:31:11,254 INFO L226 Difference]: Without dead ends: 5638 [2024-10-10 22:31:11,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:11,257 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:11,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 98 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2024-10-10 22:31:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5124. [2024-10-10 22:31:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5124 states, 5123 states have (on average 1.2621510833496) internal successors, (6466), 5123 states have internal predecessors, (6466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6466 transitions. [2024-10-10 22:31:11,415 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6466 transitions. Word has length 22 [2024-10-10 22:31:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:11,415 INFO L471 AbstractCegarLoop]: Abstraction has 5124 states and 6466 transitions. [2024-10-10 22:31:11,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6466 transitions. [2024-10-10 22:31:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:31:11,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:11,421 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] [2024-10-10 22:31:11,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:31:11,421 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:11,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash 794057517, now seen corresponding path program 1 times [2024-10-10 22:31:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:11,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040472688] [2024-10-10 22:31:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:11,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:11,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040472688] [2024-10-10 22:31:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040472688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:11,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:11,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828486038] [2024-10-10 22:31:11,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:11,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:11,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:11,442 INFO L87 Difference]: Start difference. First operand 5124 states and 6466 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:11,578 INFO L93 Difference]: Finished difference Result 11528 states and 14404 transitions. [2024-10-10 22:31:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:11,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-10 22:31:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:11,589 INFO L225 Difference]: With dead ends: 11528 [2024-10-10 22:31:11,589 INFO L226 Difference]: Without dead ends: 6534 [2024-10-10 22:31:11,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:11,596 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 36 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:11,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2024-10-10 22:31:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6532. [2024-10-10 22:31:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6532 states, 6531 states have (on average 1.2154340836012862) internal successors, (7938), 6531 states have internal predecessors, (7938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 7938 transitions. [2024-10-10 22:31:11,806 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 7938 transitions. Word has length 22 [2024-10-10 22:31:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:11,806 INFO L471 AbstractCegarLoop]: Abstraction has 6532 states and 7938 transitions. [2024-10-10 22:31:11,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 7938 transitions. [2024-10-10 22:31:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:31:11,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:11,813 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] [2024-10-10 22:31:11,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 22:31:11,814 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:11,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash -566998676, now seen corresponding path program 1 times [2024-10-10 22:31:11,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:11,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081929957] [2024-10-10 22:31:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:11,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081929957] [2024-10-10 22:31:11,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081929957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:11,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:11,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:11,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169180877] [2024-10-10 22:31:11,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:11,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:11,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:11,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:11,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:11,834 INFO L87 Difference]: Start difference. First operand 6532 states and 7938 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:12,005 INFO L93 Difference]: Finished difference Result 9800 states and 11844 transitions. [2024-10-10 22:31:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:12,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-10 22:31:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:12,017 INFO L225 Difference]: With dead ends: 9800 [2024-10-10 22:31:12,018 INFO L226 Difference]: Without dead ends: 6662 [2024-10-10 22:31:12,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:12,024 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:12,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 113 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2024-10-10 22:31:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6660. [2024-10-10 22:31:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6660 states, 6659 states have (on average 1.1920708815137409) internal successors, (7938), 6659 states have internal predecessors, (7938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7938 transitions. [2024-10-10 22:31:12,237 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7938 transitions. Word has length 23 [2024-10-10 22:31:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:12,237 INFO L471 AbstractCegarLoop]: Abstraction has 6660 states and 7938 transitions. [2024-10-10 22:31:12,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7938 transitions. [2024-10-10 22:31:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:31:12,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:12,244 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] [2024-10-10 22:31:12,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 22:31:12,244 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:12,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:12,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1153804690, now seen corresponding path program 1 times [2024-10-10 22:31:12,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:12,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872981794] [2024-10-10 22:31:12,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:12,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:12,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:12,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872981794] [2024-10-10 22:31:12,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872981794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:12,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:12,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856685177] [2024-10-10 22:31:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:12,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:12,264 INFO L87 Difference]: Start difference. First operand 6660 states and 7938 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:12,455 INFO L93 Difference]: Finished difference Result 10758 states and 12675 transitions. [2024-10-10 22:31:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:12,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-10 22:31:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:12,475 INFO L225 Difference]: With dead ends: 10758 [2024-10-10 22:31:12,476 INFO L226 Difference]: Without dead ends: 10756 [2024-10-10 22:31:12,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:12,481 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:12,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 95 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2024-10-10 22:31:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10244. [2024-10-10 22:31:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10244 states, 10243 states have (on average 1.162354778873377) internal successors, (11906), 10243 states have internal predecessors, (11906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 11906 transitions. [2024-10-10 22:31:12,732 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 11906 transitions. Word has length 23 [2024-10-10 22:31:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:12,732 INFO L471 AbstractCegarLoop]: Abstraction has 10244 states and 11906 transitions. [2024-10-10 22:31:12,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 11906 transitions. [2024-10-10 22:31:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:31:12,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:12,744 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] [2024-10-10 22:31:12,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 22:31:12,744 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:12,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash -895639252, now seen corresponding path program 1 times [2024-10-10 22:31:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:12,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380895635] [2024-10-10 22:31:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380895635] [2024-10-10 22:31:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380895635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:12,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082772478] [2024-10-10 22:31:12,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:12,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:12,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:12,767 INFO L87 Difference]: Start difference. First operand 10244 states and 11906 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:13,001 INFO L93 Difference]: Finished difference Result 22788 states and 25986 transitions. [2024-10-10 22:31:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:13,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-10 22:31:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:13,003 INFO L225 Difference]: With dead ends: 22788 [2024-10-10 22:31:13,003 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:31:13,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:13,022 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:13,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 132 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:31:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:31:13,023 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-10-10 22:31:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:31:13,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-10-10 22:31:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:13,024 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:31:13,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:31:13,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:31:13,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:31:13,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 22:31:13,033 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, 1, 1] [2024-10-10 22:31:13,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:31:13,048 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:31:13,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:31:13 BoogieIcfgContainer [2024-10-10 22:31:13,060 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:31:13,061 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:31:13,061 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:31:13,061 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:31:13,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:31:08" (3/4) ... [2024-10-10 22:31:13,066 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:31:13,075 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-10 22:31:13,075 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:31:13,075 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:31:13,076 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:31:13,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:31:13,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:31:13,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:31:13,173 INFO L158 Benchmark]: Toolchain (without parser) took 5925.12ms. Allocated memory was 127.9MB in the beginning and 339.7MB in the end (delta: 211.8MB). Free memory was 75.5MB in the beginning and 226.2MB in the end (delta: -150.8MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2024-10-10 22:31:13,173 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 127.9MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:31:13,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.21ms. Allocated memory is still 127.9MB. Free memory was 75.5MB in the beginning and 62.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:31:13,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.84ms. Allocated memory is still 127.9MB. Free memory was 62.7MB in the beginning and 61.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:31:13,174 INFO L158 Benchmark]: Boogie Preprocessor took 37.33ms. Allocated memory is still 127.9MB. Free memory was 60.7MB in the beginning and 59.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:31:13,174 INFO L158 Benchmark]: RCFGBuilder took 508.29ms. Allocated memory is still 127.9MB. Free memory was 59.0MB in the beginning and 91.6MB in the end (delta: -32.6MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-10-10 22:31:13,175 INFO L158 Benchmark]: TraceAbstraction took 4963.91ms. Allocated memory was 127.9MB in the beginning and 339.7MB in the end (delta: 211.8MB). Free memory was 91.0MB in the beginning and 232.5MB in the end (delta: -141.5MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-10-10 22:31:13,175 INFO L158 Benchmark]: Witness Printer took 111.95ms. Allocated memory is still 339.7MB. Free memory was 231.5MB in the beginning and 226.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:31:13,178 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.17ms. Allocated memory is still 127.9MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.21ms. Allocated memory is still 127.9MB. Free memory was 75.5MB in the beginning and 62.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.84ms. Allocated memory is still 127.9MB. Free memory was 62.7MB in the beginning and 61.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.33ms. Allocated memory is still 127.9MB. Free memory was 60.7MB in the beginning and 59.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 508.29ms. Allocated memory is still 127.9MB. Free memory was 59.0MB in the beginning and 91.6MB in the end (delta: -32.6MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4963.91ms. Allocated memory was 127.9MB in the beginning and 339.7MB in the end (delta: 211.8MB). Free memory was 91.0MB in the beginning and 232.5MB in the end (delta: -141.5MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * Witness Printer took 111.95ms. Allocated memory is still 339.7MB. Free memory was 231.5MB in the beginning and 226.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 149]: 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 920 mSDsluCounter, 3017 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1205 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1812 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10244occurred in iteration=24, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 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: 38]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-10 22:31:13,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE