./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label17.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/eca-rers2012/Problem13_label17.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 e8f177d03f4f60423a896dbe491efae793eb2062a8d25f45f05aed5ed36051f8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:27:29,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:27:29,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:27:29,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:27:29,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:27:29,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:27:29,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:27:29,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:27:29,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:27:29,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:27:29,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:27:29,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:27:29,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:27:29,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:27:29,717 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:27:29,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:27:29,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:27:29,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:27:29,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:27:29,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:27:29,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:27:29,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:27:29,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:27:29,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:27:29,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:27:29,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:27:29,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:27:29,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:27:29,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:27:29,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:27:29,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:27:29,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:27:29,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:27:29,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:27:29,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:27:29,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:27:29,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:27:29,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:27:29,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:27:29,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:27:29,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:27:29,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:27:29,726 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 -> e8f177d03f4f60423a896dbe491efae793eb2062a8d25f45f05aed5ed36051f8 [2024-10-10 23:27:29,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:27:29,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:27:29,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:27:29,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:27:29,957 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:27:29,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label17.c [2024-10-10 23:27:31,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:27:31,541 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:27:31,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label17.c [2024-10-10 23:27:31,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/73044fbef/9e7223cf5e504c1abb6edd3e1e9c6096/FLAGc2425ca81 [2024-10-10 23:27:31,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/73044fbef/9e7223cf5e504c1abb6edd3e1e9c6096 [2024-10-10 23:27:31,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:27:31,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:27:31,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:27:31,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:27:31,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:27:31,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:27:31" (1/1) ... [2024-10-10 23:27:31,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8b28f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:31, skipping insertion in model container [2024-10-10 23:27:31,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:27:31" (1/1) ... [2024-10-10 23:27:31,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:27:31,925 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/eca-rers2012/Problem13_label17.c[4917,4930] [2024-10-10 23:27:32,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:27:32,570 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:27:32,585 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/eca-rers2012/Problem13_label17.c[4917,4930] [2024-10-10 23:27:32,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:27:32,980 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:27:32,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32 WrapperNode [2024-10-10 23:27:32,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:27:32,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:27:32,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:27:32,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:27:32,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:33,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:33,457 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:27:33,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:27:33,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:27:33,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:27:33,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:27:33,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:33,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:33,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:33,845 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 23:27:33,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:33,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:33,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:33,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:34,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:34,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:34,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:27:34,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:27:34,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:27:34,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:27:34,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (1/1) ... [2024-10-10 23:27:34,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:27:34,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:27:34,151 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 23:27:34,156 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 23:27:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:27:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:27:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:27:34,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:27:34,242 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:27:34,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:27:38,860 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:27:38,860 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:27:38,922 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:27:38,926 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:27:38,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:27:38 BoogieIcfgContainer [2024-10-10 23:27:38,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:27:38,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:27:38,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:27:38,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:27:38,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:27:31" (1/3) ... [2024-10-10 23:27:38,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790a86f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:27:38, skipping insertion in model container [2024-10-10 23:27:38,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:27:32" (2/3) ... [2024-10-10 23:27:38,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790a86f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:27:38, skipping insertion in model container [2024-10-10 23:27:38,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:27:38" (3/3) ... [2024-10-10 23:27:38,933 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label17.c [2024-10-10 23:27:38,945 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:27:38,945 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:27:39,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:27:39,031 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;@237b29fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:27:39,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:27:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 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 23:27:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 23:27:39,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:39,042 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 23:27:39,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:39,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:39,045 INFO L85 PathProgramCache]: Analyzing trace with hash 25751348, now seen corresponding path program 1 times [2024-10-10 23:27:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848395048] [2024-10-10 23:27:39,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:39,177 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 23:27:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:39,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848395048] [2024-10-10 23:27:39,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848395048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:39,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:39,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:39,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513410401] [2024-10-10 23:27:39,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:39,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:27:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:27:39,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:27:39,201 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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 2 states, 2 states have (on average 16.0) internal successors, (32), 2 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 23:27:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:39,275 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:27:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:27:39,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 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 23:27:39,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:39,296 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:27:39,296 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:27:39,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:27:39,304 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:39,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:27:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:27:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:27:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 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 23:27:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:27:39,372 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 32 [2024-10-10 23:27:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:39,372 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:27:39,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 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 23:27:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:27:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 23:27:39,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:39,373 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 23:27:39,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:27:39,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:39,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:39,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1066878320, now seen corresponding path program 1 times [2024-10-10 23:27:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:39,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332168007] [2024-10-10 23:27:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:39,512 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 23:27:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:39,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332168007] [2024-10-10 23:27:39,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332168007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:39,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682326543] [2024-10-10 23:27:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:39,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:39,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:39,516 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 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 23:27:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:42,757 INFO L93 Difference]: Finished difference Result 2905 states and 5325 transitions. [2024-10-10 23:27:42,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:42,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 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 23:27:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:42,765 INFO L225 Difference]: With dead ends: 2905 [2024-10-10 23:27:42,766 INFO L226 Difference]: Without dead ends: 1872 [2024-10-10 23:27:42,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:42,769 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 856 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 3244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:42,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1090 Invalid, 3244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:27:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2024-10-10 23:27:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1858. [2024-10-10 23:27:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.5444264943457189) internal successors, (2868), 1857 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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 23:27:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2868 transitions. [2024-10-10 23:27:42,802 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2868 transitions. Word has length 32 [2024-10-10 23:27:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:42,803 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2868 transitions. [2024-10-10 23:27:42,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 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 23:27:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2868 transitions. [2024-10-10 23:27:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-10 23:27:42,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:42,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:27:42,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:27:42,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:42,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash -83592956, now seen corresponding path program 1 times [2024-10-10 23:27:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:42,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680735539] [2024-10-10 23:27:42,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:43,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:43,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680735539] [2024-10-10 23:27:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680735539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:43,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:43,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441441380] [2024-10-10 23:27:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:43,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:43,031 INFO L87 Difference]: Start difference. First operand 1858 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:45,766 INFO L93 Difference]: Finished difference Result 5316 states and 8228 transitions. [2024-10-10 23:27:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:45,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-10 23:27:45,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:45,777 INFO L225 Difference]: With dead ends: 5316 [2024-10-10 23:27:45,777 INFO L226 Difference]: Without dead ends: 3459 [2024-10-10 23:27:45,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:45,783 INFO L432 NwaCegarLoop]: 1037 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:45,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1190 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:27:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2024-10-10 23:27:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3458. [2024-10-10 23:27:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3457 states have (on average 1.380676887474689) internal successors, (4773), 3457 states have internal predecessors, (4773), 0 states have call successors, (0), 0 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 23:27:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4773 transitions. [2024-10-10 23:27:45,831 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4773 transitions. Word has length 104 [2024-10-10 23:27:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:45,831 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 4773 transitions. [2024-10-10 23:27:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4773 transitions. [2024-10-10 23:27:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-10 23:27:45,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:45,833 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:27:45,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:27:45,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:45,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1639446931, now seen corresponding path program 1 times [2024-10-10 23:27:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286961754] [2024-10-10 23:27:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286961754] [2024-10-10 23:27:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286961754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:46,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271791846] [2024-10-10 23:27:46,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:46,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:27:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:46,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:27:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:27:46,209 INFO L87 Difference]: Start difference. First operand 3458 states and 4773 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:50,076 INFO L93 Difference]: Finished difference Result 10869 states and 14767 transitions. [2024-10-10 23:27:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:27:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-10-10 23:27:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:50,097 INFO L225 Difference]: With dead ends: 10869 [2024-10-10 23:27:50,098 INFO L226 Difference]: Without dead ends: 7412 [2024-10-10 23:27:50,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:27:50,108 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 2581 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 4118 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2581 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 4949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 4118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:50,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2581 Valid, 1001 Invalid, 4949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 4118 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-10 23:27:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7412 states. [2024-10-10 23:27:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7412 to 7411. [2024-10-10 23:27:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7411 states, 7410 states have (on average 1.269905533063428) internal successors, (9410), 7410 states have internal predecessors, (9410), 0 states have call successors, (0), 0 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 23:27:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7411 states to 7411 states and 9410 transitions. [2024-10-10 23:27:50,210 INFO L78 Accepts]: Start accepts. Automaton has 7411 states and 9410 transitions. Word has length 118 [2024-10-10 23:27:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:50,212 INFO L471 AbstractCegarLoop]: Abstraction has 7411 states and 9410 transitions. [2024-10-10 23:27:50,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7411 states and 9410 transitions. [2024-10-10 23:27:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-10 23:27:50,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:50,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:50,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:27:50,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:50,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1268394060, now seen corresponding path program 1 times [2024-10-10 23:27:50,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:50,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359190827] [2024-10-10 23:27:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:27:50,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:50,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359190827] [2024-10-10 23:27:50,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359190827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:50,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:50,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:50,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961412805] [2024-10-10 23:27:50,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:50,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:50,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:50,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:50,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:50,412 INFO L87 Difference]: Start difference. First operand 7411 states and 9410 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 23:27:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:53,378 INFO L93 Difference]: Finished difference Result 20354 states and 26250 transitions. [2024-10-10 23:27:53,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:53,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 199 [2024-10-10 23:27:53,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:53,421 INFO L225 Difference]: With dead ends: 20354 [2024-10-10 23:27:53,422 INFO L226 Difference]: Without dead ends: 13731 [2024-10-10 23:27:53,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:53,433 INFO L432 NwaCegarLoop]: 848 mSDtfsCounter, 888 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:53,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 976 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [748 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:27:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13731 states. [2024-10-10 23:27:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13731 to 12936. [2024-10-10 23:27:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12936 states, 12935 states have (on average 1.2152299961345188) internal successors, (15719), 12935 states have internal predecessors, (15719), 0 states have call successors, (0), 0 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 23:27:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12936 states to 12936 states and 15719 transitions. [2024-10-10 23:27:53,603 INFO L78 Accepts]: Start accepts. Automaton has 12936 states and 15719 transitions. Word has length 199 [2024-10-10 23:27:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:53,604 INFO L471 AbstractCegarLoop]: Abstraction has 12936 states and 15719 transitions. [2024-10-10 23:27:53,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 23:27:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 12936 states and 15719 transitions. [2024-10-10 23:27:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-10 23:27:53,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:53,607 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:53,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:27:53,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:53,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1376274844, now seen corresponding path program 1 times [2024-10-10 23:27:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:53,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932639018] [2024-10-10 23:27:53,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932639018] [2024-10-10 23:27:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932639018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527377577] [2024-10-10 23:27:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:53,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:53,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:53,773 INFO L87 Difference]: Start difference. First operand 12936 states and 15719 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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 23:27:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:56,709 INFO L93 Difference]: Finished difference Result 31391 states and 39118 transitions. [2024-10-10 23:27:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:56,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2024-10-10 23:27:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:56,743 INFO L225 Difference]: With dead ends: 31391 [2024-10-10 23:27:56,743 INFO L226 Difference]: Without dead ends: 19243 [2024-10-10 23:27:56,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:56,752 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 857 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:56,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 924 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:27:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19243 states. [2024-10-10 23:27:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19243 to 18446. [2024-10-10 23:27:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18446 states, 18445 states have (on average 1.20243968555164) internal successors, (22179), 18445 states have internal predecessors, (22179), 0 states have call successors, (0), 0 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 23:27:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18446 states to 18446 states and 22179 transitions. [2024-10-10 23:27:56,930 INFO L78 Accepts]: Start accepts. Automaton has 18446 states and 22179 transitions. Word has length 231 [2024-10-10 23:27:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:56,931 INFO L471 AbstractCegarLoop]: Abstraction has 18446 states and 22179 transitions. [2024-10-10 23:27:56,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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 23:27:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 18446 states and 22179 transitions. [2024-10-10 23:27:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-10 23:27:56,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:56,937 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:56,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:27:56,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:56,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash -223924975, now seen corresponding path program 1 times [2024-10-10 23:27:56,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:56,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840081091] [2024-10-10 23:27:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:56,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:27:57,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:57,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840081091] [2024-10-10 23:27:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840081091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:57,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:57,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435066450] [2024-10-10 23:27:57,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:57,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:27:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:57,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:27:57,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:27:57,410 INFO L87 Difference]: Start difference. First operand 18446 states and 22179 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 23:28:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:01,500 INFO L93 Difference]: Finished difference Result 59760 states and 73267 transitions. [2024-10-10 23:28:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:28:01,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 320 [2024-10-10 23:28:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:01,564 INFO L225 Difference]: With dead ends: 59760 [2024-10-10 23:28:01,564 INFO L226 Difference]: Without dead ends: 42102 [2024-10-10 23:28:01,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:28:01,583 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 1639 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 5343 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 6220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 5343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:01,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 912 Invalid, 6220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 5343 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-10 23:28:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42102 states. [2024-10-10 23:28:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42102 to 42100. [2024-10-10 23:28:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42100 states, 42099 states have (on average 1.1869640609040595) internal successors, (49970), 42099 states have internal predecessors, (49970), 0 states have call successors, (0), 0 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 23:28:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42100 states to 42100 states and 49970 transitions. [2024-10-10 23:28:01,964 INFO L78 Accepts]: Start accepts. Automaton has 42100 states and 49970 transitions. Word has length 320 [2024-10-10 23:28:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:01,964 INFO L471 AbstractCegarLoop]: Abstraction has 42100 states and 49970 transitions. [2024-10-10 23:28:01,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 23:28:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 42100 states and 49970 transitions. [2024-10-10 23:28:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-10 23:28:01,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:01,968 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:01,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:28:01,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:01,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash 882662293, now seen corresponding path program 1 times [2024-10-10 23:28:01,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:01,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102230215] [2024-10-10 23:28:01,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:01,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 23:28:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:02,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102230215] [2024-10-10 23:28:02,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102230215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:02,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658624146] [2024-10-10 23:28:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:02,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:28:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:02,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:28:02,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:28:02,178 INFO L87 Difference]: Start difference. First operand 42100 states and 49970 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 23:28:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:07,599 INFO L93 Difference]: Finished difference Result 142667 states and 170380 transitions. [2024-10-10 23:28:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:28:07,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 320 [2024-10-10 23:28:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:07,741 INFO L225 Difference]: With dead ends: 142667 [2024-10-10 23:28:07,741 INFO L226 Difference]: Without dead ends: 101355 [2024-10-10 23:28:07,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:28:07,795 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 1738 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 6066 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 7253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 6066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:07,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 686 Invalid, 7253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 6066 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-10 23:28:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101355 states. [2024-10-10 23:28:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101355 to 100435. [2024-10-10 23:28:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100435 states, 100434 states have (on average 1.1701515423063902) internal successors, (117523), 100434 states have internal predecessors, (117523), 0 states have call successors, (0), 0 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 23:28:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100435 states to 100435 states and 117523 transitions. [2024-10-10 23:28:08,926 INFO L78 Accepts]: Start accepts. Automaton has 100435 states and 117523 transitions. Word has length 320 [2024-10-10 23:28:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:08,926 INFO L471 AbstractCegarLoop]: Abstraction has 100435 states and 117523 transitions. [2024-10-10 23:28:08,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 23:28:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 100435 states and 117523 transitions. [2024-10-10 23:28:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-10 23:28:08,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:08,930 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:08,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:28:08,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:08,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:08,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1268567284, now seen corresponding path program 1 times [2024-10-10 23:28:08,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:08,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16472205] [2024-10-10 23:28:08,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:08,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-10 23:28:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16472205] [2024-10-10 23:28:09,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16472205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:09,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:09,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148137200] [2024-10-10 23:28:09,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:09,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:09,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:09,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:09,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:09,179 INFO L87 Difference]: Start difference. First operand 100435 states and 117523 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 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 23:28:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:12,610 INFO L93 Difference]: Finished difference Result 189846 states and 223206 transitions. [2024-10-10 23:28:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:12,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 329 [2024-10-10 23:28:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:12,742 INFO L225 Difference]: With dead ends: 189846 [2024-10-10 23:28:12,743 INFO L226 Difference]: Without dead ends: 100443 [2024-10-10 23:28:12,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:12,929 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 728 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:12,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1198 Invalid, 2709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:28:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100443 states. [2024-10-10 23:28:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100443 to 100435. [2024-10-10 23:28:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100435 states, 100434 states have (on average 1.1695043511161558) internal successors, (117458), 100434 states have internal predecessors, (117458), 0 states have call successors, (0), 0 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 23:28:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100435 states to 100435 states and 117458 transitions. [2024-10-10 23:28:14,059 INFO L78 Accepts]: Start accepts. Automaton has 100435 states and 117458 transitions. Word has length 329 [2024-10-10 23:28:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:14,060 INFO L471 AbstractCegarLoop]: Abstraction has 100435 states and 117458 transitions. [2024-10-10 23:28:14,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 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 23:28:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 100435 states and 117458 transitions. [2024-10-10 23:28:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-10 23:28:14,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:14,063 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:14,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:28:14,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:14,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash -535187638, now seen corresponding path program 1 times [2024-10-10 23:28:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276359809] [2024-10-10 23:28:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 230 proven. 113 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 23:28:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:15,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276359809] [2024-10-10 23:28:15,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276359809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:28:15,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975989960] [2024-10-10 23:28:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:15,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:15,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:28:15,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:28:15,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:28:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:15,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:28:15,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:28:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-10 23:28:15,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:28:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975989960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:28:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:28:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457414989] [2024-10-10 23:28:15,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:15,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:15,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:15,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:28:15,795 INFO L87 Difference]: Start difference. First operand 100435 states and 117458 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 23:28:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:18,640 INFO L93 Difference]: Finished difference Result 200081 states and 234123 transitions. [2024-10-10 23:28:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 358 [2024-10-10 23:28:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:18,768 INFO L225 Difference]: With dead ends: 200081 [2024-10-10 23:28:18,768 INFO L226 Difference]: Without dead ends: 100434 [2024-10-10 23:28:18,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:28:18,812 INFO L432 NwaCegarLoop]: 1362 mSDtfsCounter, 1123 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:18,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1443 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:28:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100434 states. [2024-10-10 23:28:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100434 to 99645. [2024-10-10 23:28:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99645 states, 99644 states have (on average 1.124011480871904) internal successors, (112001), 99644 states have internal predecessors, (112001), 0 states have call successors, (0), 0 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 23:28:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99645 states to 99645 states and 112001 transitions. [2024-10-10 23:28:19,957 INFO L78 Accepts]: Start accepts. Automaton has 99645 states and 112001 transitions. Word has length 358 [2024-10-10 23:28:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:19,957 INFO L471 AbstractCegarLoop]: Abstraction has 99645 states and 112001 transitions. [2024-10-10 23:28:19,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 23:28:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 99645 states and 112001 transitions. [2024-10-10 23:28:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-10-10 23:28:19,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:19,962 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:19,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:28:20,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:28:20,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:20,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1326703159, now seen corresponding path program 1 times [2024-10-10 23:28:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:20,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022217946] [2024-10-10 23:28:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-10 23:28:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022217946] [2024-10-10 23:28:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022217946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:20,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67362967] [2024-10-10 23:28:20,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:20,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:20,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:20,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:20,619 INFO L87 Difference]: Start difference. First operand 99645 states and 112001 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:24,318 INFO L93 Difference]: Finished difference Result 226844 states and 257622 transitions. [2024-10-10 23:28:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:24,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 388 [2024-10-10 23:28:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:24,470 INFO L225 Difference]: With dead ends: 226844 [2024-10-10 23:28:24,470 INFO L226 Difference]: Without dead ends: 127987 [2024-10-10 23:28:24,498 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 23:28:24,499 INFO L432 NwaCegarLoop]: 866 mSDtfsCounter, 887 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:24,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 951 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:28:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127987 states. [2024-10-10 23:28:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127987 to 126393. [2024-10-10 23:28:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126393 states, 126392 states have (on average 1.1274526868789163) internal successors, (142501), 126392 states have internal predecessors, (142501), 0 states have call successors, (0), 0 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 23:28:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126393 states to 126393 states and 142501 transitions. [2024-10-10 23:28:26,015 INFO L78 Accepts]: Start accepts. Automaton has 126393 states and 142501 transitions. Word has length 388 [2024-10-10 23:28:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:26,016 INFO L471 AbstractCegarLoop]: Abstraction has 126393 states and 142501 transitions. [2024-10-10 23:28:26,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 126393 states and 142501 transitions. [2024-10-10 23:28:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-10 23:28:26,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:26,026 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:26,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:28:26,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:26,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:26,027 INFO L85 PathProgramCache]: Analyzing trace with hash 393463588, now seen corresponding path program 1 times [2024-10-10 23:28:26,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:26,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719655834] [2024-10-10 23:28:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:26,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:28:26,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:26,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719655834] [2024-10-10 23:28:26,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719655834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:26,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:26,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:26,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067859004] [2024-10-10 23:28:26,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:26,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:26,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:26,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:26,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:26,591 INFO L87 Difference]: Start difference. First operand 126393 states and 142501 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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 23:28:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:29,996 INFO L93 Difference]: Finished difference Result 281132 states and 319658 transitions. [2024-10-10 23:28:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:29,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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) Word has length 426 [2024-10-10 23:28:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:30,188 INFO L225 Difference]: With dead ends: 281132 [2024-10-10 23:28:30,189 INFO L226 Difference]: Without dead ends: 155527 [2024-10-10 23:28:30,231 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 23:28:30,231 INFO L432 NwaCegarLoop]: 1785 mSDtfsCounter, 779 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:30,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1935 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:28:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155527 states. [2024-10-10 23:28:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155527 to 153936. [2024-10-10 23:28:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153936 states, 153935 states have (on average 1.1109169454639944) internal successors, (171009), 153935 states have internal predecessors, (171009), 0 states have call successors, (0), 0 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 23:28:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153936 states to 153936 states and 171009 transitions. [2024-10-10 23:28:32,131 INFO L78 Accepts]: Start accepts. Automaton has 153936 states and 171009 transitions. Word has length 426 [2024-10-10 23:28:32,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:32,131 INFO L471 AbstractCegarLoop]: Abstraction has 153936 states and 171009 transitions. [2024-10-10 23:28:32,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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 23:28:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 153936 states and 171009 transitions. [2024-10-10 23:28:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-10-10 23:28:32,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:32,149 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:32,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:28:32,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:32,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:32,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1870514878, now seen corresponding path program 1 times [2024-10-10 23:28:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:32,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762145964] [2024-10-10 23:28:32,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:32,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-10-10 23:28:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762145964] [2024-10-10 23:28:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762145964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:32,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:32,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229052255] [2024-10-10 23:28:32,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:32,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:32,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:32,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:32,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:32,794 INFO L87 Difference]: Start difference. First operand 153936 states and 171009 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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 23:28:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:35,834 INFO L93 Difference]: Finished difference Result 307094 states and 341245 transitions. [2024-10-10 23:28:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:35,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 545 [2024-10-10 23:28:35,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:36,042 INFO L225 Difference]: With dead ends: 307094 [2024-10-10 23:28:36,042 INFO L226 Difference]: Without dead ends: 153946 [2024-10-10 23:28:36,386 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 23:28:36,390 INFO L432 NwaCegarLoop]: 1414 mSDtfsCounter, 936 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:36,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1505 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:28:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153946 states. [2024-10-10 23:28:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153946 to 153929. [2024-10-10 23:28:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153929 states, 153928 states have (on average 1.0836884777298477) internal successors, (166810), 153928 states have internal predecessors, (166810), 0 states have call successors, (0), 0 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 23:28:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153929 states to 153929 states and 166810 transitions. [2024-10-10 23:28:38,156 INFO L78 Accepts]: Start accepts. Automaton has 153929 states and 166810 transitions. Word has length 545 [2024-10-10 23:28:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:38,156 INFO L471 AbstractCegarLoop]: Abstraction has 153929 states and 166810 transitions. [2024-10-10 23:28:38,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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 23:28:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 153929 states and 166810 transitions. [2024-10-10 23:28:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2024-10-10 23:28:38,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:38,501 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:38,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:28:38,506 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:38,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:38,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1987078437, now seen corresponding path program 1 times [2024-10-10 23:28:38,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:38,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427842309] [2024-10-10 23:28:38,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-10 23:28:38,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:38,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427842309] [2024-10-10 23:28:38,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427842309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:38,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:38,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:38,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501037189] [2024-10-10 23:28:38,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:38,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:38,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:38,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:38,786 INFO L87 Difference]: Start difference. First operand 153929 states and 166810 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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 23:28:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:41,671 INFO L93 Difference]: Finished difference Result 314916 states and 340709 transitions. [2024-10-10 23:28:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:41,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 581 [2024-10-10 23:28:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:41,870 INFO L225 Difference]: With dead ends: 314916 [2024-10-10 23:28:41,871 INFO L226 Difference]: Without dead ends: 158627 [2024-10-10 23:28:41,951 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 23:28:41,951 INFO L432 NwaCegarLoop]: 1490 mSDtfsCounter, 1018 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:41,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 1622 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:28:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158627 states. [2024-10-10 23:28:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158627 to 147598. [2024-10-10 23:28:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147598 states, 147597 states have (on average 1.0591881948820099) internal successors, (156333), 147597 states have internal predecessors, (156333), 0 states have call successors, (0), 0 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 23:28:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147598 states to 147598 states and 156333 transitions. [2024-10-10 23:28:44,138 INFO L78 Accepts]: Start accepts. Automaton has 147598 states and 156333 transitions. Word has length 581 [2024-10-10 23:28:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:44,139 INFO L471 AbstractCegarLoop]: Abstraction has 147598 states and 156333 transitions. [2024-10-10 23:28:44,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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 23:28:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 147598 states and 156333 transitions. [2024-10-10 23:28:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2024-10-10 23:28:44,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:44,157 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:44,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:28:44,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:44,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash 729317949, now seen corresponding path program 1 times [2024-10-10 23:28:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669360348] [2024-10-10 23:28:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2024-10-10 23:28:45,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:45,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669360348] [2024-10-10 23:28:45,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669360348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:45,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:45,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:45,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044315406] [2024-10-10 23:28:45,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:45,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:45,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:45,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:45,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:45,057 INFO L87 Difference]: Start difference. First operand 147598 states and 156333 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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 23:28:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:48,022 INFO L93 Difference]: Finished difference Result 288870 states and 306825 transitions. [2024-10-10 23:28:48,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:48,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 586 [2024-10-10 23:28:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:48,198 INFO L225 Difference]: With dead ends: 288870 [2024-10-10 23:28:48,199 INFO L226 Difference]: Without dead ends: 157019 [2024-10-10 23:28:48,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 23:28:48,273 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 1180 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:48,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 360 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [770 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:28:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157019 states. [2024-10-10 23:28:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157019 to 157019. [2024-10-10 23:28:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157019 states, 157018 states have (on average 1.0568278796061599) internal successors, (165941), 157018 states have internal predecessors, (165941), 0 states have call successors, (0), 0 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 23:28:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157019 states to 157019 states and 165941 transitions. [2024-10-10 23:28:50,348 INFO L78 Accepts]: Start accepts. Automaton has 157019 states and 165941 transitions. Word has length 586 [2024-10-10 23:28:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:50,348 INFO L471 AbstractCegarLoop]: Abstraction has 157019 states and 165941 transitions. [2024-10-10 23:28:50,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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 23:28:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 157019 states and 165941 transitions. [2024-10-10 23:28:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2024-10-10 23:28:50,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:50,365 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:28:50,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:28:50,365 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:50,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1751949945, now seen corresponding path program 1 times [2024-10-10 23:28:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655766824] [2024-10-10 23:28:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:50,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-10 23:28:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655766824] [2024-10-10 23:28:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655766824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:51,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:51,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:28:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588596438] [2024-10-10 23:28:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:51,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:28:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:28:51,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:28:51,135 INFO L87 Difference]: Start difference. First operand 157019 states and 165941 transitions. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)