./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:33:13,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:33:13,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:33:13,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:33:13,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:33:13,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:33:13,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:33:13,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:33:13,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:33:13,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:33:13,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:33:13,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:33:13,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:33:13,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:33:13,241 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:33:13,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:33:13,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:33:13,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:33:13,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:33:13,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:33:13,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:33:13,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:33:13,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:33:13,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:33:13,249 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:33:13,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:33:13,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:33:13,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:33:13,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:33:13,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:33:13,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:33:13,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:33:13,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:33:13,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:33:13,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:33:13,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:33:13,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:33:13,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:33:13,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:33:13,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:33:13,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:33:13,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:33:13,255 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2024-11-09 18:33:13,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:33:13,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:33:13,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:33:13,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:33:13,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:33:13,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2024-11-09 18:33:15,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:33:15,193 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:33:15,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2024-11-09 18:33:15,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2fac7e0/880a3f47e514414da33b96b16b0e3052/FLAG182443081 [2024-11-09 18:33:15,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2fac7e0/880a3f47e514414da33b96b16b0e3052 [2024-11-09 18:33:15,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:33:15,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:33:15,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:33:15,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:33:15,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:33:15,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8e2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15, skipping insertion in model container [2024-11-09 18:33:15,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:33:15,489 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_12.c[4591,4604] [2024-11-09 18:33:15,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:33:15,505 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:33:15,539 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_12.c[4591,4604] [2024-11-09 18:33:15,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:33:15,561 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:33:15,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15 WrapperNode [2024-11-09 18:33:15,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:33:15,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:33:15,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:33:15,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:33:15,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,605 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 171 [2024-11-09 18:33:15,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:33:15,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:33:15,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:33:15,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:33:15,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,647 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-09 18:33:15,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:33:15,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:33:15,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:33:15,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:33:15,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (1/1) ... [2024-11-09 18:33:15,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:33:15,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:33:15,710 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-09 18:33:15,713 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-09 18:33:15,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:33:15,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:33:15,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:33:15,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:33:15,827 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:33:15,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:33:16,086 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-09 18:33:16,086 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:33:16,106 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:33:16,106 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:33:16,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:33:16 BoogieIcfgContainer [2024-11-09 18:33:16,108 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:33:16,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:33:16,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:33:16,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:33:16,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:33:15" (1/3) ... [2024-11-09 18:33:16,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b1279b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:16, skipping insertion in model container [2024-11-09 18:33:16,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:15" (2/3) ... [2024-11-09 18:33:16,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b1279b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:16, skipping insertion in model container [2024-11-09 18:33:16,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:33:16" (3/3) ... [2024-11-09 18:33:16,117 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2024-11-09 18:33:16,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:33:16,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:33:16,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:33:16,224 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;@51ef56c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:33:16,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:33:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 47 states have (on average 1.851063829787234) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-09 18:33:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 18:33:16,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,241 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-09 18:33:16,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash -890442999, now seen corresponding path program 1 times [2024-11-09 18:33:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905354603] [2024-11-09 18:33:16,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,517 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-09 18:33:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905354603] [2024-11-09 18:33:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905354603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404201572] [2024-11-09 18:33:16,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,550 INFO L87 Difference]: Start difference. First operand has 49 states, 47 states have (on average 1.851063829787234) internal successors, (87), 48 states have internal predecessors, (87), 0 states have call successors, (0), 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-09 18:33:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,602 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2024-11-09 18:33:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,605 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-09 18:33:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,615 INFO L225 Difference]: With dead ends: 99 [2024-11-09 18:33:16,616 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 18:33:16,619 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-09 18:33:16,624 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 167 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-09 18:33:16,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 167 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 18:33:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2024-11-09 18:33:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 56 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-09 18:33:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 104 transitions. [2024-11-09 18:33:16,660 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 104 transitions. Word has length 21 [2024-11-09 18:33:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,661 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 104 transitions. [2024-11-09 18:33:16,661 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-09 18:33:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 104 transitions. [2024-11-09 18:33:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 18:33:16,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,662 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-09 18:33:16,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:33:16,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1400977176, now seen corresponding path program 1 times [2024-11-09 18:33:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507459693] [2024-11-09 18:33:16,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,735 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-09 18:33:16,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507459693] [2024-11-09 18:33:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507459693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553472718] [2024-11-09 18:33:16,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,739 INFO L87 Difference]: Start difference. First operand 57 states and 104 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-09 18:33:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,770 INFO L93 Difference]: Finished difference Result 140 states and 255 transitions. [2024-11-09 18:33:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,772 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-09 18:33:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,774 INFO L225 Difference]: With dead ends: 140 [2024-11-09 18:33:16,774 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 18:33:16,776 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-09 18:33:16,778 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 60 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 176 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-09 18:33:16,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 18:33:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-09 18:33:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.8395061728395061) internal successors, (149), 81 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-09 18:33:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2024-11-09 18:33:16,793 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 21 [2024-11-09 18:33:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,793 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2024-11-09 18:33:16,794 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-09 18:33:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2024-11-09 18:33:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 18:33:16,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,797 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-09 18:33:16,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:33:16,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1833052726, now seen corresponding path program 1 times [2024-11-09 18:33:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101261336] [2024-11-09 18:33:16,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,902 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-09 18:33:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101261336] [2024-11-09 18:33:16,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101261336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693308397] [2024-11-09 18:33:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,912 INFO L87 Difference]: Start difference. First operand 82 states and 149 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-09 18:33:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,943 INFO L93 Difference]: Finished difference Result 130 states and 229 transitions. [2024-11-09 18:33:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,944 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-09 18:33:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,945 INFO L225 Difference]: With dead ends: 130 [2024-11-09 18:33:16,945 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 18:33:16,945 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-09 18:33:16,946 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 62 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 198 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-09 18:33:16,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 18:33:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-09 18:33:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.7882352941176471) internal successors, (152), 85 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-09 18:33:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2024-11-09 18:33:16,957 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 22 [2024-11-09 18:33:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,957 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2024-11-09 18:33:16,958 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-09 18:33:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2024-11-09 18:33:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 18:33:16,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,959 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-09 18:33:16,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:33:16,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash -479743029, now seen corresponding path program 1 times [2024-11-09 18:33:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142061589] [2024-11-09 18:33:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,033 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-09 18:33:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142061589] [2024-11-09 18:33:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142061589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764221128] [2024-11-09 18:33:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,037 INFO L87 Difference]: Start difference. First operand 86 states and 152 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-09 18:33:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,060 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2024-11-09 18:33:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,061 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-09 18:33:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,062 INFO L225 Difference]: With dead ends: 165 [2024-11-09 18:33:17,063 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 18:33:17,063 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-09 18:33:17,064 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 155 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-09 18:33:17,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 18:33:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 113. [2024-11-09 18:33:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.7946428571428572) internal successors, (201), 112 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-09 18:33:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 201 transitions. [2024-11-09 18:33:17,086 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 201 transitions. Word has length 22 [2024-11-09 18:33:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,086 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 201 transitions. [2024-11-09 18:33:17,086 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-09 18:33:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 201 transitions. [2024-11-09 18:33:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 18:33:17,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,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-09 18:33:17,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:33:17,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,090 INFO L85 PathProgramCache]: Analyzing trace with hash -990277206, now seen corresponding path program 1 times [2024-11-09 18:33:17,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272501711] [2024-11-09 18:33:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,152 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-09 18:33:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272501711] [2024-11-09 18:33:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272501711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145646556] [2024-11-09 18:33:17,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,156 INFO L87 Difference]: Start difference. First operand 113 states and 201 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-09 18:33:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,184 INFO L93 Difference]: Finished difference Result 271 states and 485 transitions. [2024-11-09 18:33:17,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,186 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-09 18:33:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,187 INFO L225 Difference]: With dead ends: 271 [2024-11-09 18:33:17,187 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 18:33:17,188 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-09 18:33:17,192 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 177 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-09 18:33:17,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 18:33:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2024-11-09 18:33:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.78125) internal successors, (285), 160 states have internal predecessors, (285), 0 states have call successors, (0), 0 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-09 18:33:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 285 transitions. [2024-11-09 18:33:17,209 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 285 transitions. Word has length 22 [2024-11-09 18:33:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,209 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 285 transitions. [2024-11-09 18:33:17,210 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-09 18:33:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 285 transitions. [2024-11-09 18:33:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 18:33:17,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,211 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-09 18:33:17,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:33:17,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1986262271, now seen corresponding path program 1 times [2024-11-09 18:33:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365856337] [2024-11-09 18:33:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,261 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-09 18:33:17,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365856337] [2024-11-09 18:33:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365856337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883291945] [2024-11-09 18:33:17,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,267 INFO L87 Difference]: Start difference. First operand 161 states and 285 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-09 18:33:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,284 INFO L93 Difference]: Finished difference Result 244 states and 428 transitions. [2024-11-09 18:33:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,286 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-09 18:33:17,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,290 INFO L225 Difference]: With dead ends: 244 [2024-11-09 18:33:17,290 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 18:33:17,290 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-09 18:33:17,293 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 194 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-09 18:33:17,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 194 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 18:33:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2024-11-09 18:33:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.7592592592592593) internal successors, (285), 162 states have internal predecessors, (285), 0 states have call successors, (0), 0 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-09 18:33:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 285 transitions. [2024-11-09 18:33:17,312 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 285 transitions. Word has length 23 [2024-11-09 18:33:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,313 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 285 transitions. [2024-11-09 18:33:17,315 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-09 18:33:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 285 transitions. [2024-11-09 18:33:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 18:33:17,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,317 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-09 18:33:17,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:33:17,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash -632952574, now seen corresponding path program 1 times [2024-11-09 18:33:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125707952] [2024-11-09 18:33:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,372 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-09 18:33:17,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125707952] [2024-11-09 18:33:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125707952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349577335] [2024-11-09 18:33:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,380 INFO L87 Difference]: Start difference. First operand 163 states and 285 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-09 18:33:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,394 INFO L93 Difference]: Finished difference Result 309 states and 545 transitions. [2024-11-09 18:33:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,395 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-09 18:33:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,396 INFO L225 Difference]: With dead ends: 309 [2024-11-09 18:33:17,396 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 18:33:17,397 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-09 18:33:17,397 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 54 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 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-09 18:33:17,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 18:33:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 219. [2024-11-09 18:33:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.7477064220183487) internal successors, (381), 218 states have internal predecessors, (381), 0 states have call successors, (0), 0 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-09 18:33:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 381 transitions. [2024-11-09 18:33:17,414 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 381 transitions. Word has length 23 [2024-11-09 18:33:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,414 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 381 transitions. [2024-11-09 18:33:17,414 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-09 18:33:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 381 transitions. [2024-11-09 18:33:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 18:33:17,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,416 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-09 18:33:17,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:33:17,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1143486751, now seen corresponding path program 1 times [2024-11-09 18:33:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662209496] [2024-11-09 18:33:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,458 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-09 18:33:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662209496] [2024-11-09 18:33:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662209496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016568565] [2024-11-09 18:33:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,460 INFO L87 Difference]: Start difference. First operand 219 states and 381 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-09 18:33:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,487 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2024-11-09 18:33:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,488 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-09 18:33:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,489 INFO L225 Difference]: With dead ends: 525 [2024-11-09 18:33:17,489 INFO L226 Difference]: Without dead ends: 314 [2024-11-09 18:33:17,490 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-09 18:33:17,491 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 178 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-09 18:33:17,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-09 18:33:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2024-11-09 18:33:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 1.732258064516129) internal successors, (537), 310 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-09 18:33:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 537 transitions. [2024-11-09 18:33:17,510 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 537 transitions. Word has length 23 [2024-11-09 18:33:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,511 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 537 transitions. [2024-11-09 18:33:17,511 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-09 18:33:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 537 transitions. [2024-11-09 18:33:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 18:33:17,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,515 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-09 18:33:17,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:33:17,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1854169699, now seen corresponding path program 1 times [2024-11-09 18:33:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605630222] [2024-11-09 18:33:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,553 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-09 18:33:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605630222] [2024-11-09 18:33:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605630222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540381482] [2024-11-09 18:33:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,555 INFO L87 Difference]: Start difference. First operand 311 states and 537 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-09 18:33:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,575 INFO L93 Difference]: Finished difference Result 469 states and 805 transitions. [2024-11-09 18:33:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,576 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-09 18:33:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,577 INFO L225 Difference]: With dead ends: 469 [2024-11-09 18:33:17,577 INFO L226 Difference]: Without dead ends: 318 [2024-11-09 18:33:17,578 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-09 18:33:17,578 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 190 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-09 18:33:17,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 190 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-09 18:33:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 315. [2024-11-09 18:33:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.7101910828025477) internal successors, (537), 314 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-09 18:33:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 537 transitions. [2024-11-09 18:33:17,591 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 537 transitions. Word has length 24 [2024-11-09 18:33:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,591 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 537 transitions. [2024-11-09 18:33:17,591 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-09 18:33:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 537 transitions. [2024-11-09 18:33:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 18:33:17,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,592 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-09 18:33:17,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:33:17,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1087487900, now seen corresponding path program 1 times [2024-11-09 18:33:17,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163388506] [2024-11-09 18:33:17,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,635 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-09 18:33:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163388506] [2024-11-09 18:33:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163388506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260083798] [2024-11-09 18:33:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,636 INFO L87 Difference]: Start difference. First operand 315 states and 537 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-09 18:33:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,653 INFO L93 Difference]: Finished difference Result 589 states and 1017 transitions. [2024-11-09 18:33:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,653 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-09 18:33:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,656 INFO L225 Difference]: With dead ends: 589 [2024-11-09 18:33:17,656 INFO L226 Difference]: Without dead ends: 586 [2024-11-09 18:33:17,656 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-09 18:33:17,656 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 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-09 18:33:17,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-09 18:33:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 431. [2024-11-09 18:33:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 1.686046511627907) internal successors, (725), 430 states have internal predecessors, (725), 0 states have call successors, (0), 0 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-09 18:33:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 725 transitions. [2024-11-09 18:33:17,670 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 725 transitions. Word has length 24 [2024-11-09 18:33:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,671 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 725 transitions. [2024-11-09 18:33:17,671 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-09 18:33:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 725 transitions. [2024-11-09 18:33:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 18:33:17,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,672 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-09 18:33:17,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 18:33:17,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1598022077, now seen corresponding path program 1 times [2024-11-09 18:33:17,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397521628] [2024-11-09 18:33:17,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:17,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397521628] [2024-11-09 18:33:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397521628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804785348] [2024-11-09 18:33:17,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,704 INFO L87 Difference]: Start difference. First operand 431 states and 725 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-09 18:33:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,730 INFO L93 Difference]: Finished difference Result 1029 states and 1737 transitions. [2024-11-09 18:33:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,731 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-09 18:33:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,734 INFO L225 Difference]: With dead ends: 1029 [2024-11-09 18:33:17,734 INFO L226 Difference]: Without dead ends: 610 [2024-11-09 18:33:17,735 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-09 18:33:17,735 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 179 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-09 18:33:17,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-09 18:33:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 607. [2024-11-09 18:33:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 1.6716171617161717) internal successors, (1013), 606 states have internal predecessors, (1013), 0 states have call successors, (0), 0 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-09 18:33:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1013 transitions. [2024-11-09 18:33:17,769 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1013 transitions. Word has length 24 [2024-11-09 18:33:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,769 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 1013 transitions. [2024-11-09 18:33:17,770 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-09 18:33:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1013 transitions. [2024-11-09 18:33:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 18:33:17,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,772 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-09 18:33:17,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 18:33:17,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash 648469754, now seen corresponding path program 1 times [2024-11-09 18:33:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953038136] [2024-11-09 18:33:17,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,808 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-09 18:33:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953038136] [2024-11-09 18:33:17,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953038136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093777135] [2024-11-09 18:33:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,811 INFO L87 Difference]: Start difference. First operand 607 states and 1013 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-09 18:33:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,830 INFO L93 Difference]: Finished difference Result 913 states and 1517 transitions. [2024-11-09 18:33:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,831 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-09 18:33:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,833 INFO L225 Difference]: With dead ends: 913 [2024-11-09 18:33:17,833 INFO L226 Difference]: Without dead ends: 618 [2024-11-09 18:33:17,833 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-09 18:33:17,834 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 186 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-09 18:33:17,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-09 18:33:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-09 18:33:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.6498371335504887) internal successors, (1013), 614 states have internal predecessors, (1013), 0 states have call successors, (0), 0 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-09 18:33:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1013 transitions. [2024-11-09 18:33:17,858 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1013 transitions. Word has length 25 [2024-11-09 18:33:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,859 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 1013 transitions. [2024-11-09 18:33:17,859 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-09 18:33:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1013 transitions. [2024-11-09 18:33:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 18:33:17,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,860 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-09 18:33:17,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 18:33:17,860 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2001779451, now seen corresponding path program 1 times [2024-11-09 18:33:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017623834] [2024-11-09 18:33:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,893 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-09 18:33:17,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017623834] [2024-11-09 18:33:17,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017623834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081352066] [2024-11-09 18:33:17,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,897 INFO L87 Difference]: Start difference. First operand 615 states and 1013 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-09 18:33:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,924 INFO L93 Difference]: Finished difference Result 1133 states and 1897 transitions. [2024-11-09 18:33:17,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,925 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-09 18:33:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,931 INFO L225 Difference]: With dead ends: 1133 [2024-11-09 18:33:17,931 INFO L226 Difference]: Without dead ends: 1130 [2024-11-09 18:33:17,931 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-09 18:33:17,934 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 48 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:17,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-09 18:33:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 855. [2024-11-09 18:33:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 1.617096018735363) internal successors, (1381), 854 states have internal predecessors, (1381), 0 states have call successors, (0), 0 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-09 18:33:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1381 transitions. [2024-11-09 18:33:17,961 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1381 transitions. Word has length 25 [2024-11-09 18:33:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1381 transitions. [2024-11-09 18:33:17,962 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-09 18:33:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1381 transitions. [2024-11-09 18:33:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 18:33:17,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,963 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-09 18:33:17,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 18:33:17,964 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1491245274, now seen corresponding path program 1 times [2024-11-09 18:33:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843406230] [2024-11-09 18:33:17,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,990 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-09 18:33:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843406230] [2024-11-09 18:33:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843406230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822251595] [2024-11-09 18:33:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,992 INFO L87 Difference]: Start difference. First operand 855 states and 1381 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-09 18:33:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:18,028 INFO L93 Difference]: Finished difference Result 2029 states and 3289 transitions. [2024-11-09 18:33:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:18,029 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-09 18:33:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:18,033 INFO L225 Difference]: With dead ends: 2029 [2024-11-09 18:33:18,033 INFO L226 Difference]: Without dead ends: 1194 [2024-11-09 18:33:18,034 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-09 18:33:18,035 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 180 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-09 18:33:18,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-09 18:33:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1191. [2024-11-09 18:33:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1190 states have (on average 1.604201680672269) internal successors, (1909), 1190 states have internal predecessors, (1909), 0 states have call successors, (0), 0 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-09 18:33:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1909 transitions. [2024-11-09 18:33:18,072 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1909 transitions. Word has length 25 [2024-11-09 18:33:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:18,072 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1909 transitions. [2024-11-09 18:33:18,072 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-09 18:33:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1909 transitions. [2024-11-09 18:33:18,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 18:33:18,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:18,075 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-09 18:33:18,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 18:33:18,075 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:18,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1926470396, now seen corresponding path program 1 times [2024-11-09 18:33:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804547481] [2024-11-09 18:33:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:18,099 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-09 18:33:18,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:18,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804547481] [2024-11-09 18:33:18,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804547481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:18,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:18,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644266093] [2024-11-09 18:33:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:18,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:18,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:18,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:18,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,101 INFO L87 Difference]: Start difference. First operand 1191 states and 1909 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-09 18:33:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:18,129 INFO L93 Difference]: Finished difference Result 1789 states and 2857 transitions. [2024-11-09 18:33:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:18,131 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-09 18:33:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:18,136 INFO L225 Difference]: With dead ends: 1789 [2024-11-09 18:33:18,136 INFO L226 Difference]: Without dead ends: 1210 [2024-11-09 18:33:18,138 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-09 18:33:18,139 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 182 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-09 18:33:18,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-09 18:33:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1207. [2024-11-09 18:33:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.5829187396351576) internal successors, (1909), 1206 states have internal predecessors, (1909), 0 states have call successors, (0), 0 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-09 18:33:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1909 transitions. [2024-11-09 18:33:18,175 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1909 transitions. Word has length 26 [2024-11-09 18:33:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:18,175 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1909 transitions. [2024-11-09 18:33:18,176 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-09 18:33:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1909 transitions. [2024-11-09 18:33:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 18:33:18,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:18,177 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-09 18:33:18,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 18:33:18,178 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:18,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1015187203, now seen corresponding path program 1 times [2024-11-09 18:33:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095040530] [2024-11-09 18:33:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:18,202 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-09 18:33:18,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:18,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095040530] [2024-11-09 18:33:18,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095040530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:18,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:18,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681414153] [2024-11-09 18:33:18,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:18,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:18,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:18,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:18,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,204 INFO L87 Difference]: Start difference. First operand 1207 states and 1909 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-09 18:33:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:18,247 INFO L93 Difference]: Finished difference Result 2189 states and 3529 transitions. [2024-11-09 18:33:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:18,247 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-09 18:33:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:18,255 INFO L225 Difference]: With dead ends: 2189 [2024-11-09 18:33:18,255 INFO L226 Difference]: Without dead ends: 2186 [2024-11-09 18:33:18,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,256 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 45 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 147 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-09 18:33:18,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2024-11-09 18:33:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 1703. [2024-11-09 18:33:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1702 states have (on average 1.5446533490011751) internal successors, (2629), 1702 states have internal predecessors, (2629), 0 states have call successors, (0), 0 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-09 18:33:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2629 transitions. [2024-11-09 18:33:18,322 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2629 transitions. Word has length 26 [2024-11-09 18:33:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:18,322 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2629 transitions. [2024-11-09 18:33:18,323 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-09 18:33:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2629 transitions. [2024-11-09 18:33:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 18:33:18,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:18,325 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-09 18:33:18,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 18:33:18,325 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:18,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1525721380, now seen corresponding path program 1 times [2024-11-09 18:33:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500992836] [2024-11-09 18:33:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:18,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:18,360 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-09 18:33:18,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500992836] [2024-11-09 18:33:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500992836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:18,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:18,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:18,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413937723] [2024-11-09 18:33:18,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:18,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:18,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,361 INFO L87 Difference]: Start difference. First operand 1703 states and 2629 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-09 18:33:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:18,419 INFO L93 Difference]: Finished difference Result 4013 states and 6217 transitions. [2024-11-09 18:33:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:18,420 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-09 18:33:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:18,428 INFO L225 Difference]: With dead ends: 4013 [2024-11-09 18:33:18,428 INFO L226 Difference]: Without dead ends: 2346 [2024-11-09 18:33:18,432 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-09 18:33:18,433 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 181 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-09 18:33:18,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2024-11-09 18:33:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2343. [2024-11-09 18:33:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.5324508966695132) internal successors, (3589), 2342 states have internal predecessors, (3589), 0 states have call successors, (0), 0 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-09 18:33:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3589 transitions. [2024-11-09 18:33:18,507 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3589 transitions. Word has length 26 [2024-11-09 18:33:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:18,507 INFO L471 AbstractCegarLoop]: Abstraction has 2343 states and 3589 transitions. [2024-11-09 18:33:18,507 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-09 18:33:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3589 transitions. [2024-11-09 18:33:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 18:33:18,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:18,510 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-09 18:33:18,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 18:33:18,510 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:18,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1405189389, now seen corresponding path program 1 times [2024-11-09 18:33:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:18,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084983467] [2024-11-09 18:33:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:18,537 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-09 18:33:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084983467] [2024-11-09 18:33:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084983467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:18,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462295642] [2024-11-09 18:33:18,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:18,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:18,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:18,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,540 INFO L87 Difference]: Start difference. First operand 2343 states and 3589 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-09 18:33:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:18,590 INFO L93 Difference]: Finished difference Result 3517 states and 5369 transitions. [2024-11-09 18:33:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:18,590 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-09 18:33:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:18,597 INFO L225 Difference]: With dead ends: 3517 [2024-11-09 18:33:18,598 INFO L226 Difference]: Without dead ends: 2378 [2024-11-09 18:33:18,599 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-09 18:33:18,601 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 178 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-09 18:33:18,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2024-11-09 18:33:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2375. [2024-11-09 18:33:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2374 states have (on average 1.5117944397641112) internal successors, (3589), 2374 states have internal predecessors, (3589), 0 states have call successors, (0), 0 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-09 18:33:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3589 transitions. [2024-11-09 18:33:18,697 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3589 transitions. Word has length 27 [2024-11-09 18:33:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:18,697 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 3589 transitions. [2024-11-09 18:33:18,697 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-09 18:33:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3589 transitions. [2024-11-09 18:33:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 18:33:18,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:18,700 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-09 18:33:18,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 18:33:18,700 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:18,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -51879692, now seen corresponding path program 1 times [2024-11-09 18:33:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:18,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325190089] [2024-11-09 18:33:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:18,718 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-09 18:33:18,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325190089] [2024-11-09 18:33:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325190089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:18,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206701610] [2024-11-09 18:33:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:18,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,720 INFO L87 Difference]: Start difference. First operand 2375 states and 3589 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-09 18:33:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:18,787 INFO L93 Difference]: Finished difference Result 4237 states and 6537 transitions. [2024-11-09 18:33:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:18,788 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-09 18:33:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:18,800 INFO L225 Difference]: With dead ends: 4237 [2024-11-09 18:33:18,800 INFO L226 Difference]: Without dead ends: 4234 [2024-11-09 18:33:18,802 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-09 18:33:18,802 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 42 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 145 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-09 18:33:18,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2024-11-09 18:33:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3399. [2024-11-09 18:33:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 3398 states have (on average 1.470570924072984) internal successors, (4997), 3398 states have internal predecessors, (4997), 0 states have call successors, (0), 0 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-09 18:33:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4997 transitions. [2024-11-09 18:33:18,892 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4997 transitions. Word has length 27 [2024-11-09 18:33:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:18,892 INFO L471 AbstractCegarLoop]: Abstraction has 3399 states and 4997 transitions. [2024-11-09 18:33:18,892 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-09 18:33:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4997 transitions. [2024-11-09 18:33:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 18:33:18,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:18,896 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-09 18:33:18,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 18:33:18,897 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:18,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:18,897 INFO L85 PathProgramCache]: Analyzing trace with hash -562413869, now seen corresponding path program 1 times [2024-11-09 18:33:18,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:18,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112852518] [2024-11-09 18:33:18,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:18,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:18,915 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-09 18:33:18,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:18,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112852518] [2024-11-09 18:33:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112852518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:18,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:18,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327378809] [2024-11-09 18:33:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:18,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:18,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,917 INFO L87 Difference]: Start difference. First operand 3399 states and 4997 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-09 18:33:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:19,023 INFO L93 Difference]: Finished difference Result 7949 states and 11721 transitions. [2024-11-09 18:33:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:19,024 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-09 18:33:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:19,037 INFO L225 Difference]: With dead ends: 7949 [2024-11-09 18:33:19,038 INFO L226 Difference]: Without dead ends: 4618 [2024-11-09 18:33:19,042 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-09 18:33:19,042 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 182 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-09 18:33:19,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2024-11-09 18:33:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 4615. [2024-11-09 18:33:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4615 states, 4614 states have (on average 1.4575205895101864) internal successors, (6725), 4614 states have internal predecessors, (6725), 0 states have call successors, (0), 0 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-09 18:33:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6725 transitions. [2024-11-09 18:33:19,198 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6725 transitions. Word has length 27 [2024-11-09 18:33:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:19,198 INFO L471 AbstractCegarLoop]: Abstraction has 4615 states and 6725 transitions. [2024-11-09 18:33:19,199 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-09 18:33:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6725 transitions. [2024-11-09 18:33:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 18:33:19,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:19,205 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-09 18:33:19,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 18:33:19,205 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1607434347, now seen corresponding path program 1 times [2024-11-09 18:33:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:19,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860481661] [2024-11-09 18:33:19,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:19,226 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-09 18:33:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:19,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860481661] [2024-11-09 18:33:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860481661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:19,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:19,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241323999] [2024-11-09 18:33:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:19,230 INFO L87 Difference]: Start difference. First operand 4615 states and 6725 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-09 18:33:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:19,316 INFO L93 Difference]: Finished difference Result 6925 states and 10057 transitions. [2024-11-09 18:33:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:19,317 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-09 18:33:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:19,346 INFO L225 Difference]: With dead ends: 6925 [2024-11-09 18:33:19,346 INFO L226 Difference]: Without dead ends: 4682 [2024-11-09 18:33:19,351 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-09 18:33:19,352 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 174 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-09 18:33:19,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2024-11-09 18:33:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 4679. [2024-11-09 18:33:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4679 states, 4678 states have (on average 1.4375801624625908) internal successors, (6725), 4678 states have internal predecessors, (6725), 0 states have call successors, (0), 0 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-09 18:33:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4679 states to 4679 states and 6725 transitions. [2024-11-09 18:33:19,525 INFO L78 Accepts]: Start accepts. Automaton has 4679 states and 6725 transitions. Word has length 28 [2024-11-09 18:33:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:19,528 INFO L471 AbstractCegarLoop]: Abstraction has 4679 states and 6725 transitions. [2024-11-09 18:33:19,528 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-09 18:33:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4679 states and 6725 transitions. [2024-11-09 18:33:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 18:33:19,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:19,533 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-09 18:33:19,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 18:33:19,533 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:19,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash -254124650, now seen corresponding path program 1 times [2024-11-09 18:33:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911125378] [2024-11-09 18:33:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:19,557 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-09 18:33:19,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:19,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911125378] [2024-11-09 18:33:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911125378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410481652] [2024-11-09 18:33:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:19,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:19,560 INFO L87 Difference]: Start difference. First operand 4679 states and 6725 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-09 18:33:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:19,693 INFO L93 Difference]: Finished difference Result 8205 states and 12041 transitions. [2024-11-09 18:33:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:19,694 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-09 18:33:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:19,707 INFO L225 Difference]: With dead ends: 8205 [2024-11-09 18:33:19,708 INFO L226 Difference]: Without dead ends: 8202 [2024-11-09 18:33:19,711 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-09 18:33:19,712 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 39 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 143 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-09 18:33:19,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8202 states. [2024-11-09 18:33:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8202 to 6791. [2024-11-09 18:33:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6791 states, 6790 states have (on average 1.3957290132547864) internal successors, (9477), 6790 states have internal predecessors, (9477), 0 states have call successors, (0), 0 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-09 18:33:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6791 states to 6791 states and 9477 transitions. [2024-11-09 18:33:19,901 INFO L78 Accepts]: Start accepts. Automaton has 6791 states and 9477 transitions. Word has length 28 [2024-11-09 18:33:19,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:19,901 INFO L471 AbstractCegarLoop]: Abstraction has 6791 states and 9477 transitions. [2024-11-09 18:33:19,902 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-09 18:33:19,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6791 states and 9477 transitions. [2024-11-09 18:33:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 18:33:19,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:19,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, 1, 1, 1] [2024-11-09 18:33:19,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 18:33:19,909 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:19,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash -764658827, now seen corresponding path program 1 times [2024-11-09 18:33:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400555531] [2024-11-09 18:33:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:19,932 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-09 18:33:19,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:19,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400555531] [2024-11-09 18:33:19,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400555531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:19,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:19,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136741028] [2024-11-09 18:33:19,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:19,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:19,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:19,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:19,934 INFO L87 Difference]: Start difference. First operand 6791 states and 9477 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-09 18:33:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:20,084 INFO L93 Difference]: Finished difference Result 15757 states and 22025 transitions. [2024-11-09 18:33:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:20,085 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-09 18:33:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:20,100 INFO L225 Difference]: With dead ends: 15757 [2024-11-09 18:33:20,100 INFO L226 Difference]: Without dead ends: 9098 [2024-11-09 18:33:20,109 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-09 18:33:20,110 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 183 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-09 18:33:20,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 183 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2024-11-09 18:33:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 9095. [2024-11-09 18:33:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9095 states, 9094 states have (on average 1.3799208269188477) internal successors, (12549), 9094 states have internal predecessors, (12549), 0 states have call successors, (0), 0 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-09 18:33:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9095 states to 9095 states and 12549 transitions. [2024-11-09 18:33:20,365 INFO L78 Accepts]: Start accepts. Automaton has 9095 states and 12549 transitions. Word has length 28 [2024-11-09 18:33:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:20,365 INFO L471 AbstractCegarLoop]: Abstraction has 9095 states and 12549 transitions. [2024-11-09 18:33:20,365 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-09 18:33:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9095 states and 12549 transitions. [2024-11-09 18:33:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 18:33:20,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:20,374 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-09 18:33:20,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 18:33:20,375 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash 712899820, now seen corresponding path program 1 times [2024-11-09 18:33:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973762068] [2024-11-09 18:33:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:20,406 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-09 18:33:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973762068] [2024-11-09 18:33:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973762068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:20,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924680479] [2024-11-09 18:33:20,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:20,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:20,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:20,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:20,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:20,408 INFO L87 Difference]: Start difference. First operand 9095 states and 12549 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-09 18:33:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:20,642 INFO L93 Difference]: Finished difference Result 13645 states and 18761 transitions. [2024-11-09 18:33:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:20,643 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-09 18:33:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:20,659 INFO L225 Difference]: With dead ends: 13645 [2024-11-09 18:33:20,659 INFO L226 Difference]: Without dead ends: 9226 [2024-11-09 18:33:20,666 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-09 18:33:20,667 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 170 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-09 18:33:20,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 170 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9226 states. [2024-11-09 18:33:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9226 to 9223. [2024-11-09 18:33:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9223 states, 9222 states have (on average 1.3607677293428757) internal successors, (12549), 9222 states have internal predecessors, (12549), 0 states have call successors, (0), 0 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-09 18:33:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9223 states to 9223 states and 12549 transitions. [2024-11-09 18:33:20,899 INFO L78 Accepts]: Start accepts. Automaton has 9223 states and 12549 transitions. Word has length 29 [2024-11-09 18:33:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:20,899 INFO L471 AbstractCegarLoop]: Abstraction has 9223 states and 12549 transitions. [2024-11-09 18:33:20,899 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-09 18:33:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9223 states and 12549 transitions. [2024-11-09 18:33:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 18:33:20,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:20,907 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-09 18:33:20,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 18:33:20,907 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:20,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:20,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2066209517, now seen corresponding path program 1 times [2024-11-09 18:33:20,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:20,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762107807] [2024-11-09 18:33:20,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:20,927 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-09 18:33:20,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:20,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762107807] [2024-11-09 18:33:20,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762107807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:20,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:20,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:20,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793378898] [2024-11-09 18:33:20,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:20,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:20,929 INFO L87 Difference]: Start difference. First operand 9223 states and 12549 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-09 18:33:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:21,127 INFO L93 Difference]: Finished difference Result 15885 states and 22025 transitions. [2024-11-09 18:33:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:21,127 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-09 18:33:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:21,152 INFO L225 Difference]: With dead ends: 15885 [2024-11-09 18:33:21,152 INFO L226 Difference]: Without dead ends: 15882 [2024-11-09 18:33:21,157 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-09 18:33:21,158 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 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-09 18:33:21,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15882 states. [2024-11-09 18:33:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15882 to 13575. [2024-11-09 18:33:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13575 states, 13574 states have (on average 1.3205392662442905) internal successors, (17925), 13574 states have internal predecessors, (17925), 0 states have call successors, (0), 0 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-09 18:33:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13575 states to 13575 states and 17925 transitions. [2024-11-09 18:33:21,460 INFO L78 Accepts]: Start accepts. Automaton has 13575 states and 17925 transitions. Word has length 29 [2024-11-09 18:33:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:21,461 INFO L471 AbstractCegarLoop]: Abstraction has 13575 states and 17925 transitions. [2024-11-09 18:33:21,461 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-09 18:33:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 13575 states and 17925 transitions. [2024-11-09 18:33:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 18:33:21,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:21,476 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-09 18:33:21,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 18:33:21,476 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:21,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1555675340, now seen corresponding path program 1 times [2024-11-09 18:33:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:21,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901358489] [2024-11-09 18:33:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:21,503 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-09 18:33:21,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:21,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901358489] [2024-11-09 18:33:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901358489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:21,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:21,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803319695] [2024-11-09 18:33:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:21,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:21,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:21,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:21,505 INFO L87 Difference]: Start difference. First operand 13575 states and 17925 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-09 18:33:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:21,773 INFO L93 Difference]: Finished difference Result 31245 states and 41225 transitions. [2024-11-09 18:33:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:21,774 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-09 18:33:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:21,801 INFO L225 Difference]: With dead ends: 31245 [2024-11-09 18:33:21,801 INFO L226 Difference]: Without dead ends: 17930 [2024-11-09 18:33:21,815 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-09 18:33:21,816 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 184 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-09 18:33:21,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17930 states. [2024-11-09 18:33:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17930 to 17927. [2024-11-09 18:33:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17927 states, 17926 states have (on average 1.2998438022983376) internal successors, (23301), 17926 states have internal predecessors, (23301), 0 states have call successors, (0), 0 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-09 18:33:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17927 states to 17927 states and 23301 transitions. [2024-11-09 18:33:22,315 INFO L78 Accepts]: Start accepts. Automaton has 17927 states and 23301 transitions. Word has length 29 [2024-11-09 18:33:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:22,315 INFO L471 AbstractCegarLoop]: Abstraction has 17927 states and 23301 transitions. [2024-11-09 18:33:22,316 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-09 18:33:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17927 states and 23301 transitions. [2024-11-09 18:33:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:33:22,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:22,336 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-09 18:33:22,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 18:33:22,336 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:22,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash -371191762, now seen corresponding path program 1 times [2024-11-09 18:33:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:22,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838015530] [2024-11-09 18:33:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:22,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:22,361 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-09 18:33:22,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838015530] [2024-11-09 18:33:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838015530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:22,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:22,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202517859] [2024-11-09 18:33:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:22,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:22,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:22,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:22,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:22,364 INFO L87 Difference]: Start difference. First operand 17927 states and 23301 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-09 18:33:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:22,687 INFO L93 Difference]: Finished difference Result 26893 states and 34825 transitions. [2024-11-09 18:33:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:22,687 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-09 18:33:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:22,802 INFO L225 Difference]: With dead ends: 26893 [2024-11-09 18:33:22,802 INFO L226 Difference]: Without dead ends: 18186 [2024-11-09 18:33:22,809 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-09 18:33:22,810 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 166 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-09 18:33:22,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18186 states. [2024-11-09 18:33:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18186 to 18183. [2024-11-09 18:33:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18183 states, 18182 states have (on average 1.2815421845781543) internal successors, (23301), 18182 states have internal predecessors, (23301), 0 states have call successors, (0), 0 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-09 18:33:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18183 states to 18183 states and 23301 transitions. [2024-11-09 18:33:23,117 INFO L78 Accepts]: Start accepts. Automaton has 18183 states and 23301 transitions. Word has length 30 [2024-11-09 18:33:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:23,117 INFO L471 AbstractCegarLoop]: Abstraction has 18183 states and 23301 transitions. [2024-11-09 18:33:23,118 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-09 18:33:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 18183 states and 23301 transitions. [2024-11-09 18:33:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:33:23,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:23,131 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-09 18:33:23,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 18:33:23,131 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:23,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash 982117935, now seen corresponding path program 1 times [2024-11-09 18:33:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:23,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377671281] [2024-11-09 18:33:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:23,158 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-09 18:33:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:23,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377671281] [2024-11-09 18:33:23,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377671281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:23,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:23,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153966800] [2024-11-09 18:33:23,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:23,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:23,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:23,161 INFO L87 Difference]: Start difference. First operand 18183 states and 23301 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-09 18:33:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:23,543 INFO L93 Difference]: Finished difference Result 30733 states and 39945 transitions. [2024-11-09 18:33:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:23,544 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-09 18:33:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:23,594 INFO L225 Difference]: With dead ends: 30733 [2024-11-09 18:33:23,595 INFO L226 Difference]: Without dead ends: 30730 [2024-11-09 18:33:23,601 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-09 18:33:23,602 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 33 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 139 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-09 18:33:23,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30730 states. [2024-11-09 18:33:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30730 to 27143. [2024-11-09 18:33:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27143 states, 27142 states have (on average 1.2451919534301084) internal successors, (33797), 27142 states have internal predecessors, (33797), 0 states have call successors, (0), 0 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-09 18:33:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27143 states to 27143 states and 33797 transitions. [2024-11-09 18:33:24,191 INFO L78 Accepts]: Start accepts. Automaton has 27143 states and 33797 transitions. Word has length 30 [2024-11-09 18:33:24,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:24,191 INFO L471 AbstractCegarLoop]: Abstraction has 27143 states and 33797 transitions. [2024-11-09 18:33:24,191 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-09 18:33:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 27143 states and 33797 transitions. [2024-11-09 18:33:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:33:24,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:24,215 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-09 18:33:24,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 18:33:24,216 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:24,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash 471583758, now seen corresponding path program 1 times [2024-11-09 18:33:24,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:24,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471536706] [2024-11-09 18:33:24,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:24,236 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-09 18:33:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471536706] [2024-11-09 18:33:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471536706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:24,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304254315] [2024-11-09 18:33:24,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:24,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:24,238 INFO L87 Difference]: Start difference. First operand 27143 states and 33797 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-09 18:33:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:24,824 INFO L93 Difference]: Finished difference Result 61965 states and 76809 transitions. [2024-11-09 18:33:24,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:24,825 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-09 18:33:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:24,871 INFO L225 Difference]: With dead ends: 61965 [2024-11-09 18:33:24,871 INFO L226 Difference]: Without dead ends: 35338 [2024-11-09 18:33:24,899 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-09 18:33:24,903 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 185 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-09 18:33:24,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35338 states. [2024-11-09 18:33:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35338 to 35335. [2024-11-09 18:33:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35335 states, 35334 states have (on average 1.2173260881870154) internal successors, (43013), 35334 states have internal predecessors, (43013), 0 states have call successors, (0), 0 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-09 18:33:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35335 states to 35335 states and 43013 transitions. [2024-11-09 18:33:25,791 INFO L78 Accepts]: Start accepts. Automaton has 35335 states and 43013 transitions. Word has length 30 [2024-11-09 18:33:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:25,791 INFO L471 AbstractCegarLoop]: Abstraction has 35335 states and 43013 transitions. [2024-11-09 18:33:25,791 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-09 18:33:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 35335 states and 43013 transitions. [2024-11-09 18:33:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 18:33:25,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:25,811 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-09 18:33:25,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 18:33:25,812 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:25,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 381700837, now seen corresponding path program 1 times [2024-11-09 18:33:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:25,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071713647] [2024-11-09 18:33:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:25,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-09 18:33:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071713647] [2024-11-09 18:33:25,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071713647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:25,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:25,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:25,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702577616] [2024-11-09 18:33:25,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:25,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:25,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:25,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:25,832 INFO L87 Difference]: Start difference. First operand 35335 states and 43013 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-09 18:33:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:26,259 INFO L93 Difference]: Finished difference Result 53005 states and 64265 transitions. [2024-11-09 18:33:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:26,260 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-09 18:33:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:26,302 INFO L225 Difference]: With dead ends: 53005 [2024-11-09 18:33:26,302 INFO L226 Difference]: Without dead ends: 35850 [2024-11-09 18:33:26,318 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-09 18:33:26,319 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 162 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-09 18:33:26,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 162 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2024-11-09 18:33:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 35847. [2024-11-09 18:33:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35847 states, 35846 states have (on average 1.1999386263460359) internal successors, (43013), 35846 states have internal predecessors, (43013), 0 states have call successors, (0), 0 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-09 18:33:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35847 states to 35847 states and 43013 transitions. [2024-11-09 18:33:26,973 INFO L78 Accepts]: Start accepts. Automaton has 35847 states and 43013 transitions. Word has length 31 [2024-11-09 18:33:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:26,974 INFO L471 AbstractCegarLoop]: Abstraction has 35847 states and 43013 transitions. [2024-11-09 18:33:26,974 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-09 18:33:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 35847 states and 43013 transitions. [2024-11-09 18:33:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 18:33:26,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:26,990 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-09 18:33:26,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 18:33:26,991 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:26,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1735010534, now seen corresponding path program 1 times [2024-11-09 18:33:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:26,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004143667] [2024-11-09 18:33:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:27,009 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-09 18:33:27,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004143667] [2024-11-09 18:33:27,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004143667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:27,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:27,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547941587] [2024-11-09 18:33:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:27,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:27,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:27,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:27,011 INFO L87 Difference]: Start difference. First operand 35847 states and 43013 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-09 18:33:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:27,997 INFO L93 Difference]: Finished difference Result 59405 states and 71689 transitions. [2024-11-09 18:33:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:27,997 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-09 18:33:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:28,054 INFO L225 Difference]: With dead ends: 59405 [2024-11-09 18:33:28,054 INFO L226 Difference]: Without dead ends: 59402 [2024-11-09 18:33:28,062 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-09 18:33:28,064 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 137 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-09 18:33:28,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59402 states. [2024-11-09 18:33:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59402 to 54279. [2024-11-09 18:33:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54279 states, 54278 states have (on average 1.1697741257968237) internal successors, (63493), 54278 states have internal predecessors, (63493), 0 states have call successors, (0), 0 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-09 18:33:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54279 states to 54279 states and 63493 transitions. [2024-11-09 18:33:28,919 INFO L78 Accepts]: Start accepts. Automaton has 54279 states and 63493 transitions. Word has length 31 [2024-11-09 18:33:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 54279 states and 63493 transitions. [2024-11-09 18:33:28,920 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-09 18:33:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 54279 states and 63493 transitions. [2024-11-09 18:33:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 18:33:28,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:28,955 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-09 18:33:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 18:33:28,955 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:28,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1224476357, now seen corresponding path program 1 times [2024-11-09 18:33:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809321779] [2024-11-09 18:33:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:28,974 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-09 18:33:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809321779] [2024-11-09 18:33:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809321779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:28,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:28,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:28,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230950806] [2024-11-09 18:33:28,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:28,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:28,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:28,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:28,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:28,976 INFO L87 Difference]: Start difference. First operand 54279 states and 63493 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-09 18:33:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:29,931 INFO L93 Difference]: Finished difference Result 122893 states and 142345 transitions. [2024-11-09 18:33:29,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:29,931 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-09 18:33:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:30,001 INFO L225 Difference]: With dead ends: 122893 [2024-11-09 18:33:30,002 INFO L226 Difference]: Without dead ends: 69642 [2024-11-09 18:33:30,044 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-09 18:33:30,045 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 186 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-09 18:33:30,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2024-11-09 18:33:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 69639. [2024-11-09 18:33:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69639 states, 69638 states have (on average 1.1323271776903414) internal successors, (78853), 69638 states have internal predecessors, (78853), 0 states have call successors, (0), 0 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-09 18:33:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69639 states to 69639 states and 78853 transitions. [2024-11-09 18:33:31,523 INFO L78 Accepts]: Start accepts. Automaton has 69639 states and 78853 transitions. Word has length 31 [2024-11-09 18:33:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:31,524 INFO L471 AbstractCegarLoop]: Abstraction has 69639 states and 78853 transitions. [2024-11-09 18:33:31,524 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-09 18:33:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 69639 states and 78853 transitions. [2024-11-09 18:33:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 18:33:31,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:31,550 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-09 18:33:31,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 18:33:31,550 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:31,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:31,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2048439097, now seen corresponding path program 1 times [2024-11-09 18:33:31,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:31,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93887600] [2024-11-09 18:33:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:31,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:31,568 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-09 18:33:31,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:31,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93887600] [2024-11-09 18:33:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93887600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:31,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:31,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656042499] [2024-11-09 18:33:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:31,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:31,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:31,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:31,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:31,570 INFO L87 Difference]: Start difference. First operand 69639 states and 78853 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-09 18:33:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:32,522 INFO L93 Difference]: Finished difference Result 104461 states and 117769 transitions. [2024-11-09 18:33:32,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:32,523 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-09 18:33:32,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:32,596 INFO L225 Difference]: With dead ends: 104461 [2024-11-09 18:33:32,596 INFO L226 Difference]: Without dead ends: 70666 [2024-11-09 18:33:32,623 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-09 18:33:32,624 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 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-09 18:33:32,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70666 states. [2024-11-09 18:33:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70666 to 70663. [2024-11-09 18:33:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70663 states, 70662 states have (on average 1.1159180323228892) internal successors, (78853), 70662 states have internal predecessors, (78853), 0 states have call successors, (0), 0 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-09 18:33:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70663 states to 70663 states and 78853 transitions. [2024-11-09 18:33:34,088 INFO L78 Accepts]: Start accepts. Automaton has 70663 states and 78853 transitions. Word has length 32 [2024-11-09 18:33:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:34,088 INFO L471 AbstractCegarLoop]: Abstraction has 70663 states and 78853 transitions. [2024-11-09 18:33:34,088 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-09 18:33:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 70663 states and 78853 transitions. [2024-11-09 18:33:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 18:33:34,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:34,116 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-09 18:33:34,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 18:33:34,116 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:34,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash -695129400, now seen corresponding path program 1 times [2024-11-09 18:33:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020838608] [2024-11-09 18:33:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:34,133 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-09 18:33:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020838608] [2024-11-09 18:33:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020838608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327168146] [2024-11-09 18:33:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:34,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:34,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:34,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:34,136 INFO L87 Difference]: Start difference. First operand 70663 states and 78853 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-09 18:33:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:35,894 INFO L93 Difference]: Finished difference Result 114698 states and 126983 transitions. [2024-11-09 18:33:35,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:35,894 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-09 18:33:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:36,006 INFO L225 Difference]: With dead ends: 114698 [2024-11-09 18:33:36,006 INFO L226 Difference]: Without dead ends: 114695 [2024-11-09 18:33:36,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:36,023 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 133 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-09 18:33:36,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114695 states. [2024-11-09 18:33:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114695 to 108551. [2024-11-09 18:33:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108551 states, 108550 states have (on average 1.0943251957623215) internal successors, (118789), 108550 states have internal predecessors, (118789), 0 states have call successors, (0), 0 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-09 18:33:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108551 states to 108551 states and 118789 transitions. [2024-11-09 18:33:37,779 INFO L78 Accepts]: Start accepts. Automaton has 108551 states and 118789 transitions. Word has length 32 [2024-11-09 18:33:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:37,780 INFO L471 AbstractCegarLoop]: Abstraction has 108551 states and 118789 transitions. [2024-11-09 18:33:37,780 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-09 18:33:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 108551 states and 118789 transitions. [2024-11-09 18:33:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 18:33:37,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:37,850 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-09 18:33:37,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 18:33:37,850 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:37,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1205663577, now seen corresponding path program 1 times [2024-11-09 18:33:37,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:37,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135510609] [2024-11-09 18:33:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:37,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:37,876 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-09 18:33:37,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:37,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135510609] [2024-11-09 18:33:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135510609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:37,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:37,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256887229] [2024-11-09 18:33:37,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:37,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:37,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:37,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:37,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:37,878 INFO L87 Difference]: Start difference. First operand 108551 states and 118789 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-09 18:33:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:40,016 INFO L93 Difference]: Finished difference Result 243719 states and 262149 transitions. [2024-11-09 18:33:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:40,017 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-09 18:33:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:40,023 INFO L225 Difference]: With dead ends: 243719 [2024-11-09 18:33:40,023 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:33:40,115 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-09 18:33:40,115 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 47 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 183 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-09 18:33:40,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 183 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:33:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:33:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:33:40,121 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2024-11-09 18:33:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:40,121 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:33:40,121 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-09 18:33:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:33:40,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:33:40,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:33:40,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 18:33:40,127 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:40,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:33:40,149 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:33:40,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:33:40 BoogieIcfgContainer [2024-11-09 18:33:40,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:33:40,159 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:33:40,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:33:40,160 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:33:40,160 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:33:16" (3/4) ... [2024-11-09 18:33:40,162 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:33:40,172 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 18:33:40,173 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 18:33:40,173 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:33:40,173 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:33:40,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:33:40,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:33:40,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:33:40,262 INFO L158 Benchmark]: Toolchain (without parser) took 25043.59ms. Allocated memory was 163.6MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 108.4MB in the beginning and 11.4GB in the end (delta: -11.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-09 18:33:40,262 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:33:40,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.53ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 94.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:33:40,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.48ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 92.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:33:40,263 INFO L158 Benchmark]: Boogie Preprocessor took 57.12ms. Allocated memory is still 163.6MB. Free memory was 92.9MB in the beginning and 91.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:33:40,264 INFO L158 Benchmark]: IcfgBuilder took 440.07ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 73.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 18:33:40,264 INFO L158 Benchmark]: TraceAbstraction took 24048.44ms. Allocated memory was 163.6MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 73.3MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-09 18:33:40,264 INFO L158 Benchmark]: Witness Printer took 102.78ms. Allocated memory is still 12.9GB. Free memory was 11.4GB in the beginning and 11.4GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:33:40,265 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.53ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 94.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.48ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 92.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.12ms. Allocated memory is still 163.6MB. Free memory was 92.9MB in the beginning and 91.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 440.07ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 73.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24048.44ms. Allocated memory was 163.6MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 73.3MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 102.78ms. Allocated memory is still 12.9GB. Free memory was 11.4GB in the beginning and 11.4GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1801 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1801 mSDsluCounter, 5892 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2370 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 3522 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108551occurred in iteration=34, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 20550 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 933 NumberOfCodeBlocks, 933 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 898 ConstructedInterpolants, 0 QuantifiedInterpolants, 1894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:33:40,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE