./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_14-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:23:38,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:23:38,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:23:38,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:23:38,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:23:38,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:23:38,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:23:38,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:23:38,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:23:38,226 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:23:38,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:23:38,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:23:38,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:23:38,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:23:38,228 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:23:38,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:23:38,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:23:38,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:23:38,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:23:38,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:23:38,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:23:38,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:23:38,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:23:38,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:23:38,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:23:38,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:23:38,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:23:38,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:23:38,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:23:38,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:23:38,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:23:38,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:23:38,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:23:38,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:23:38,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:23:38,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:23:38,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:23:38,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:23:38,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:23:38,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:23:38,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:23:38,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:23:38,240 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2024-11-08 10:23:38,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:23:38,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:23:38,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:23:38,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:23:38,571 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:23:38,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-08 10:23:39,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:23:40,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:23:40,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-08 10:23:40,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c99c094b/b47b5b2799e244d199b6b611c7d9c230/FLAG081ac3532 [2024-11-08 10:23:40,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c99c094b/b47b5b2799e244d199b6b611c7d9c230 [2024-11-08 10:23:40,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:23:40,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:23:40,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:23:40,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:23:40,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:23:40,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5412d6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40, skipping insertion in model container [2024-11-08 10:23:40,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:23:40,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2024-11-08 10:23:40,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:23:40,421 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:23:40,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2024-11-08 10:23:40,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:23:40,473 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:23:40,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40 WrapperNode [2024-11-08 10:23:40,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:23:40,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:23:40,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:23:40,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:23:40,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,517 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 196 [2024-11-08 10:23:40,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:23:40,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:23:40,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:23:40,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:23:40,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,562 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:23:40,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:23:40,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:23:40,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:23:40,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:23:40,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (1/1) ... [2024-11-08 10:23:40,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:23:40,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:40,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:23:40,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:23:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:23:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:23:40,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:23:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:23:40,754 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:23:40,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:23:41,151 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-08 10:23:41,151 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:23:41,169 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:23:41,169 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:23:41,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:41 BoogieIcfgContainer [2024-11-08 10:23:41,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:23:41,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:23:41,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:23:41,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:23:41,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:23:40" (1/3) ... [2024-11-08 10:23:41,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1508d8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:23:41, skipping insertion in model container [2024-11-08 10:23:41,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:40" (2/3) ... [2024-11-08 10:23:41,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1508d8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:23:41, skipping insertion in model container [2024-11-08 10:23:41,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:41" (3/3) ... [2024-11-08 10:23:41,181 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2024-11-08 10:23:41,197 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:23:41,198 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:23:41,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:23:41,265 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;@3201fc6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:23:41,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:23:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.92) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 10:23:41,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:41,278 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-11-08 10:23:41,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:41,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2024-11-08 10:23:41,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811810019] [2024-11-08 10:23:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:41,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811810019] [2024-11-08 10:23:41,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811810019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:41,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:41,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720516499] [2024-11-08 10:23:41,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:41,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:41,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:41,600 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.92) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 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 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-11-08 10:23:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:41,652 INFO L93 Difference]: Finished difference Result 105 states and 192 transitions. [2024-11-08 10:23:41,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:41,657 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-11-08 10:23:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:41,665 INFO L225 Difference]: With dead ends: 105 [2024-11-08 10:23:41,666 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 10:23:41,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:41,671 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:41,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 10:23:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2024-11-08 10:23:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2024-11-08 10:23:41,711 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2024-11-08 10:23:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:41,712 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2024-11-08 10:23:41,712 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-11-08 10:23:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2024-11-08 10:23:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 10:23:41,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:41,714 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-11-08 10:23:41,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:23:41,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:41,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2024-11-08 10:23:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:41,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792077512] [2024-11-08 10:23:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:41,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:41,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792077512] [2024-11-08 10:23:41,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792077512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:41,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:41,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:41,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991743739] [2024-11-08 10:23:41,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:41,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:41,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:41,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:41,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:41,804 INFO L87 Difference]: Start difference. First operand 63 states and 118 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-11-08 10:23:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:41,835 INFO L93 Difference]: Finished difference Result 154 states and 289 transitions. [2024-11-08 10:23:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:41,836 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-11-08 10:23:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:41,838 INFO L225 Difference]: With dead ends: 154 [2024-11-08 10:23:41,838 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 10:23:41,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:41,840 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:41,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 10:23:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-08 10:23:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 170 transitions. [2024-11-08 10:23:41,852 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 170 transitions. Word has length 21 [2024-11-08 10:23:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:41,852 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 170 transitions. [2024-11-08 10:23:41,853 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-11-08 10:23:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 170 transitions. [2024-11-08 10:23:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 10:23:41,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:41,854 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-11-08 10:23:41,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:23:41,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1188346975, now seen corresponding path program 1 times [2024-11-08 10:23:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:41,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59123633] [2024-11-08 10:23:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:41,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:41,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59123633] [2024-11-08 10:23:41,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59123633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:41,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:41,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:41,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46005944] [2024-11-08 10:23:41,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:41,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:41,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:41,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:41,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:41,952 INFO L87 Difference]: Start difference. First operand 91 states and 170 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-11-08 10:23:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:41,979 INFO L93 Difference]: Finished difference Result 141 states and 258 transitions. [2024-11-08 10:23:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:41,981 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-11-08 10:23:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:41,982 INFO L225 Difference]: With dead ends: 141 [2024-11-08 10:23:41,982 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 10:23:41,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:41,983 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:41,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 10:23:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-08 10:23:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2024-11-08 10:23:41,998 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 22 [2024-11-08 10:23:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:41,998 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2024-11-08 10:23:41,999 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-11-08 10:23:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2024-11-08 10:23:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 10:23:42,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,003 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-11-08 10:23:42,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:23:42,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1112475615, now seen corresponding path program 1 times [2024-11-08 10:23:42,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832451404] [2024-11-08 10:23:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832451404] [2024-11-08 10:23:42,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832451404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506355711] [2024-11-08 10:23:42,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,057 INFO L87 Difference]: Start difference. First operand 94 states and 172 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-11-08 10:23:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,074 INFO L93 Difference]: Finished difference Result 181 states and 333 transitions. [2024-11-08 10:23:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,075 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-11-08 10:23:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,076 INFO L225 Difference]: With dead ends: 181 [2024-11-08 10:23:42,076 INFO L226 Difference]: Without dead ends: 179 [2024-11-08 10:23:42,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,078 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 173 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-11-08 10:23:42,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-08 10:23:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 125. [2024-11-08 10:23:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 229 transitions. [2024-11-08 10:23:42,087 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 229 transitions. Word has length 22 [2024-11-08 10:23:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:42,088 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 229 transitions. [2024-11-08 10:23:42,088 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-11-08 10:23:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 229 transitions. [2024-11-08 10:23:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 10:23:42,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,089 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-11-08 10:23:42,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:23:42,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash -475872287, now seen corresponding path program 1 times [2024-11-08 10:23:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124356318] [2024-11-08 10:23:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124356318] [2024-11-08 10:23:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124356318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162024563] [2024-11-08 10:23:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,145 INFO L87 Difference]: Start difference. First operand 125 states and 229 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-11-08 10:23:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,160 INFO L93 Difference]: Finished difference Result 301 states and 555 transitions. [2024-11-08 10:23:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,161 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-11-08 10:23:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,163 INFO L225 Difference]: With dead ends: 301 [2024-11-08 10:23:42,163 INFO L226 Difference]: Without dead ends: 181 [2024-11-08 10:23:42,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,165 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:42,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 200 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-08 10:23:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-11-08 10:23:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 327 transitions. [2024-11-08 10:23:42,176 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 327 transitions. Word has length 22 [2024-11-08 10:23:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:42,176 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 327 transitions. [2024-11-08 10:23:42,176 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-11-08 10:23:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 327 transitions. [2024-11-08 10:23:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 10:23:42,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,178 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-11-08 10:23:42,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:23:42,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash 127218090, now seen corresponding path program 1 times [2024-11-08 10:23:42,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057100593] [2024-11-08 10:23:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057100593] [2024-11-08 10:23:42,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057100593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537186515] [2024-11-08 10:23:42,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,232 INFO L87 Difference]: Start difference. First operand 179 states and 327 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-11-08 10:23:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,290 INFO L93 Difference]: Finished difference Result 270 states and 490 transitions. [2024-11-08 10:23:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,291 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-11-08 10:23:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,292 INFO L225 Difference]: With dead ends: 270 [2024-11-08 10:23:42,292 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 10:23:42,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,293 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:42,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 10:23:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-08 10:23:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 327 transitions. [2024-11-08 10:23:42,313 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 327 transitions. Word has length 23 [2024-11-08 10:23:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:42,313 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 327 transitions. [2024-11-08 10:23:42,314 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-11-08 10:23:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 327 transitions. [2024-11-08 10:23:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 10:23:42,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,315 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-11-08 10:23:42,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:23:42,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1866926616, now seen corresponding path program 1 times [2024-11-08 10:23:42,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705605509] [2024-11-08 10:23:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705605509] [2024-11-08 10:23:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705605509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954724586] [2024-11-08 10:23:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,375 INFO L87 Difference]: Start difference. First operand 181 states and 327 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-11-08 10:23:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,395 INFO L93 Difference]: Finished difference Result 525 states and 953 transitions. [2024-11-08 10:23:42,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,396 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-11-08 10:23:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,400 INFO L225 Difference]: With dead ends: 525 [2024-11-08 10:23:42,400 INFO L226 Difference]: Without dead ends: 351 [2024-11-08 10:23:42,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,402 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:42,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-08 10:23:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2024-11-08 10:23:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 627 transitions. [2024-11-08 10:23:42,431 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 627 transitions. Word has length 23 [2024-11-08 10:23:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:42,435 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 627 transitions. [2024-11-08 10:23:42,436 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-11-08 10:23:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 627 transitions. [2024-11-08 10:23:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 10:23:42,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,437 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-11-08 10:23:42,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:23:42,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,438 INFO L85 PathProgramCache]: Analyzing trace with hash -278578714, now seen corresponding path program 1 times [2024-11-08 10:23:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468340214] [2024-11-08 10:23:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468340214] [2024-11-08 10:23:42,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468340214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275688614] [2024-11-08 10:23:42,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,471 INFO L87 Difference]: Start difference. First operand 349 states and 627 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-11-08 10:23:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,493 INFO L93 Difference]: Finished difference Result 449 states and 813 transitions. [2024-11-08 10:23:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,494 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-11-08 10:23:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,495 INFO L225 Difference]: With dead ends: 449 [2024-11-08 10:23:42,496 INFO L226 Difference]: Without dead ends: 447 [2024-11-08 10:23:42,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,497 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 62 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:42,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 242 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-08 10:23:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 349. [2024-11-08 10:23:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 623 transitions. [2024-11-08 10:23:42,519 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 623 transitions. Word has length 23 [2024-11-08 10:23:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:42,519 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 623 transitions. [2024-11-08 10:23:42,519 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-11-08 10:23:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 623 transitions. [2024-11-08 10:23:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 10:23:42,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:42,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:23:42,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2039937514, now seen corresponding path program 1 times [2024-11-08 10:23:42,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792196186] [2024-11-08 10:23:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792196186] [2024-11-08 10:23:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792196186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828618186] [2024-11-08 10:23:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,575 INFO L87 Difference]: Start difference. First operand 349 states and 623 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,596 INFO L93 Difference]: Finished difference Result 661 states and 1193 transitions. [2024-11-08 10:23:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-08 10:23:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,600 INFO L225 Difference]: With dead ends: 661 [2024-11-08 10:23:42,600 INFO L226 Difference]: Without dead ends: 659 [2024-11-08 10:23:42,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,601 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 169 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-11-08 10:23:42,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-08 10:23:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 481. [2024-11-08 10:23:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 847 transitions. [2024-11-08 10:23:42,616 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 847 transitions. Word has length 24 [2024-11-08 10:23:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:42,616 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 847 transitions. [2024-11-08 10:23:42,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 847 transitions. [2024-11-08 10:23:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 10:23:42,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:42,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:23:42,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 666681880, now seen corresponding path program 1 times [2024-11-08 10:23:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857348394] [2024-11-08 10:23:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857348394] [2024-11-08 10:23:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857348394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789666432] [2024-11-08 10:23:42,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,657 INFO L87 Difference]: Start difference. First operand 481 states and 847 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,677 INFO L93 Difference]: Finished difference Result 1157 states and 2049 transitions. [2024-11-08 10:23:42,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-08 10:23:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,680 INFO L225 Difference]: With dead ends: 1157 [2024-11-08 10:23:42,680 INFO L226 Difference]: Without dead ends: 683 [2024-11-08 10:23:42,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,682 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:42,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-08 10:23:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2024-11-08 10:23:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1195 transitions. [2024-11-08 10:23:42,699 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1195 transitions. Word has length 24 [2024-11-08 10:23:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:42,700 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1195 transitions. [2024-11-08 10:23:42,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1195 transitions. [2024-11-08 10:23:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 10:23:42,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:42,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:23:42,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1186659581, now seen corresponding path program 1 times [2024-11-08 10:23:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377121002] [2024-11-08 10:23:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377121002] [2024-11-08 10:23:42,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377121002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134967301] [2024-11-08 10:23:42,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,729 INFO L87 Difference]: Start difference. First operand 681 states and 1195 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,747 INFO L93 Difference]: Finished difference Result 1029 states and 1801 transitions. [2024-11-08 10:23:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-08 10:23:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,750 INFO L225 Difference]: With dead ends: 1029 [2024-11-08 10:23:42,750 INFO L226 Difference]: Without dead ends: 695 [2024-11-08 10:23:42,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,752 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:42,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-08 10:23:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2024-11-08 10:23:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1203 transitions. [2024-11-08 10:23:42,784 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1203 transitions. Word has length 25 [2024-11-08 10:23:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:42,785 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1203 transitions. [2024-11-08 10:23:42,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1203 transitions. [2024-11-08 10:23:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 10:23:42,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:42,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:23:42,788 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash -807485125, now seen corresponding path program 1 times [2024-11-08 10:23:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564981743] [2024-11-08 10:23:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564981743] [2024-11-08 10:23:42,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564981743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703219410] [2024-11-08 10:23:42,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,837 INFO L87 Difference]: Start difference. First operand 693 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,866 INFO L93 Difference]: Finished difference Result 1289 states and 2269 transitions. [2024-11-08 10:23:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-08 10:23:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,872 INFO L225 Difference]: With dead ends: 1289 [2024-11-08 10:23:42,872 INFO L226 Difference]: Without dead ends: 1287 [2024-11-08 10:23:42,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,874 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 56 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 167 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-11-08 10:23:42,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-08 10:23:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 965. [2024-11-08 10:23:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1643 transitions. [2024-11-08 10:23:42,907 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1643 transitions. Word has length 25 [2024-11-08 10:23:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:42,907 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1643 transitions. [2024-11-08 10:23:42,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1643 transitions. [2024-11-08 10:23:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 10:23:42,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:42,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:42,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:23:42,910 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:42,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1899134269, now seen corresponding path program 1 times [2024-11-08 10:23:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:42,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662072316] [2024-11-08 10:23:42,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:42,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662072316] [2024-11-08 10:23:42,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662072316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:42,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:42,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:42,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578317620] [2024-11-08 10:23:42,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:42,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:42,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:42,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:42,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,949 INFO L87 Difference]: Start difference. First operand 965 states and 1643 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,985 INFO L93 Difference]: Finished difference Result 2297 states and 3933 transitions. [2024-11-08 10:23:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-08 10:23:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,991 INFO L225 Difference]: With dead ends: 2297 [2024-11-08 10:23:42,991 INFO L226 Difference]: Without dead ends: 1351 [2024-11-08 10:23:42,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,993 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:42,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 203 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-08 10:23:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2024-11-08 10:23:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2291 transitions. [2024-11-08 10:23:43,031 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2291 transitions. Word has length 25 [2024-11-08 10:23:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:43,032 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 2291 transitions. [2024-11-08 10:23:43,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2291 transitions. [2024-11-08 10:23:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 10:23:43,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:43,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:43,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:23:43,034 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 737978317, now seen corresponding path program 1 times [2024-11-08 10:23:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:43,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876992559] [2024-11-08 10:23:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:43,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:43,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876992559] [2024-11-08 10:23:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876992559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:43,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:43,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426038729] [2024-11-08 10:23:43,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:43,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:43,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:43,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,066 INFO L87 Difference]: Start difference. First operand 1349 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:43,096 INFO L93 Difference]: Finished difference Result 2025 states and 3429 transitions. [2024-11-08 10:23:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-08 10:23:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:43,102 INFO L225 Difference]: With dead ends: 2025 [2024-11-08 10:23:43,102 INFO L226 Difference]: Without dead ends: 1367 [2024-11-08 10:23:43,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,104 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:43,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-08 10:23:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2024-11-08 10:23:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2291 transitions. [2024-11-08 10:23:43,142 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2291 transitions. Word has length 26 [2024-11-08 10:23:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:43,142 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2291 transitions. [2024-11-08 10:23:43,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2291 transitions. [2024-11-08 10:23:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 10:23:43,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:43,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:43,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:23:43,145 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:43,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1256166389, now seen corresponding path program 1 times [2024-11-08 10:23:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101469780] [2024-11-08 10:23:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:43,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101469780] [2024-11-08 10:23:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101469780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:43,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087056712] [2024-11-08 10:23:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:43,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:43,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,192 INFO L87 Difference]: Start difference. First operand 1365 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:43,249 INFO L93 Difference]: Finished difference Result 2505 states and 4277 transitions. [2024-11-08 10:23:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:43,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-08 10:23:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:43,257 INFO L225 Difference]: With dead ends: 2505 [2024-11-08 10:23:43,257 INFO L226 Difference]: Without dead ends: 2503 [2024-11-08 10:23:43,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,259 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 165 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-11-08 10:23:43,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-11-08 10:23:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1925. [2024-11-08 10:23:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3155 transitions. [2024-11-08 10:23:43,306 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3155 transitions. Word has length 26 [2024-11-08 10:23:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:43,307 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 3155 transitions. [2024-11-08 10:23:43,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3155 transitions. [2024-11-08 10:23:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 10:23:43,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:43,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:43,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:23:43,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:43,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:43,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1450453005, now seen corresponding path program 1 times [2024-11-08 10:23:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:43,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333715944] [2024-11-08 10:23:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:43,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:43,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:43,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333715944] [2024-11-08 10:23:43,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333715944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:43,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:43,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339052711] [2024-11-08 10:23:43,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:43,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:43,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:43,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,338 INFO L87 Difference]: Start difference. First operand 1925 states and 3155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:43,391 INFO L93 Difference]: Finished difference Result 4553 states and 7509 transitions. [2024-11-08 10:23:43,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:43,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-08 10:23:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:43,400 INFO L225 Difference]: With dead ends: 4553 [2024-11-08 10:23:43,400 INFO L226 Difference]: Without dead ends: 2663 [2024-11-08 10:23:43,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,405 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:43,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-11-08 10:23:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2661. [2024-11-08 10:23:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4355 transitions. [2024-11-08 10:23:43,477 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4355 transitions. Word has length 26 [2024-11-08 10:23:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:43,478 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 4355 transitions. [2024-11-08 10:23:43,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4355 transitions. [2024-11-08 10:23:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 10:23:43,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:43,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:43,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 10:23:43,481 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:43,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash -286238638, now seen corresponding path program 1 times [2024-11-08 10:23:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:43,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351211276] [2024-11-08 10:23:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:43,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351211276] [2024-11-08 10:23:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351211276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:43,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:43,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866704771] [2024-11-08 10:23:43,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:43,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:43,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:43,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,518 INFO L87 Difference]: Start difference. First operand 2661 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:43,598 INFO L93 Difference]: Finished difference Result 3993 states and 6517 transitions. [2024-11-08 10:23:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:43,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-08 10:23:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:43,606 INFO L225 Difference]: With dead ends: 3993 [2024-11-08 10:23:43,607 INFO L226 Difference]: Without dead ends: 2695 [2024-11-08 10:23:43,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,609 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:43,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2024-11-08 10:23:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2693. [2024-11-08 10:23:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4355 transitions. [2024-11-08 10:23:43,677 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4355 transitions. Word has length 27 [2024-11-08 10:23:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:43,677 INFO L471 AbstractCegarLoop]: Abstraction has 2693 states and 4355 transitions. [2024-11-08 10:23:43,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4355 transitions. [2024-11-08 10:23:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 10:23:43,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:43,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:43,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 10:23:43,680 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:43,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2014583952, now seen corresponding path program 1 times [2024-11-08 10:23:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:43,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384103769] [2024-11-08 10:23:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:43,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384103769] [2024-11-08 10:23:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384103769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:43,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:43,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:43,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674693587] [2024-11-08 10:23:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:43,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,703 INFO L87 Difference]: Start difference. First operand 2693 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:43,773 INFO L93 Difference]: Finished difference Result 4873 states and 8037 transitions. [2024-11-08 10:23:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-08 10:23:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:43,789 INFO L225 Difference]: With dead ends: 4873 [2024-11-08 10:23:43,789 INFO L226 Difference]: Without dead ends: 4871 [2024-11-08 10:23:43,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,792 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 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-11-08 10:23:43,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2024-11-08 10:23:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3845. [2024-11-08 10:23:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6051 transitions. [2024-11-08 10:23:43,907 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6051 transitions. Word has length 27 [2024-11-08 10:23:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:43,907 INFO L471 AbstractCegarLoop]: Abstraction has 3845 states and 6051 transitions. [2024-11-08 10:23:43,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6051 transitions. [2024-11-08 10:23:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 10:23:43,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:43,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:43,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 10:23:43,912 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:43,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash 426236050, now seen corresponding path program 1 times [2024-11-08 10:23:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:43,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074484837] [2024-11-08 10:23:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:43,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:43,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:43,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074484837] [2024-11-08 10:23:43,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074484837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:43,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:43,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:43,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606987446] [2024-11-08 10:23:43,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:43,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:43,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,937 INFO L87 Difference]: Start difference. First operand 3845 states and 6051 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:44,035 INFO L93 Difference]: Finished difference Result 9033 states and 14309 transitions. [2024-11-08 10:23:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-08 10:23:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:44,052 INFO L225 Difference]: With dead ends: 9033 [2024-11-08 10:23:44,053 INFO L226 Difference]: Without dead ends: 5255 [2024-11-08 10:23:44,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:44,058 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:44,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2024-11-08 10:23:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 5253. [2024-11-08 10:23:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5253 states to 5253 states and 8259 transitions. [2024-11-08 10:23:44,280 INFO L78 Accepts]: Start accepts. Automaton has 5253 states and 8259 transitions. Word has length 27 [2024-11-08 10:23:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:44,281 INFO L471 AbstractCegarLoop]: Abstraction has 5253 states and 8259 transitions. [2024-11-08 10:23:44,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5253 states and 8259 transitions. [2024-11-08 10:23:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 10:23:44,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:44,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:44,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 10:23:44,289 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:44,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1972192830, now seen corresponding path program 1 times [2024-11-08 10:23:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428945406] [2024-11-08 10:23:44,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:44,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428945406] [2024-11-08 10:23:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428945406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:44,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:44,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245133624] [2024-11-08 10:23:44,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:44,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:44,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:44,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:44,326 INFO L87 Difference]: Start difference. First operand 5253 states and 8259 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:44,427 INFO L93 Difference]: Finished difference Result 7881 states and 12357 transitions. [2024-11-08 10:23:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:44,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-08 10:23:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:44,443 INFO L225 Difference]: With dead ends: 7881 [2024-11-08 10:23:44,445 INFO L226 Difference]: Without dead ends: 5319 [2024-11-08 10:23:44,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:44,450 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:44,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2024-11-08 10:23:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5317. [2024-11-08 10:23:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 8259 transitions. [2024-11-08 10:23:44,626 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 8259 transitions. Word has length 28 [2024-11-08 10:23:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:44,626 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 8259 transitions. [2024-11-08 10:23:44,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 8259 transitions. [2024-11-08 10:23:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 10:23:44,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:44,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:44,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 10:23:44,631 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:44,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash 328629760, now seen corresponding path program 1 times [2024-11-08 10:23:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:44,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910064286] [2024-11-08 10:23:44,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:44,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:44,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910064286] [2024-11-08 10:23:44,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910064286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:44,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:44,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:44,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953619071] [2024-11-08 10:23:44,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:44,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:44,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:44,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:44,664 INFO L87 Difference]: Start difference. First operand 5317 states and 8259 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:44,806 INFO L93 Difference]: Finished difference Result 9481 states and 15045 transitions. [2024-11-08 10:23:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:44,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-08 10:23:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:44,824 INFO L225 Difference]: With dead ends: 9481 [2024-11-08 10:23:44,824 INFO L226 Difference]: Without dead ends: 9479 [2024-11-08 10:23:44,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-11-08 10:23:44,829 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 161 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-11-08 10:23:44,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2024-11-08 10:23:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 7685. [2024-11-08 10:23:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 11587 transitions. [2024-11-08 10:23:45,065 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 11587 transitions. Word has length 28 [2024-11-08 10:23:45,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:45,065 INFO L471 AbstractCegarLoop]: Abstraction has 7685 states and 11587 transitions. [2024-11-08 10:23:45,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 11587 transitions. [2024-11-08 10:23:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 10:23:45,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:45,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:45,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 10:23:45,074 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:45,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1259718142, now seen corresponding path program 1 times [2024-11-08 10:23:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:45,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42973134] [2024-11-08 10:23:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:45,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:45,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:45,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42973134] [2024-11-08 10:23:45,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42973134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:45,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:45,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:45,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143416716] [2024-11-08 10:23:45,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:45,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:45,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:45,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:45,106 INFO L87 Difference]: Start difference. First operand 7685 states and 11587 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:45,321 INFO L93 Difference]: Finished difference Result 17929 states and 27205 transitions. [2024-11-08 10:23:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-08 10:23:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:45,338 INFO L225 Difference]: With dead ends: 17929 [2024-11-08 10:23:45,339 INFO L226 Difference]: Without dead ends: 10375 [2024-11-08 10:23:45,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:45,348 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:45,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10375 states. [2024-11-08 10:23:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10375 to 10373. [2024-11-08 10:23:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10373 states to 10373 states and 15619 transitions. [2024-11-08 10:23:45,698 INFO L78 Accepts]: Start accepts. Automaton has 10373 states and 15619 transitions. Word has length 28 [2024-11-08 10:23:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:45,698 INFO L471 AbstractCegarLoop]: Abstraction has 10373 states and 15619 transitions. [2024-11-08 10:23:45,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 10373 states and 15619 transitions. [2024-11-08 10:23:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 10:23:45,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:45,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:45,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 10:23:45,708 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:45,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1597802407, now seen corresponding path program 1 times [2024-11-08 10:23:45,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:45,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335879844] [2024-11-08 10:23:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:45,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:45,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335879844] [2024-11-08 10:23:45,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335879844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:45,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:45,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:45,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664937683] [2024-11-08 10:23:45,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:45,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:45,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:45,746 INFO L87 Difference]: Start difference. First operand 10373 states and 15619 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:45,953 INFO L93 Difference]: Finished difference Result 15561 states and 23365 transitions. [2024-11-08 10:23:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:45,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-08 10:23:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:45,972 INFO L225 Difference]: With dead ends: 15561 [2024-11-08 10:23:45,972 INFO L226 Difference]: Without dead ends: 10503 [2024-11-08 10:23:45,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:45,982 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:45,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10503 states. [2024-11-08 10:23:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10503 to 10501. [2024-11-08 10:23:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 15619 transitions. [2024-11-08 10:23:46,319 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 15619 transitions. Word has length 29 [2024-11-08 10:23:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:46,319 INFO L471 AbstractCegarLoop]: Abstraction has 10501 states and 15619 transitions. [2024-11-08 10:23:46,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 15619 transitions. [2024-11-08 10:23:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 10:23:46,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:46,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:46,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 10:23:46,328 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:46,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:46,329 INFO L85 PathProgramCache]: Analyzing trace with hash -396342299, now seen corresponding path program 1 times [2024-11-08 10:23:46,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:46,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131118967] [2024-11-08 10:23:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:46,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:46,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:46,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131118967] [2024-11-08 10:23:46,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131118967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:46,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:46,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269544853] [2024-11-08 10:23:46,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:46,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:46,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:46,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:46,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:46,359 INFO L87 Difference]: Start difference. First operand 10501 states and 15619 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:46,672 INFO L93 Difference]: Finished difference Result 18441 states and 28037 transitions. [2024-11-08 10:23:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:46,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-08 10:23:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:46,704 INFO L225 Difference]: With dead ends: 18441 [2024-11-08 10:23:46,705 INFO L226 Difference]: Without dead ends: 18439 [2024-11-08 10:23:46,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-11-08 10:23:46,711 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 159 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-11-08 10:23:46,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:46,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2024-11-08 10:23:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 15365. [2024-11-08 10:23:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15365 states, 15364 states have (on average 1.4414865920333246) internal successors, (22147), 15364 states have internal predecessors, (22147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 22147 transitions. [2024-11-08 10:23:47,076 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 22147 transitions. Word has length 29 [2024-11-08 10:23:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:47,076 INFO L471 AbstractCegarLoop]: Abstraction has 15365 states and 22147 transitions. [2024-11-08 10:23:47,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 22147 transitions. [2024-11-08 10:23:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 10:23:47,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:47,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:47,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 10:23:47,091 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:47,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1984690201, now seen corresponding path program 1 times [2024-11-08 10:23:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:47,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196963538] [2024-11-08 10:23:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:47,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:47,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196963538] [2024-11-08 10:23:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196963538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:47,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:47,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:47,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961468225] [2024-11-08 10:23:47,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:47,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:47,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:47,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:47,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:47,122 INFO L87 Difference]: Start difference. First operand 15365 states and 22147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:47,461 INFO L93 Difference]: Finished difference Result 35593 states and 51589 transitions. [2024-11-08 10:23:47,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:47,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-08 10:23:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:47,497 INFO L225 Difference]: With dead ends: 35593 [2024-11-08 10:23:47,498 INFO L226 Difference]: Without dead ends: 20487 [2024-11-08 10:23:47,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:47,517 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:47,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 207 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2024-11-08 10:23:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20485. [2024-11-08 10:23:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20485 states, 20484 states have (on average 1.4373657488771725) internal successors, (29443), 20484 states have internal predecessors, (29443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 29443 transitions. [2024-11-08 10:23:48,126 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 29443 transitions. Word has length 29 [2024-11-08 10:23:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:48,127 INFO L471 AbstractCegarLoop]: Abstraction has 20485 states and 29443 transitions. [2024-11-08 10:23:48,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 29443 transitions. [2024-11-08 10:23:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:23:48,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:48,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:48,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 10:23:48,147 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:48,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash 598505399, now seen corresponding path program 1 times [2024-11-08 10:23:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212750086] [2024-11-08 10:23:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:48,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:48,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212750086] [2024-11-08 10:23:48,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212750086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:48,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:48,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:48,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511186857] [2024-11-08 10:23:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:48,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:48,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:48,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:48,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:48,188 INFO L87 Difference]: Start difference. First operand 20485 states and 29443 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:48,561 INFO L93 Difference]: Finished difference Result 30729 states and 44037 transitions. [2024-11-08 10:23:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:48,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-08 10:23:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:48,598 INFO L225 Difference]: With dead ends: 30729 [2024-11-08 10:23:48,598 INFO L226 Difference]: Without dead ends: 20743 [2024-11-08 10:23:48,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:48,612 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:48,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20743 states. [2024-11-08 10:23:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20743 to 20741. [2024-11-08 10:23:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20741 states, 20740 states have (on average 1.4196239151398264) internal successors, (29443), 20740 states have internal predecessors, (29443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20741 states to 20741 states and 29443 transitions. [2024-11-08 10:23:49,019 INFO L78 Accepts]: Start accepts. Automaton has 20741 states and 29443 transitions. Word has length 30 [2024-11-08 10:23:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:49,019 INFO L471 AbstractCegarLoop]: Abstraction has 20741 states and 29443 transitions. [2024-11-08 10:23:49,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 20741 states and 29443 transitions. [2024-11-08 10:23:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:23:49,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:49,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:49,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 10:23:49,035 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:49,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1395639307, now seen corresponding path program 1 times [2024-11-08 10:23:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686730807] [2024-11-08 10:23:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686730807] [2024-11-08 10:23:49,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686730807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:49,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:49,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614624427] [2024-11-08 10:23:49,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:49,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:49,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:49,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:49,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:49,063 INFO L87 Difference]: Start difference. First operand 20741 states and 29443 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:49,505 INFO L93 Difference]: Finished difference Result 35849 states and 51973 transitions. [2024-11-08 10:23:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:49,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-08 10:23:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:49,555 INFO L225 Difference]: With dead ends: 35849 [2024-11-08 10:23:49,556 INFO L226 Difference]: Without dead ends: 35847 [2024-11-08 10:23:49,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:49,564 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 157 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-11-08 10:23:49,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35847 states. [2024-11-08 10:23:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35847 to 30725. [2024-11-08 10:23:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30725 states, 30724 states have (on average 1.3749186303866685) internal successors, (42243), 30724 states have internal predecessors, (42243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30725 states to 30725 states and 42243 transitions. [2024-11-08 10:23:50,108 INFO L78 Accepts]: Start accepts. Automaton has 30725 states and 42243 transitions. Word has length 30 [2024-11-08 10:23:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 30725 states and 42243 transitions. [2024-11-08 10:23:50,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 30725 states and 42243 transitions. [2024-11-08 10:23:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:23:50,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:50,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 10:23:50,240 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1310980087, now seen corresponding path program 1 times [2024-11-08 10:23:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:50,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893015721] [2024-11-08 10:23:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:50,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:50,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893015721] [2024-11-08 10:23:50,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893015721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:50,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:50,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:50,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890391073] [2024-11-08 10:23:50,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:50,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:50,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:50,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:50,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:50,273 INFO L87 Difference]: Start difference. First operand 30725 states and 42243 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:50,636 INFO L93 Difference]: Finished difference Result 70665 states and 97541 transitions. [2024-11-08 10:23:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:50,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-08 10:23:50,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:50,698 INFO L225 Difference]: With dead ends: 70665 [2024-11-08 10:23:50,698 INFO L226 Difference]: Without dead ends: 40455 [2024-11-08 10:23:50,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:50,735 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:50,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40455 states. [2024-11-08 10:23:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40455 to 40453. [2024-11-08 10:23:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40453 states, 40452 states have (on average 1.367027588252744) internal successors, (55299), 40452 states have internal predecessors, (55299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40453 states to 40453 states and 55299 transitions. [2024-11-08 10:23:51,765 INFO L78 Accepts]: Start accepts. Automaton has 40453 states and 55299 transitions. Word has length 30 [2024-11-08 10:23:51,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:51,766 INFO L471 AbstractCegarLoop]: Abstraction has 40453 states and 55299 transitions. [2024-11-08 10:23:51,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 40453 states and 55299 transitions. [2024-11-08 10:23:51,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 10:23:51,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:51,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:51,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 10:23:51,793 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:51,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash -314930436, now seen corresponding path program 1 times [2024-11-08 10:23:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419186079] [2024-11-08 10:23:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:51,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:51,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419186079] [2024-11-08 10:23:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419186079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:51,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754180681] [2024-11-08 10:23:51,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:51,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:51,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:51,817 INFO L87 Difference]: Start difference. First operand 40453 states and 55299 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:52,365 INFO L93 Difference]: Finished difference Result 60681 states and 82693 transitions. [2024-11-08 10:23:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-08 10:23:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:52,425 INFO L225 Difference]: With dead ends: 60681 [2024-11-08 10:23:52,426 INFO L226 Difference]: Without dead ends: 40967 [2024-11-08 10:23:52,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:52,454 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:52,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40967 states. [2024-11-08 10:23:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40967 to 40965. [2024-11-08 10:23:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40965 states, 40964 states have (on average 1.3499414119714872) internal successors, (55299), 40964 states have internal predecessors, (55299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40965 states to 40965 states and 55299 transitions. [2024-11-08 10:23:53,331 INFO L78 Accepts]: Start accepts. Automaton has 40965 states and 55299 transitions. Word has length 31 [2024-11-08 10:23:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:53,331 INFO L471 AbstractCegarLoop]: Abstraction has 40965 states and 55299 transitions. [2024-11-08 10:23:53,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 40965 states and 55299 transitions. [2024-11-08 10:23:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 10:23:53,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:53,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:53,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 10:23:53,350 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:53,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:53,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1985892154, now seen corresponding path program 1 times [2024-11-08 10:23:53,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:53,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310527610] [2024-11-08 10:23:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:53,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:53,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310527610] [2024-11-08 10:23:53,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310527610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:53,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:53,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033278906] [2024-11-08 10:23:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:53,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:53,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:53,370 INFO L87 Difference]: Start difference. First operand 40965 states and 55299 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:54,074 INFO L93 Difference]: Finished difference Result 119817 states and 159749 transitions. [2024-11-08 10:23:54,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:54,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-08 10:23:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:54,179 INFO L225 Difference]: With dead ends: 119817 [2024-11-08 10:23:54,179 INFO L226 Difference]: Without dead ends: 79879 [2024-11-08 10:23:54,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:54,219 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:54,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2024-11-08 10:23:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 79877. [2024-11-08 10:23:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79877 states, 79876 states have (on average 1.3076643797886724) internal successors, (104451), 79876 states have internal predecessors, (104451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79877 states to 79877 states and 104451 transitions. [2024-11-08 10:23:56,153 INFO L78 Accepts]: Start accepts. Automaton has 79877 states and 104451 transitions. Word has length 31 [2024-11-08 10:23:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:56,153 INFO L471 AbstractCegarLoop]: Abstraction has 79877 states and 104451 transitions. [2024-11-08 10:23:56,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 79877 states and 104451 transitions. [2024-11-08 10:23:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 10:23:56,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:56,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:56,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 10:23:56,198 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:56,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash -720727240, now seen corresponding path program 1 times [2024-11-08 10:23:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395354224] [2024-11-08 10:23:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395354224] [2024-11-08 10:23:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395354224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:56,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394440295] [2024-11-08 10:23:56,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:56,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:56,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:56,222 INFO L87 Difference]: Start difference. First operand 79877 states and 104451 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:57,480 INFO L93 Difference]: Finished difference Result 88073 states and 118789 transitions. [2024-11-08 10:23:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:57,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-08 10:23:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:57,569 INFO L225 Difference]: With dead ends: 88073 [2024-11-08 10:23:57,569 INFO L226 Difference]: Without dead ends: 88071 [2024-11-08 10:23:57,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:57,586 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 38 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:57,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 202 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88071 states. [2024-11-08 10:23:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88071 to 79877. [2024-11-08 10:23:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79877 states, 79876 states have (on average 1.2948445089889329) internal successors, (103427), 79876 states have internal predecessors, (103427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79877 states to 79877 states and 103427 transitions. [2024-11-08 10:23:59,135 INFO L78 Accepts]: Start accepts. Automaton has 79877 states and 103427 transitions. Word has length 31 [2024-11-08 10:23:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:59,135 INFO L471 AbstractCegarLoop]: Abstraction has 79877 states and 103427 transitions. [2024-11-08 10:23:59,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 79877 states and 103427 transitions. [2024-11-08 10:23:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 10:23:59,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:59,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:59,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 10:23:59,174 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:59,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1433330092, now seen corresponding path program 1 times [2024-11-08 10:23:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:59,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798198914] [2024-11-08 10:23:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:59,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:59,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798198914] [2024-11-08 10:23:59,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798198914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:59,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:59,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:59,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062974938] [2024-11-08 10:23:59,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:59,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:59,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:59,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:59,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:59,201 INFO L87 Difference]: Start difference. First operand 79877 states and 103427 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:24:00,833 INFO L93 Difference]: Finished difference Result 134153 states and 176133 transitions. [2024-11-08 10:24:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:24:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-08 10:24:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:24:00,968 INFO L225 Difference]: With dead ends: 134153 [2024-11-08 10:24:00,968 INFO L226 Difference]: Without dead ends: 134151 [2024-11-08 10:24:00,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:24:00,990 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 35 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 153 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-11-08 10:24:00,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:24:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134151 states. [2024-11-08 10:24:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134151 to 121861. [2024-11-08 10:24:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121861 states, 121860 states have (on average 1.2604874446085672) internal successors, (153603), 121860 states have internal predecessors, (153603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121861 states to 121861 states and 153603 transitions. [2024-11-08 10:24:03,191 INFO L78 Accepts]: Start accepts. Automaton has 121861 states and 153603 transitions. Word has length 32 [2024-11-08 10:24:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:24:03,191 INFO L471 AbstractCegarLoop]: Abstraction has 121861 states and 153603 transitions. [2024-11-08 10:24:03,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:03,192 INFO L276 IsEmpty]: Start isEmpty. Operand 121861 states and 153603 transitions. [2024-11-08 10:24:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 10:24:03,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:24:03,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:24:03,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 10:24:03,239 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:24:03,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:24:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash -155017810, now seen corresponding path program 1 times [2024-11-08 10:24:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:24:03,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119298420] [2024-11-08 10:24:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:24:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:24:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:24:03,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:24:03,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:24:03,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119298420] [2024-11-08 10:24:03,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119298420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:24:03,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:24:03,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:24:03,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534336134] [2024-11-08 10:24:03,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:24:03,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:24:03,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:24:03,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:24:03,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:24:03,261 INFO L87 Difference]: Start difference. First operand 121861 states and 153603 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:24:05,616 INFO L93 Difference]: Finished difference Result 277513 states and 350213 transitions. [2024-11-08 10:24:05,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:24:05,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-08 10:24:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:24:05,822 INFO L225 Difference]: With dead ends: 277513 [2024-11-08 10:24:05,822 INFO L226 Difference]: Without dead ends: 156679 [2024-11-08 10:24:06,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:24:06,191 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:24:06,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:24:06,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156679 states. [2024-11-08 10:24:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156679 to 156677. [2024-11-08 10:24:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156677 states, 156676 states have (on average 1.2418175087441599) internal successors, (194563), 156676 states have internal predecessors, (194563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156677 states to 156677 states and 194563 transitions. [2024-11-08 10:24:09,637 INFO L78 Accepts]: Start accepts. Automaton has 156677 states and 194563 transitions. Word has length 32 [2024-11-08 10:24:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:24:09,637 INFO L471 AbstractCegarLoop]: Abstraction has 156677 states and 194563 transitions. [2024-11-08 10:24:09,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 156677 states and 194563 transitions. [2024-11-08 10:24:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 10:24:09,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:24:09,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:24:09,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 10:24:09,719 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:24:09,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:24:09,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1483775695, now seen corresponding path program 1 times [2024-11-08 10:24:09,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:24:09,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995753326] [2024-11-08 10:24:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:24:09,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:24:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:24:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:24:09,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:24:09,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995753326] [2024-11-08 10:24:09,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995753326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:24:09,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:24:09,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:24:09,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544790828] [2024-11-08 10:24:09,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:24:09,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:24:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:24:09,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:24:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:24:09,740 INFO L87 Difference]: Start difference. First operand 156677 states and 194563 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:24:11,582 INFO L93 Difference]: Finished difference Result 236553 states and 293893 transitions. [2024-11-08 10:24:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:24:11,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-08 10:24:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:24:11,818 INFO L225 Difference]: With dead ends: 236553 [2024-11-08 10:24:11,818 INFO L226 Difference]: Without dead ends: 159751 [2024-11-08 10:24:11,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:24:11,883 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:24:11,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:24:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159751 states. [2024-11-08 10:24:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159751 to 159749. [2024-11-08 10:24:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159749 states, 159748 states have (on average 1.2307571925783107) internal successors, (196611), 159748 states have internal predecessors, (196611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159749 states to 159749 states and 196611 transitions. [2024-11-08 10:24:15,254 INFO L78 Accepts]: Start accepts. Automaton has 159749 states and 196611 transitions. Word has length 33 [2024-11-08 10:24:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:24:15,254 INFO L471 AbstractCegarLoop]: Abstraction has 159749 states and 196611 transitions. [2024-11-08 10:24:15,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 159749 states and 196611 transitions. [2024-11-08 10:24:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 10:24:15,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:24:15,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:24:15,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 10:24:15,314 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:24:15,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:24:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash -510369011, now seen corresponding path program 1 times [2024-11-08 10:24:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:24:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908790416] [2024-11-08 10:24:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:24:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:24:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:24:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:24:15,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:24:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908790416] [2024-11-08 10:24:15,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908790416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:24:15,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:24:15,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:24:15,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615158559] [2024-11-08 10:24:15,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:24:15,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:24:15,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:24:15,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:24:15,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:24:15,338 INFO L87 Difference]: Start difference. First operand 159749 states and 196611 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:24:18,454 INFO L93 Difference]: Finished difference Result 262153 states and 323589 transitions. [2024-11-08 10:24:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:24:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-08 10:24:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:24:18,771 INFO L225 Difference]: With dead ends: 262153 [2024-11-08 10:24:18,771 INFO L226 Difference]: Without dead ends: 262151 [2024-11-08 10:24:18,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:24:18,814 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 151 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-11-08 10:24:18,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:24:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262151 states. [2024-11-08 10:24:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262151 to 245765. [2024-11-08 10:24:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245765 states, 245764 states have (on average 1.1999926759004573) internal successors, (294915), 245764 states have internal predecessors, (294915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245765 states to 245765 states and 294915 transitions. [2024-11-08 10:24:23,466 INFO L78 Accepts]: Start accepts. Automaton has 245765 states and 294915 transitions. Word has length 33 [2024-11-08 10:24:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:24:23,467 INFO L471 AbstractCegarLoop]: Abstraction has 245765 states and 294915 transitions. [2024-11-08 10:24:23,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:24:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 245765 states and 294915 transitions. [2024-11-08 10:24:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 10:24:23,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:24:23,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:24:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 10:24:23,642 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:24:23,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:24:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2098716913, now seen corresponding path program 1 times [2024-11-08 10:24:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:24:23,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821019085] [2024-11-08 10:24:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:24:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:24:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:24:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:24:23,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:24:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821019085] [2024-11-08 10:24:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821019085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:24:23,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:24:23,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:24:23,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140619936] [2024-11-08 10:24:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:24:23,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:24:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:24:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:24:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:24:23,661 INFO L87 Difference]: Start difference. First operand 245765 states and 294915 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)