./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:30:52,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:30:52,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:30:52,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:30:52,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:30:52,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:30:52,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:30:52,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:30:52,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:30:52,943 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:30:52,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:30:52,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:30:52,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:30:52,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:30:52,945 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:30:52,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:30:52,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:30:52,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:30:52,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:30:52,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:30:52,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:30:52,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:30:52,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:30:52,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:30:52,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:30:52,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:30:52,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:30:52,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:30:52,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:30:52,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:30:52,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:30:52,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:30:52,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:52,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:30:52,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:30:52,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:30:52,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:30:52,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:30:52,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:30:52,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:30:52,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:30:52,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:30:52,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-10-10 22:30:53,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:30:53,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:30:53,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:30:53,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:30:53,242 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:30:53,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-10-10 22:30:54,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:30:54,832 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:30:54,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-10-10 22:30:54,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5402d4ab2/a5eb11944e094d7aa2c6cc55252bfa58/FLAGba620f97b [2024-10-10 22:30:54,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5402d4ab2/a5eb11944e094d7aa2c6cc55252bfa58 [2024-10-10 22:30:54,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:30:54,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:30:54,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:54,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:30:54,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:30:54,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:54" (1/1) ... [2024-10-10 22:30:54,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209991d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:54, skipping insertion in model container [2024-10-10 22:30:54,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:54" (1/1) ... [2024-10-10 22:30:54,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:30:55,120 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2024-10-10 22:30:55,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:55,140 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:30:55,166 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2024-10-10 22:30:55,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:55,181 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:30:55,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55 WrapperNode [2024-10-10 22:30:55,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:55,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:55,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:30:55,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:30:55,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,220 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 208 [2024-10-10 22:30:55,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:55,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:30:55,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:30:55,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:30:55,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,249 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:30:55,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:30:55,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:30:55,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:30:55,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:30:55,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (1/1) ... [2024-10-10 22:30:55,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:55,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:55,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:30:55,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:30:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:30:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:30:55,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:30:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:30:55,442 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:30:55,444 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:30:55,713 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-10 22:30:55,713 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:30:55,749 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:30:55,753 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:30:55,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:55 BoogieIcfgContainer [2024-10-10 22:30:55,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:30:55,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:30:55,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:30:55,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:30:55,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:30:54" (1/3) ... [2024-10-10 22:30:55,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f17cfa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:55, skipping insertion in model container [2024-10-10 22:30:55,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:55" (2/3) ... [2024-10-10 22:30:55,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f17cfa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:55, skipping insertion in model container [2024-10-10 22:30:55,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:55" (3/3) ... [2024-10-10 22:30:55,762 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2024-10-10 22:30:55,779 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:30:55,779 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:30:55,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:30:55,859 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;@6d75470b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:30:55,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:30:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 52 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:30:55,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:55,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:55,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:55,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:55,881 INFO L85 PathProgramCache]: Analyzing trace with hash -916349520, now seen corresponding path program 1 times [2024-10-10 22:30:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482745679] [2024-10-10 22:30:55,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:56,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:56,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482745679] [2024-10-10 22:30:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482745679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:56,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:56,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55142153] [2024-10-10 22:30:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:56,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:56,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,161 INFO L87 Difference]: Start difference. First operand has 53 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 52 states have internal predecessors, (100), 0 states have call successors, (0), 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-10-10 22:30:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:56,208 INFO L93 Difference]: Finished difference Result 108 states and 201 transitions. [2024-10-10 22:30:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:56,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-10 22:30:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:56,218 INFO L225 Difference]: With dead ends: 108 [2024-10-10 22:30:56,218 INFO L226 Difference]: Without dead ends: 98 [2024-10-10 22:30:56,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,223 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 75 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:56,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-10 22:30:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2024-10-10 22:30:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 65 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 125 transitions. [2024-10-10 22:30:56,258 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 125 transitions. Word has length 21 [2024-10-10 22:30:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:56,259 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 125 transitions. [2024-10-10 22:30:56,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 125 transitions. [2024-10-10 22:30:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:30:56,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:56,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:56,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:30:56,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1384473070, now seen corresponding path program 1 times [2024-10-10 22:30:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:56,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458063232] [2024-10-10 22:30:56,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:56,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:56,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458063232] [2024-10-10 22:30:56,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458063232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:56,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676381334] [2024-10-10 22:30:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:56,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,397 INFO L87 Difference]: Start difference. First operand 66 states and 125 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:56,460 INFO L93 Difference]: Finished difference Result 163 states and 308 transitions. [2024-10-10 22:30:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:56,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-10 22:30:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:56,463 INFO L225 Difference]: With dead ends: 163 [2024-10-10 22:30:56,464 INFO L226 Difference]: Without dead ends: 98 [2024-10-10 22:30:56,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,466 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 73 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:56,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-10 22:30:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-10-10 22:30:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.9052631578947368) internal successors, (181), 95 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 181 transitions. [2024-10-10 22:30:56,491 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 181 transitions. Word has length 21 [2024-10-10 22:30:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:56,492 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 181 transitions. [2024-10-10 22:30:56,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 181 transitions. [2024-10-10 22:30:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:30:56,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:56,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:56,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:30:56,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:56,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1658147680, now seen corresponding path program 1 times [2024-10-10 22:30:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:56,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621251404] [2024-10-10 22:30:56,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621251404] [2024-10-10 22:30:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621251404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:56,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:56,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:56,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063342355] [2024-10-10 22:30:56,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:56,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:56,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:56,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,607 INFO L87 Difference]: Start difference. First operand 96 states and 181 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:56,642 INFO L93 Difference]: Finished difference Result 149 states and 275 transitions. [2024-10-10 22:30:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:56,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-10 22:30:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:56,646 INFO L225 Difference]: With dead ends: 149 [2024-10-10 22:30:56,646 INFO L226 Difference]: Without dead ends: 101 [2024-10-10 22:30:56,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,647 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:56,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-10 22:30:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-10-10 22:30:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.8673469387755102) internal successors, (183), 98 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 183 transitions. [2024-10-10 22:30:56,669 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 183 transitions. Word has length 22 [2024-10-10 22:30:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:56,669 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 183 transitions. [2024-10-10 22:30:56,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 183 transitions. [2024-10-10 22:30:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:30:56,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:56,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:56,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:30:56,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:56,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -30796062, now seen corresponding path program 1 times [2024-10-10 22:30:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656162223] [2024-10-10 22:30:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656162223] [2024-10-10 22:30:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656162223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:56,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:56,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212163318] [2024-10-10 22:30:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:56,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,741 INFO L87 Difference]: Start difference. First operand 99 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:56,759 INFO L93 Difference]: Finished difference Result 192 states and 356 transitions. [2024-10-10 22:30:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:56,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-10 22:30:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:56,761 INFO L225 Difference]: With dead ends: 192 [2024-10-10 22:30:56,761 INFO L226 Difference]: Without dead ends: 190 [2024-10-10 22:30:56,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,763 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 70 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:56,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-10 22:30:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 132. [2024-10-10 22:30:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.8625954198473282) internal successors, (244), 131 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 244 transitions. [2024-10-10 22:30:56,783 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 244 transitions. Word has length 22 [2024-10-10 22:30:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:56,783 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 244 transitions. [2024-10-10 22:30:56,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 244 transitions. [2024-10-10 22:30:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:30:56,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:56,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:56,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:30:56,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:56,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2024940768, now seen corresponding path program 1 times [2024-10-10 22:30:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:56,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239725299] [2024-10-10 22:30:56,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239725299] [2024-10-10 22:30:56,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239725299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:56,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:56,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742359341] [2024-10-10 22:30:56,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:56,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:56,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:56,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:56,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,839 INFO L87 Difference]: Start difference. First operand 132 states and 244 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:56,866 INFO L93 Difference]: Finished difference Result 320 states and 594 transitions. [2024-10-10 22:30:56,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:56,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-10 22:30:56,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:56,868 INFO L225 Difference]: With dead ends: 320 [2024-10-10 22:30:56,869 INFO L226 Difference]: Without dead ends: 192 [2024-10-10 22:30:56,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,872 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 72 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:56,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-10 22:30:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2024-10-10 22:30:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.8518518518518519) internal successors, (350), 189 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 350 transitions. [2024-10-10 22:30:56,885 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 350 transitions. Word has length 22 [2024-10-10 22:30:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:56,886 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 350 transitions. [2024-10-10 22:30:56,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 350 transitions. [2024-10-10 22:30:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:30:56,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:56,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:56,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:30:56,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:56,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash -954465853, now seen corresponding path program 1 times [2024-10-10 22:30:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:56,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949000488] [2024-10-10 22:30:56,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:56,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949000488] [2024-10-10 22:30:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949000488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:56,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:56,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:56,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878224371] [2024-10-10 22:30:56,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:56,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:56,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:56,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:56,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,954 INFO L87 Difference]: Start difference. First operand 190 states and 350 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:56,977 INFO L93 Difference]: Finished difference Result 287 states and 525 transitions. [2024-10-10 22:30:56,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:56,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-10 22:30:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:56,981 INFO L225 Difference]: With dead ends: 287 [2024-10-10 22:30:56,981 INFO L226 Difference]: Without dead ends: 194 [2024-10-10 22:30:56,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:56,984 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 74 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:56,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-10 22:30:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-10-10 22:30:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.8324607329842932) internal successors, (350), 191 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 350 transitions. [2024-10-10 22:30:57,001 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 350 transitions. Word has length 23 [2024-10-10 22:30:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,002 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 350 transitions. [2024-10-10 22:30:57,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 350 transitions. [2024-10-10 22:30:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:30:57,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:57,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:30:57,004 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1651557701, now seen corresponding path program 1 times [2024-10-10 22:30:57,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953370902] [2024-10-10 22:30:57,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953370902] [2024-10-10 22:30:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953370902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326290593] [2024-10-10 22:30:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,041 INFO L87 Difference]: Start difference. First operand 192 states and 350 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:57,058 INFO L93 Difference]: Finished difference Result 560 states and 1024 transitions. [2024-10-10 22:30:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-10 22:30:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:57,062 INFO L225 Difference]: With dead ends: 560 [2024-10-10 22:30:57,062 INFO L226 Difference]: Without dead ends: 374 [2024-10-10 22:30:57,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-10-10 22:30:57,064 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 72 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:57,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 184 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-10 22:30:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2024-10-10 22:30:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.8167115902964959) internal successors, (674), 371 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 674 transitions. [2024-10-10 22:30:57,086 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 674 transitions. Word has length 23 [2024-10-10 22:30:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,086 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 674 transitions. [2024-10-10 22:30:57,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 674 transitions. [2024-10-10 22:30:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:30:57,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:57,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:30:57,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash -649264889, now seen corresponding path program 1 times [2024-10-10 22:30:57,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375001569] [2024-10-10 22:30:57,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375001569] [2024-10-10 22:30:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375001569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388577439] [2024-10-10 22:30:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,129 INFO L87 Difference]: Start difference. First operand 372 states and 674 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:57,148 INFO L93 Difference]: Finished difference Result 480 states and 876 transitions. [2024-10-10 22:30:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:57,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-10 22:30:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:57,151 INFO L225 Difference]: With dead ends: 480 [2024-10-10 22:30:57,151 INFO L226 Difference]: Without dead ends: 478 [2024-10-10 22:30:57,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,154 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:57,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 257 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-10 22:30:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 372. [2024-10-10 22:30:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.8059299191374663) internal successors, (670), 371 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 670 transitions. [2024-10-10 22:30:57,168 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 670 transitions. Word has length 23 [2024-10-10 22:30:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,168 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 670 transitions. [2024-10-10 22:30:57,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 670 transitions. [2024-10-10 22:30:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:30:57,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,171 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-10-10 22:30:57,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:30:57,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash -341106411, now seen corresponding path program 1 times [2024-10-10 22:30:57,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668941620] [2024-10-10 22:30:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668941620] [2024-10-10 22:30:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668941620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243949140] [2024-10-10 22:30:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,207 INFO L87 Difference]: Start difference. First operand 372 states and 670 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-10-10 22:30:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:57,244 INFO L93 Difference]: Finished difference Result 708 states and 1288 transitions. [2024-10-10 22:30:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:57,246 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-10-10 22:30:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:57,249 INFO L225 Difference]: With dead ends: 708 [2024-10-10 22:30:57,249 INFO L226 Difference]: Without dead ends: 706 [2024-10-10 22:30:57,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,250 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:57,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-10-10 22:30:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 512. [2024-10-10 22:30:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 1.7808219178082192) internal successors, (910), 511 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 910 transitions. [2024-10-10 22:30:57,273 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 910 transitions. Word has length 24 [2024-10-10 22:30:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,274 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 910 transitions. [2024-10-10 22:30:57,274 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-10-10 22:30:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 910 transitions. [2024-10-10 22:30:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:30:57,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,276 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-10-10 22:30:57,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:30:57,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1959716179, now seen corresponding path program 1 times [2024-10-10 22:30:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252588602] [2024-10-10 22:30:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252588602] [2024-10-10 22:30:57,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252588602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909957657] [2024-10-10 22:30:57,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,318 INFO L87 Difference]: Start difference. First operand 512 states and 910 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-10-10 22:30:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:57,348 INFO L93 Difference]: Finished difference Result 1236 states and 2208 transitions. [2024-10-10 22:30:57,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:57,349 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-10-10 22:30:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:57,353 INFO L225 Difference]: With dead ends: 1236 [2024-10-10 22:30:57,353 INFO L226 Difference]: Without dead ends: 730 [2024-10-10 22:30:57,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,354 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 70 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:57,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 213 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-10 22:30:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 728. [2024-10-10 22:30:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.7744154057771664) internal successors, (1290), 727 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1290 transitions. [2024-10-10 22:30:57,381 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1290 transitions. Word has length 24 [2024-10-10 22:30:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,381 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1290 transitions. [2024-10-10 22:30:57,382 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-10-10 22:30:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1290 transitions. [2024-10-10 22:30:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:30:57,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,385 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-10-10 22:30:57,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:30:57,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1984151398, now seen corresponding path program 1 times [2024-10-10 22:30:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498814491] [2024-10-10 22:30:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498814491] [2024-10-10 22:30:57,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498814491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030957438] [2024-10-10 22:30:57,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,428 INFO L87 Difference]: Start difference. First operand 728 states and 1290 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-10-10 22:30:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:57,449 INFO L93 Difference]: Finished difference Result 1100 states and 1944 transitions. [2024-10-10 22:30:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:57,449 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-10-10 22:30:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:57,453 INFO L225 Difference]: With dead ends: 1100 [2024-10-10 22:30:57,453 INFO L226 Difference]: Without dead ends: 742 [2024-10-10 22:30:57,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,454 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:57,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 225 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-10-10 22:30:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2024-10-10 22:30:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.756427604871448) internal successors, (1298), 739 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1298 transitions. [2024-10-10 22:30:57,476 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1298 transitions. Word has length 25 [2024-10-10 22:30:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,476 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1298 transitions. [2024-10-10 22:30:57,476 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-10-10 22:30:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1298 transitions. [2024-10-10 22:30:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:30:57,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,478 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-10-10 22:30:57,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:30:57,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash 621872156, now seen corresponding path program 1 times [2024-10-10 22:30:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658496043] [2024-10-10 22:30:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658496043] [2024-10-10 22:30:57,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658496043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546693945] [2024-10-10 22:30:57,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,511 INFO L87 Difference]: Start difference. First operand 740 states and 1298 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-10-10 22:30:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:57,537 INFO L93 Difference]: Finished difference Result 1384 states and 2460 transitions. [2024-10-10 22:30:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:57,538 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-10-10 22:30:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:57,543 INFO L225 Difference]: With dead ends: 1384 [2024-10-10 22:30:57,545 INFO L226 Difference]: Without dead ends: 1382 [2024-10-10 22:30:57,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,546 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 61 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:57,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-10-10 22:30:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1028. [2024-10-10 22:30:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 1.7234664070107109) internal successors, (1770), 1027 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1770 transitions. [2024-10-10 22:30:57,570 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1770 transitions. Word has length 25 [2024-10-10 22:30:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,570 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1770 transitions. [2024-10-10 22:30:57,570 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-10-10 22:30:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1770 transitions. [2024-10-10 22:30:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:30:57,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,571 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-10-10 22:30:57,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:30:57,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1372272550, now seen corresponding path program 1 times [2024-10-10 22:30:57,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008506363] [2024-10-10 22:30:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008506363] [2024-10-10 22:30:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008506363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046900968] [2024-10-10 22:30:57,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,600 INFO L87 Difference]: Start difference. First operand 1028 states and 1770 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-10-10 22:30:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:57,633 INFO L93 Difference]: Finished difference Result 2456 states and 4252 transitions. [2024-10-10 22:30:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:57,634 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-10-10 22:30:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:57,639 INFO L225 Difference]: With dead ends: 2456 [2024-10-10 22:30:57,639 INFO L226 Difference]: Without dead ends: 1446 [2024-10-10 22:30:57,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,641 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 69 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:57,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 214 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-10-10 22:30:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1444. [2024-10-10 22:30:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.72002772002772) internal successors, (2482), 1443 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2482 transitions. [2024-10-10 22:30:57,679 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2482 transitions. Word has length 25 [2024-10-10 22:30:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,680 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 2482 transitions. [2024-10-10 22:30:57,681 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-10-10 22:30:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2482 transitions. [2024-10-10 22:30:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:30:57,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,682 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-10-10 22:30:57,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:30:57,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2098380744, now seen corresponding path program 1 times [2024-10-10 22:30:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222904544] [2024-10-10 22:30:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222904544] [2024-10-10 22:30:57,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222904544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195992674] [2024-10-10 22:30:57,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,731 INFO L87 Difference]: Start difference. First operand 1444 states and 2482 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-10-10 22:30:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:57,760 INFO L93 Difference]: Finished difference Result 2168 states and 3716 transitions. [2024-10-10 22:30:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:57,760 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-10-10 22:30:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:57,766 INFO L225 Difference]: With dead ends: 2168 [2024-10-10 22:30:57,766 INFO L226 Difference]: Without dead ends: 1462 [2024-10-10 22:30:57,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,768 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 71 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:57,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-10-10 22:30:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1460. [2024-10-10 22:30:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1459 states have (on average 1.7011651816312543) internal successors, (2482), 1459 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2482 transitions. [2024-10-10 22:30:57,810 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2482 transitions. Word has length 26 [2024-10-10 22:30:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,810 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 2482 transitions. [2024-10-10 22:30:57,811 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-10-10 22:30:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2482 transitions. [2024-10-10 22:30:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:30:57,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,812 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-10-10 22:30:57,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:30:57,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash 409437002, now seen corresponding path program 1 times [2024-10-10 22:30:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558762724] [2024-10-10 22:30:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558762724] [2024-10-10 22:30:57,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558762724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014716445] [2024-10-10 22:30:57,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,841 INFO L87 Difference]: Start difference. First operand 1460 states and 2482 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-10-10 22:30:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:57,883 INFO L93 Difference]: Finished difference Result 2696 states and 4660 transitions. [2024-10-10 22:30:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:57,884 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-10-10 22:30:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:57,893 INFO L225 Difference]: With dead ends: 2696 [2024-10-10 22:30:57,893 INFO L226 Difference]: Without dead ends: 2694 [2024-10-10 22:30:57,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,897 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 58 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:57,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2024-10-10 22:30:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2052. [2024-10-10 22:30:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 2051 states have (on average 1.6626036079960995) internal successors, (3410), 2051 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3410 transitions. [2024-10-10 22:30:57,955 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3410 transitions. Word has length 26 [2024-10-10 22:30:57,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:57,956 INFO L471 AbstractCegarLoop]: Abstraction has 2052 states and 3410 transitions. [2024-10-10 22:30:57,956 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-10-10 22:30:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3410 transitions. [2024-10-10 22:30:57,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:30:57,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:57,958 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-10-10 22:30:57,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:30:57,959 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1584707704, now seen corresponding path program 1 times [2024-10-10 22:30:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:57,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146904053] [2024-10-10 22:30:57,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:57,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146904053] [2024-10-10 22:30:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146904053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:57,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:57,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260364119] [2024-10-10 22:30:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:57,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:57,991 INFO L87 Difference]: Start difference. First operand 2052 states and 3410 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-10-10 22:30:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:58,047 INFO L93 Difference]: Finished difference Result 4872 states and 8148 transitions. [2024-10-10 22:30:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:58,048 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-10-10 22:30:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:58,057 INFO L225 Difference]: With dead ends: 4872 [2024-10-10 22:30:58,057 INFO L226 Difference]: Without dead ends: 2854 [2024-10-10 22:30:58,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:58,060 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:58,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2024-10-10 22:30:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2852. [2024-10-10 22:30:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.6618730270080673) internal successors, (4738), 2851 states have internal predecessors, (4738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4738 transitions. [2024-10-10 22:30:58,145 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4738 transitions. Word has length 26 [2024-10-10 22:30:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:58,146 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4738 transitions. [2024-10-10 22:30:58,146 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-10-10 22:30:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4738 transitions. [2024-10-10 22:30:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:30:58,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:58,148 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-10-10 22:30:58,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 22:30:58,148 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:58,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash -192141393, now seen corresponding path program 1 times [2024-10-10 22:30:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:58,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850578350] [2024-10-10 22:30:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850578350] [2024-10-10 22:30:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850578350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:58,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000666168] [2024-10-10 22:30:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:58,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:58,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:58,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:58,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:58,175 INFO L87 Difference]: Start difference. First operand 2852 states and 4738 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-10-10 22:30:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:58,228 INFO L93 Difference]: Finished difference Result 4280 states and 7092 transitions. [2024-10-10 22:30:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:58,228 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-10-10 22:30:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:58,237 INFO L225 Difference]: With dead ends: 4280 [2024-10-10 22:30:58,237 INFO L226 Difference]: Without dead ends: 2886 [2024-10-10 22:30:58,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:58,239 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:58,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2024-10-10 22:30:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2884. [2024-10-10 22:30:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2883 states have (on average 1.6434269857787027) internal successors, (4738), 2883 states have internal predecessors, (4738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4738 transitions. [2024-10-10 22:30:58,308 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4738 transitions. Word has length 27 [2024-10-10 22:30:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:58,308 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4738 transitions. [2024-10-10 22:30:58,308 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-10-10 22:30:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4738 transitions. [2024-10-10 22:30:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:30:58,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:58,310 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-10-10 22:30:58,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 22:30:58,311 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:58,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1881085135, now seen corresponding path program 1 times [2024-10-10 22:30:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:58,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119604734] [2024-10-10 22:30:58,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:58,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:58,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119604734] [2024-10-10 22:30:58,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119604734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:58,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:58,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983339201] [2024-10-10 22:30:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:58,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:58,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:58,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:58,334 INFO L87 Difference]: Start difference. First operand 2884 states and 4738 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-10-10 22:30:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:58,428 INFO L93 Difference]: Finished difference Result 5256 states and 8804 transitions. [2024-10-10 22:30:58,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:58,429 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-10-10 22:30:58,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:58,445 INFO L225 Difference]: With dead ends: 5256 [2024-10-10 22:30:58,445 INFO L226 Difference]: Without dead ends: 5254 [2024-10-10 22:30:58,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:58,446 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 55 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:58,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2024-10-10 22:30:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 4100. [2024-10-10 22:30:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4100 states, 4099 states have (on average 1.6008782629909735) internal successors, (6562), 4099 states have internal predecessors, (6562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 6562 transitions. [2024-10-10 22:30:58,556 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 6562 transitions. Word has length 27 [2024-10-10 22:30:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:58,556 INFO L471 AbstractCegarLoop]: Abstraction has 4100 states and 6562 transitions. [2024-10-10 22:30:58,556 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-10-10 22:30:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6562 transitions. [2024-10-10 22:30:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:30:58,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:58,561 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-10-10 22:30:58,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:30:58,561 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:58,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash 419737455, now seen corresponding path program 1 times [2024-10-10 22:30:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980864160] [2024-10-10 22:30:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:58,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:58,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980864160] [2024-10-10 22:30:58,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980864160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:58,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:58,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:58,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457651540] [2024-10-10 22:30:58,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:58,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:58,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:58,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:58,583 INFO L87 Difference]: Start difference. First operand 4100 states and 6562 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-10-10 22:30:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:58,680 INFO L93 Difference]: Finished difference Result 9672 states and 15588 transitions. [2024-10-10 22:30:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:58,681 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-10-10 22:30:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:58,714 INFO L225 Difference]: With dead ends: 9672 [2024-10-10 22:30:58,717 INFO L226 Difference]: Without dead ends: 5638 [2024-10-10 22:30:58,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:58,726 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:58,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2024-10-10 22:30:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5636. [2024-10-10 22:30:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5636 states, 5635 states have (on average 1.6017746228926353) internal successors, (9026), 5635 states have internal predecessors, (9026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 9026 transitions. [2024-10-10 22:30:58,945 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 9026 transitions. Word has length 27 [2024-10-10 22:30:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:58,946 INFO L471 AbstractCegarLoop]: Abstraction has 5636 states and 9026 transitions. [2024-10-10 22:30:58,946 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-10-10 22:30:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 9026 transitions. [2024-10-10 22:30:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:30:58,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:58,951 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-10-10 22:30:58,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 22:30:58,952 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:58,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1816116733, now seen corresponding path program 1 times [2024-10-10 22:30:58,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:58,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805918878] [2024-10-10 22:30:58,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:58,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-10-10 22:30:58,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:58,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805918878] [2024-10-10 22:30:58,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805918878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:58,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:58,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764902195] [2024-10-10 22:30:58,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:58,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:58,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:58,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:58,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:58,976 INFO L87 Difference]: Start difference. First operand 5636 states and 9026 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-10-10 22:30:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:59,061 INFO L93 Difference]: Finished difference Result 8456 states and 13508 transitions. [2024-10-10 22:30:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:59,062 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-10-10 22:30:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:59,073 INFO L225 Difference]: With dead ends: 8456 [2024-10-10 22:30:59,073 INFO L226 Difference]: Without dead ends: 5702 [2024-10-10 22:30:59,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,080 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:59,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2024-10-10 22:30:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5700. [2024-10-10 22:30:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5700 states, 5699 states have (on average 1.5837866292331988) internal successors, (9026), 5699 states have internal predecessors, (9026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 9026 transitions. [2024-10-10 22:30:59,276 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 9026 transitions. Word has length 28 [2024-10-10 22:30:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:59,276 INFO L471 AbstractCegarLoop]: Abstraction has 5700 states and 9026 transitions. [2024-10-10 22:30:59,277 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-10-10 22:30:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 9026 transitions. [2024-10-10 22:30:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:30:59,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:59,282 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-10-10 22:30:59,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:30:59,283 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:59,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash 127172991, now seen corresponding path program 1 times [2024-10-10 22:30:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548759272] [2024-10-10 22:30:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:59,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548759272] [2024-10-10 22:30:59,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548759272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:59,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:59,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:59,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077793576] [2024-10-10 22:30:59,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:59,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:59,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:59,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,317 INFO L87 Difference]: Start difference. First operand 5700 states and 9026 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-10-10 22:30:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:59,449 INFO L93 Difference]: Finished difference Result 10248 states and 16580 transitions. [2024-10-10 22:30:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:59,450 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-10-10 22:30:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:59,471 INFO L225 Difference]: With dead ends: 10248 [2024-10-10 22:30:59,471 INFO L226 Difference]: Without dead ends: 10246 [2024-10-10 22:30:59,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,477 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:59,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10246 states. [2024-10-10 22:30:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10246 to 8196. [2024-10-10 22:30:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8196 states, 8195 states have (on average 1.5387431360585724) internal successors, (12610), 8195 states have internal predecessors, (12610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 12610 transitions. [2024-10-10 22:30:59,703 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 12610 transitions. Word has length 28 [2024-10-10 22:30:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:59,703 INFO L471 AbstractCegarLoop]: Abstraction has 8196 states and 12610 transitions. [2024-10-10 22:30:59,703 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-10-10 22:30:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 12610 transitions. [2024-10-10 22:30:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:30:59,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:59,713 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-10-10 22:30:59,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:30:59,713 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:59,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:59,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1866971715, now seen corresponding path program 1 times [2024-10-10 22:30:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:59,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692313584] [2024-10-10 22:30:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:59,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:59,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:59,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692313584] [2024-10-10 22:30:59,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692313584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:59,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20458347] [2024-10-10 22:30:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:59,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:59,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:59,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,743 INFO L87 Difference]: Start difference. First operand 8196 states and 12610 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-10-10 22:30:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:59,932 INFO L93 Difference]: Finished difference Result 19208 states and 29764 transitions. [2024-10-10 22:30:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:59,933 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-10-10 22:30:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:59,951 INFO L225 Difference]: With dead ends: 19208 [2024-10-10 22:30:59,952 INFO L226 Difference]: Without dead ends: 11142 [2024-10-10 22:30:59,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:59,962 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:59,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 217 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2024-10-10 22:31:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 11140. [2024-10-10 22:31:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11140 states, 11139 states have (on average 1.5399946135200646) internal successors, (17154), 11139 states have internal predecessors, (17154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11140 states to 11140 states and 17154 transitions. [2024-10-10 22:31:00,307 INFO L78 Accepts]: Start accepts. Automaton has 11140 states and 17154 transitions. Word has length 28 [2024-10-10 22:31:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,308 INFO L471 AbstractCegarLoop]: Abstraction has 11140 states and 17154 transitions. [2024-10-10 22:31:00,308 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-10-10 22:31:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 11140 states and 17154 transitions. [2024-10-10 22:31:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 22:31:00,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,320 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-10-10 22:31:00,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 22:31:00,320 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -352390460, now seen corresponding path program 1 times [2024-10-10 22:31:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600928222] [2024-10-10 22:31:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600928222] [2024-10-10 22:31:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600928222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801421929] [2024-10-10 22:31:00,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,358 INFO L87 Difference]: Start difference. First operand 11140 states and 17154 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-10-10 22:31:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:00,536 INFO L93 Difference]: Finished difference Result 16712 states and 25668 transitions. [2024-10-10 22:31:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:00,536 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-10-10 22:31:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:00,559 INFO L225 Difference]: With dead ends: 16712 [2024-10-10 22:31:00,559 INFO L226 Difference]: Without dead ends: 11270 [2024-10-10 22:31:00,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,571 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:00,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 209 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2024-10-10 22:31:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11268. [2024-10-10 22:31:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11268 states, 11267 states have (on average 1.5224993343392208) internal successors, (17154), 11267 states have internal predecessors, (17154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 17154 transitions. [2024-10-10 22:31:00,914 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 17154 transitions. Word has length 29 [2024-10-10 22:31:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:00,915 INFO L471 AbstractCegarLoop]: Abstraction has 11268 states and 17154 transitions. [2024-10-10 22:31:00,915 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-10-10 22:31:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 17154 transitions. [2024-10-10 22:31:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 22:31:00,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:00,927 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-10-10 22:31:00,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 22:31:00,927 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:00,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2041334202, now seen corresponding path program 1 times [2024-10-10 22:31:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:00,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492370953] [2024-10-10 22:31:00,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492370953] [2024-10-10 22:31:00,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492370953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:00,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:00,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204755246] [2024-10-10 22:31:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:00,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:00,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:00,956 INFO L87 Difference]: Start difference. First operand 11268 states and 17154 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-10-10 22:31:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:01,223 INFO L93 Difference]: Finished difference Result 19976 states and 31108 transitions. [2024-10-10 22:31:01,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:01,223 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-10-10 22:31:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:01,257 INFO L225 Difference]: With dead ends: 19976 [2024-10-10 22:31:01,258 INFO L226 Difference]: Without dead ends: 19974 [2024-10-10 22:31:01,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:01,263 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:01,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19974 states. [2024-10-10 22:31:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19974 to 16388. [2024-10-10 22:31:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16388 states, 16387 states have (on average 1.4764142307927015) internal successors, (24194), 16387 states have internal predecessors, (24194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16388 states to 16388 states and 24194 transitions. [2024-10-10 22:31:01,603 INFO L78 Accepts]: Start accepts. Automaton has 16388 states and 24194 transitions. Word has length 29 [2024-10-10 22:31:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:01,603 INFO L471 AbstractCegarLoop]: Abstraction has 16388 states and 24194 transitions. [2024-10-10 22:31:01,604 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-10-10 22:31:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 16388 states and 24194 transitions. [2024-10-10 22:31:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 22:31:01,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:01,621 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-10-10 22:31:01,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 22:31:01,622 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:01,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash 259488388, now seen corresponding path program 1 times [2024-10-10 22:31:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:01,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104244942] [2024-10-10 22:31:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:01,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:01,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:01,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104244942] [2024-10-10 22:31:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104244942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:01,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:01,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941037480] [2024-10-10 22:31:01,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:01,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:01,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:01,644 INFO L87 Difference]: Start difference. First operand 16388 states and 24194 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-10-10 22:31:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:02,005 INFO L93 Difference]: Finished difference Result 38152 states and 56708 transitions. [2024-10-10 22:31:02,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:02,006 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-10-10 22:31:02,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:02,045 INFO L225 Difference]: With dead ends: 38152 [2024-10-10 22:31:02,046 INFO L226 Difference]: Without dead ends: 22022 [2024-10-10 22:31:02,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-10-10 22:31:02,065 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:02,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 218 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2024-10-10 22:31:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 22020. [2024-10-10 22:31:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22020 states, 22019 states have (on average 1.4766338162496027) internal successors, (32514), 22019 states have internal predecessors, (32514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22020 states to 22020 states and 32514 transitions. [2024-10-10 22:31:02,620 INFO L78 Accepts]: Start accepts. Automaton has 22020 states and 32514 transitions. Word has length 29 [2024-10-10 22:31:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:02,620 INFO L471 AbstractCegarLoop]: Abstraction has 22020 states and 32514 transitions. [2024-10-10 22:31:02,621 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-10-10 22:31:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 22020 states and 32514 transitions. [2024-10-10 22:31:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-10 22:31:02,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:02,647 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-10-10 22:31:02,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 22:31:02,647 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:02,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1143363634, now seen corresponding path program 1 times [2024-10-10 22:31:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568355793] [2024-10-10 22:31:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:02,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:02,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568355793] [2024-10-10 22:31:02,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568355793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:02,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:02,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:02,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771199763] [2024-10-10 22:31:02,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:02,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:02,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:02,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:02,684 INFO L87 Difference]: Start difference. First operand 22020 states and 32514 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-10-10 22:31:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:02,979 INFO L93 Difference]: Finished difference Result 33032 states and 48644 transitions. [2024-10-10 22:31:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:02,979 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-10-10 22:31:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:03,014 INFO L225 Difference]: With dead ends: 33032 [2024-10-10 22:31:03,014 INFO L226 Difference]: Without dead ends: 22278 [2024-10-10 22:31:03,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:03,032 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:03,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22278 states. [2024-10-10 22:31:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22278 to 22276. [2024-10-10 22:31:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22276 states, 22275 states have (on average 1.4596632996632997) internal successors, (32514), 22275 states have internal predecessors, (32514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22276 states to 22276 states and 32514 transitions. [2024-10-10 22:31:03,545 INFO L78 Accepts]: Start accepts. Automaton has 22276 states and 32514 transitions. Word has length 30 [2024-10-10 22:31:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:03,546 INFO L471 AbstractCegarLoop]: Abstraction has 22276 states and 32514 transitions. [2024-10-10 22:31:03,546 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-10-10 22:31:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 22276 states and 32514 transitions. [2024-10-10 22:31:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-10 22:31:03,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:03,562 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-10-10 22:31:03,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-10 22:31:03,562 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:03,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash -545580108, now seen corresponding path program 1 times [2024-10-10 22:31:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:03,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790224689] [2024-10-10 22:31:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:03,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:03,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:03,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790224689] [2024-10-10 22:31:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790224689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:03,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490748970] [2024-10-10 22:31:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:03,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:03,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:03,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:03,597 INFO L87 Difference]: Start difference. First operand 22276 states and 32514 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-10-10 22:31:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:03,883 INFO L93 Difference]: Finished difference Result 38920 states and 58116 transitions. [2024-10-10 22:31:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:03,884 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-10-10 22:31:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:03,932 INFO L225 Difference]: With dead ends: 38920 [2024-10-10 22:31:03,932 INFO L226 Difference]: Without dead ends: 38918 [2024-10-10 22:31:03,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:03,949 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 46 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:03,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38918 states. [2024-10-10 22:31:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38918 to 32772. [2024-10-10 22:31:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32772 states, 32771 states have (on average 1.4139940801318238) internal successors, (46338), 32771 states have internal predecessors, (46338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32772 states to 32772 states and 46338 transitions. [2024-10-10 22:31:04,534 INFO L78 Accepts]: Start accepts. Automaton has 32772 states and 46338 transitions. Word has length 30 [2024-10-10 22:31:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:04,535 INFO L471 AbstractCegarLoop]: Abstraction has 32772 states and 46338 transitions. [2024-10-10 22:31:04,535 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-10-10 22:31:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 32772 states and 46338 transitions. [2024-10-10 22:31:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-10 22:31:04,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:04,646 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-10-10 22:31:04,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-10 22:31:04,646 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:04,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1755242482, now seen corresponding path program 1 times [2024-10-10 22:31:04,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:04,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922337258] [2024-10-10 22:31:04,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:04,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:04,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922337258] [2024-10-10 22:31:04,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922337258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261538710] [2024-10-10 22:31:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:04,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:04,672 INFO L87 Difference]: Start difference. First operand 32772 states and 46338 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-10-10 22:31:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:05,209 INFO L93 Difference]: Finished difference Result 75784 states and 107780 transitions. [2024-10-10 22:31:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:05,209 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-10-10 22:31:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:05,257 INFO L225 Difference]: With dead ends: 75784 [2024-10-10 22:31:05,257 INFO L226 Difference]: Without dead ends: 43526 [2024-10-10 22:31:05,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:05,293 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:05,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 219 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43526 states. [2024-10-10 22:31:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43526 to 43524. [2024-10-10 22:31:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43524 states, 43523 states have (on average 1.411713346965972) internal successors, (61442), 43523 states have internal predecessors, (61442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43524 states to 43524 states and 61442 transitions. [2024-10-10 22:31:06,118 INFO L78 Accepts]: Start accepts. Automaton has 43524 states and 61442 transitions. Word has length 30 [2024-10-10 22:31:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:06,118 INFO L471 AbstractCegarLoop]: Abstraction has 43524 states and 61442 transitions. [2024-10-10 22:31:06,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-10-10 22:31:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 43524 states and 61442 transitions. [2024-10-10 22:31:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:31:06,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:06,134 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-10-10 22:31:06,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-10 22:31:06,135 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:06,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash 267100633, now seen corresponding path program 1 times [2024-10-10 22:31:06,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215580720] [2024-10-10 22:31:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:06,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215580720] [2024-10-10 22:31:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215580720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:06,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:06,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:06,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968982550] [2024-10-10 22:31:06,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:06,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:06,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:06,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:06,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:06,159 INFO L87 Difference]: Start difference. First operand 43524 states and 61442 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-10-10 22:31:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:06,622 INFO L93 Difference]: Finished difference Result 65288 states and 91908 transitions. [2024-10-10 22:31:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:06,623 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-10-10 22:31:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:06,667 INFO L225 Difference]: With dead ends: 65288 [2024-10-10 22:31:06,667 INFO L226 Difference]: Without dead ends: 44038 [2024-10-10 22:31:06,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:06,682 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:06,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44038 states. [2024-10-10 22:31:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44038 to 44036. [2024-10-10 22:31:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44036 states, 44035 states have (on average 1.3952991938230952) internal successors, (61442), 44035 states have internal predecessors, (61442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44036 states to 44036 states and 61442 transitions. [2024-10-10 22:31:07,390 INFO L78 Accepts]: Start accepts. Automaton has 44036 states and 61442 transitions. Word has length 31 [2024-10-10 22:31:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:07,390 INFO L471 AbstractCegarLoop]: Abstraction has 44036 states and 61442 transitions. [2024-10-10 22:31:07,391 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-10-10 22:31:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 44036 states and 61442 transitions. [2024-10-10 22:31:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:31:07,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:07,411 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-10-10 22:31:07,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-10 22:31:07,412 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:07,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1421843109, now seen corresponding path program 1 times [2024-10-10 22:31:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876530355] [2024-10-10 22:31:07,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:07,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876530355] [2024-10-10 22:31:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876530355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:07,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:07,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:07,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811967797] [2024-10-10 22:31:07,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:07,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:07,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:07,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:07,433 INFO L87 Difference]: Start difference. First operand 44036 states and 61442 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-10-10 22:31:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:08,685 INFO L93 Difference]: Finished difference Result 129032 states and 178180 transitions. [2024-10-10 22:31:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:08,686 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-10-10 22:31:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:08,776 INFO L225 Difference]: With dead ends: 129032 [2024-10-10 22:31:08,776 INFO L226 Difference]: Without dead ends: 86022 [2024-10-10 22:31:08,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:08,813 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:08,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 184 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86022 states. [2024-10-10 22:31:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86022 to 86020. [2024-10-10 22:31:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86020 states, 86019 states have (on average 1.3571187760843535) internal successors, (116738), 86019 states have internal predecessors, (116738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86020 states to 86020 states and 116738 transitions. [2024-10-10 22:31:10,529 INFO L78 Accepts]: Start accepts. Automaton has 86020 states and 116738 transitions. Word has length 31 [2024-10-10 22:31:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:10,529 INFO L471 AbstractCegarLoop]: Abstraction has 86020 states and 116738 transitions. [2024-10-10 22:31:10,529 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-10-10 22:31:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 86020 states and 116738 transitions. [2024-10-10 22:31:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:31:10,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:10,563 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-10-10 22:31:10,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-10 22:31:10,563 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:10,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:10,563 INFO L85 PathProgramCache]: Analyzing trace with hash 572301597, now seen corresponding path program 1 times [2024-10-10 22:31:10,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:10,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749908474] [2024-10-10 22:31:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:10,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:10,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749908474] [2024-10-10 22:31:10,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749908474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:10,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:10,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451261412] [2024-10-10 22:31:10,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:10,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:10,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:10,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:10,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:10,582 INFO L87 Difference]: Start difference. First operand 86020 states and 116738 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-10-10 22:31:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:11,754 INFO L93 Difference]: Finished difference Result 96264 states and 135172 transitions. [2024-10-10 22:31:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:11,755 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-10-10 22:31:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:11,860 INFO L225 Difference]: With dead ends: 96264 [2024-10-10 22:31:11,860 INFO L226 Difference]: Without dead ends: 96262 [2024-10-10 22:31:11,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:11,881 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 43 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:11,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 217 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96262 states. [2024-10-10 22:31:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96262 to 86020. [2024-10-10 22:31:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86020 states, 86019 states have (on average 1.3452144293702555) internal successors, (115714), 86019 states have internal predecessors, (115714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86020 states to 86020 states and 115714 transitions. [2024-10-10 22:31:13,450 INFO L78 Accepts]: Start accepts. Automaton has 86020 states and 115714 transitions. Word has length 31 [2024-10-10 22:31:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:13,451 INFO L471 AbstractCegarLoop]: Abstraction has 86020 states and 115714 transitions. [2024-10-10 22:31:13,451 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-10-10 22:31:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 86020 states and 115714 transitions. [2024-10-10 22:31:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 22:31:13,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:13,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:13,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-10 22:31:13,481 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:13,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1127248281, now seen corresponding path program 1 times [2024-10-10 22:31:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:13,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208628613] [2024-10-10 22:31:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:13,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-10-10 22:31:13,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:13,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208628613] [2024-10-10 22:31:13,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208628613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:13,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:13,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:13,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506819578] [2024-10-10 22:31:13,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:13,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:13,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:13,505 INFO L87 Difference]: Start difference. First operand 86020 states and 115714 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-10-10 22:31:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:15,349 INFO L93 Difference]: Finished difference Result 146440 states and 200708 transitions. [2024-10-10 22:31:15,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:15,350 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-10-10 22:31:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:15,499 INFO L225 Difference]: With dead ends: 146440 [2024-10-10 22:31:15,499 INFO L226 Difference]: Without dead ends: 146438 [2024-10-10 22:31:15,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:15,522 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 40 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:15,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146438 states. [2024-10-10 22:31:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146438 to 130052. [2024-10-10 22:31:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130052 states, 130051 states have (on average 1.307071841046974) internal successors, (169986), 130051 states have internal predecessors, (169986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130052 states to 130052 states and 169986 transitions. [2024-10-10 22:31:17,785 INFO L78 Accepts]: Start accepts. Automaton has 130052 states and 169986 transitions. Word has length 32 [2024-10-10 22:31:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:17,786 INFO L471 AbstractCegarLoop]: Abstraction has 130052 states and 169986 transitions. [2024-10-10 22:31:17,786 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-10-10 22:31:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 130052 states and 169986 transitions. [2024-10-10 22:31:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 22:31:17,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:17,862 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-10-10 22:31:17,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-10 22:31:17,863 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:17,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1173574309, now seen corresponding path program 1 times [2024-10-10 22:31:17,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:17,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34803739] [2024-10-10 22:31:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:17,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:17,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34803739] [2024-10-10 22:31:17,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34803739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:17,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:17,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:17,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944868526] [2024-10-10 22:31:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:17,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:17,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:17,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:17,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:17,887 INFO L87 Difference]: Start difference. First operand 130052 states and 169986 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-10-10 22:31:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:20,124 INFO L93 Difference]: Finished difference Result 297992 states and 391172 transitions. [2024-10-10 22:31:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:20,125 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-10-10 22:31:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:20,357 INFO L225 Difference]: With dead ends: 297992 [2024-10-10 22:31:20,357 INFO L226 Difference]: Without dead ends: 168966 [2024-10-10 22:31:20,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:20,421 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:20,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 221 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168966 states. [2024-10-10 22:31:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168966 to 168964. [2024-10-10 22:31:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168964 states, 168963 states have (on average 1.2969585057083504) internal successors, (219138), 168963 states have internal predecessors, (219138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168964 states to 168964 states and 219138 transitions. [2024-10-10 22:31:24,181 INFO L78 Accepts]: Start accepts. Automaton has 168964 states and 219138 transitions. Word has length 32 [2024-10-10 22:31:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:24,181 INFO L471 AbstractCegarLoop]: Abstraction has 168964 states and 219138 transitions. [2024-10-10 22:31:24,181 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-10-10 22:31:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 168964 states and 219138 transitions. [2024-10-10 22:31:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 22:31:24,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:24,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:24,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-10 22:31:24,279 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:24,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:24,279 INFO L85 PathProgramCache]: Analyzing trace with hash -584742864, now seen corresponding path program 1 times [2024-10-10 22:31:24,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:24,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776282801] [2024-10-10 22:31:24,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:24,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:24,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:24,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776282801] [2024-10-10 22:31:24,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776282801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:24,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:24,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:24,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751775680] [2024-10-10 22:31:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:24,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:24,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:24,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:24,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:24,299 INFO L87 Difference]: Start difference. First operand 168964 states and 219138 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:26,386 INFO L93 Difference]: Finished difference Result 254984 states and 330756 transitions. [2024-10-10 22:31:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:26,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-10 22:31:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:26,587 INFO L225 Difference]: With dead ends: 254984 [2024-10-10 22:31:26,587 INFO L226 Difference]: Without dead ends: 172038 [2024-10-10 22:31:26,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:26,658 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:26,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172038 states. [2024-10-10 22:31:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172038 to 172036. [2024-10-10 22:31:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172036 states, 172035 states have (on average 1.2857034905687796) internal successors, (221186), 172035 states have internal predecessors, (221186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172036 states to 172036 states and 221186 transitions. [2024-10-10 22:31:30,005 INFO L78 Accepts]: Start accepts. Automaton has 172036 states and 221186 transitions. Word has length 33 [2024-10-10 22:31:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:30,006 INFO L471 AbstractCegarLoop]: Abstraction has 172036 states and 221186 transitions. [2024-10-10 22:31:30,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 172036 states and 221186 transitions. [2024-10-10 22:31:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 22:31:30,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:30,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:30,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-10 22:31:30,091 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:30,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:30,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2021280690, now seen corresponding path program 1 times [2024-10-10 22:31:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:30,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490094039] [2024-10-10 22:31:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:30,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:30,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490094039] [2024-10-10 22:31:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490094039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872130361] [2024-10-10 22:31:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:30,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:30,115 INFO L87 Difference]: Start difference. First operand 172036 states and 221186 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:33,300 INFO L93 Difference]: Finished difference Result 286728 states and 372740 transitions. [2024-10-10 22:31:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:33,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-10 22:31:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:33,697 INFO L225 Difference]: With dead ends: 286728 [2024-10-10 22:31:33,698 INFO L226 Difference]: Without dead ends: 286726 [2024-10-10 22:31:33,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:33,761 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 37 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:33,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:31:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286726 states. [2024-10-10 22:31:37,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286726 to 262148. [2024-10-10 22:31:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262148 states, 262147 states have (on average 1.2499933243561818) internal successors, (327682), 262147 states have internal predecessors, (327682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)