./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/Problem03_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label55.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 892d3c9e0b7c167d810581087b0633fb7bb5cd8a7fe1ab934154adc1945085ff --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:20:58,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:20:58,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:20:58,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:20:58,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:20:58,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:20:58,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:20:58,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:20:58,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:20:58,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:20:58,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:20:58,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:20:58,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:20:58,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:20:58,733 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:20:58,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:20:58,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:20:58,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:20:58,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:20:58,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:20:58,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:20:58,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:20:58,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:20:58,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:20:58,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:20:58,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:20:58,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:20:58,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:20:58,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:20:58,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:20:58,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:20:58,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:20:58,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:20:58,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:20:58,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:20:58,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:20:58,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:20:58,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:20:58,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:20:58,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:20:58,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:20:58,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:20:58,747 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 892d3c9e0b7c167d810581087b0633fb7bb5cd8a7fe1ab934154adc1945085ff [2024-10-12 15:20:59,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:20:59,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:20:59,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:20:59,055 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:20:59,055 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:20:59,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label55.c [2024-10-12 15:21:00,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:21:00,962 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:21:00,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label55.c [2024-10-12 15:21:00,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2753bf4/7059cf475b234fbca6463b62f0720160/FLAG51f29250b [2024-10-12 15:21:00,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2753bf4/7059cf475b234fbca6463b62f0720160 [2024-10-12 15:21:00,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:21:00,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:21:01,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:21:01,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:21:01,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:21:01,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:21:00" (1/1) ... [2024-10-12 15:21:01,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e164e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01, skipping insertion in model container [2024-10-12 15:21:01,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:21:00" (1/1) ... [2024-10-12 15:21:01,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:21:01,505 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/Problem03_label55.c[56086,56099] [2024-10-12 15:21:01,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:21:01,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:21:01,718 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/Problem03_label55.c[56086,56099] [2024-10-12 15:21:01,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:21:01,756 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:21:01,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01 WrapperNode [2024-10-12 15:21:01,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:21:01,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:21:01,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:21:01,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:21:01,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:01,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:01,943 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-12 15:21:01,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:21:01,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:21:01,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:21:01,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:21:01,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:01,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:01,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:02,024 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-12 15:21:02,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:02,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:02,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:02,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:02,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:02,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:02,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:21:02,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:21:02,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:21:02,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:21:02,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (1/1) ... [2024-10-12 15:21:02,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:21:02,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:02,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:21:02,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:21:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:21:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:21:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:21:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:21:02,317 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:21:02,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:21:04,142 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-12 15:21:04,143 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:21:04,198 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:21:04,198 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:21:04,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:21:04 BoogieIcfgContainer [2024-10-12 15:21:04,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:21:04,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:21:04,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:21:04,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:21:04,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:21:00" (1/3) ... [2024-10-12 15:21:04,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cff626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:21:04, skipping insertion in model container [2024-10-12 15:21:04,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:01" (2/3) ... [2024-10-12 15:21:04,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cff626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:21:04, skipping insertion in model container [2024-10-12 15:21:04,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:21:04" (3/3) ... [2024-10-12 15:21:04,207 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label55.c [2024-10-12 15:21:04,223 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:21:04,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:21:04,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:21:04,311 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;@596628c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:21:04,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:21:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-12 15:21:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 15:21:04,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:04,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:04,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:04,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2051895673, now seen corresponding path program 1 times [2024-10-12 15:21:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:04,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441762286] [2024-10-12 15:21:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:04,925 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-12 15:21:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441762286] [2024-10-12 15:21:04,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441762286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:04,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063049988] [2024-10-12 15:21:04,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:04,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:21:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:04,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:21:04,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:21:04,961 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 80.5) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-12 15:21:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:05,023 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-12 15:21:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:21:05,026 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-12 15:21:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:05,040 INFO L225 Difference]: With dead ends: 479 [2024-10-12 15:21:05,040 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:21:05,044 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-12 15:21:05,050 INFO L432 NwaCegarLoop]: 392 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, 392 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-12 15:21:05,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:21:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:21:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-12 15:21:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-12 15:21:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-12 15:21:05,096 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 161 [2024-10-12 15:21:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:05,097 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-12 15:21:05,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-12 15:21:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-12 15:21:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 15:21:05,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:05,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:05,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:21:05,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:05,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1773857272, now seen corresponding path program 1 times [2024-10-12 15:21:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:05,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650104401] [2024-10-12 15:21:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:05,824 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-12 15:21:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:05,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650104401] [2024-10-12 15:21:05,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650104401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:05,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041376364] [2024-10-12 15:21:05,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:05,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:05,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:05,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:05,831 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-12 15:21:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:06,734 INFO L93 Difference]: Finished difference Result 699 states and 1161 transitions. [2024-10-12 15:21:06,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:06,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-12 15:21:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:06,740 INFO L225 Difference]: With dead ends: 699 [2024-10-12 15:21:06,740 INFO L226 Difference]: Without dead ends: 462 [2024-10-12 15:21:06,742 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-12 15:21:06,743 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:06,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 83 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:21:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-12 15:21:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 448. [2024-10-12 15:21:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.6353467561521253) internal successors, (731), 447 states have internal predecessors, (731), 0 states have call successors, (0), 0 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-12 15:21:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 731 transitions. [2024-10-12 15:21:06,767 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 731 transitions. Word has length 161 [2024-10-12 15:21:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:06,768 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 731 transitions. [2024-10-12 15:21:06,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-12 15:21:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 731 transitions. [2024-10-12 15:21:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 15:21:06,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:06,771 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:21:06,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:21:06,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:06,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:06,773 INFO L85 PathProgramCache]: Analyzing trace with hash 990486036, now seen corresponding path program 1 times [2024-10-12 15:21:06,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:06,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342392926] [2024-10-12 15:21:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342392926] [2024-10-12 15:21:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342392926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:07,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176570375] [2024-10-12 15:21:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:07,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:07,087 INFO L87 Difference]: Start difference. First operand 448 states and 731 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-12 15:21:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:07,873 INFO L93 Difference]: Finished difference Result 1332 states and 2179 transitions. [2024-10-12 15:21:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:07,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-10-12 15:21:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:07,877 INFO L225 Difference]: With dead ends: 1332 [2024-10-12 15:21:07,877 INFO L226 Difference]: Without dead ends: 885 [2024-10-12 15:21:07,879 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-12 15:21:07,880 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 285 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:07,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 112 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-12 15:21:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 881. [2024-10-12 15:21:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.6170454545454545) internal successors, (1423), 880 states have internal predecessors, (1423), 0 states have call successors, (0), 0 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-12 15:21:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1423 transitions. [2024-10-12 15:21:07,917 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1423 transitions. Word has length 167 [2024-10-12 15:21:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:07,918 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1423 transitions. [2024-10-12 15:21:07,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-12 15:21:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1423 transitions. [2024-10-12 15:21:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 15:21:07,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:07,923 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:21:07,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:21:07,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:07,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1176829972, now seen corresponding path program 1 times [2024-10-12 15:21:07,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:07,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628762469] [2024-10-12 15:21:07,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:07,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:08,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:08,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628762469] [2024-10-12 15:21:08,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628762469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:08,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:08,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634978427] [2024-10-12 15:21:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:08,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:08,195 INFO L87 Difference]: Start difference. First operand 881 states and 1423 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-12 15:21:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:09,053 INFO L93 Difference]: Finished difference Result 2574 states and 4171 transitions. [2024-10-12 15:21:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-10-12 15:21:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:09,060 INFO L225 Difference]: With dead ends: 2574 [2024-10-12 15:21:09,060 INFO L226 Difference]: Without dead ends: 1694 [2024-10-12 15:21:09,062 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-12 15:21:09,063 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 216 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:09,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 190 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2024-10-12 15:21:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1694. [2024-10-12 15:21:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1693 states have (on average 1.3987005316007088) internal successors, (2368), 1693 states have internal predecessors, (2368), 0 states have call successors, (0), 0 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-12 15:21:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2368 transitions. [2024-10-12 15:21:09,108 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2368 transitions. Word has length 167 [2024-10-12 15:21:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:09,108 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2368 transitions. [2024-10-12 15:21:09,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-12 15:21:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2368 transitions. [2024-10-12 15:21:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-12 15:21:09,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:09,115 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:21:09,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:21:09,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:09,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:09,117 INFO L85 PathProgramCache]: Analyzing trace with hash -627339811, now seen corresponding path program 1 times [2024-10-12 15:21:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:09,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088812937] [2024-10-12 15:21:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:09,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088812937] [2024-10-12 15:21:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088812937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:09,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:09,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819784223] [2024-10-12 15:21:09,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:09,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:09,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:09,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:09,422 INFO L87 Difference]: Start difference. First operand 1694 states and 2368 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-12 15:21:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:10,288 INFO L93 Difference]: Finished difference Result 5061 states and 7080 transitions. [2024-10-12 15:21:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:10,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2024-10-12 15:21:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:10,300 INFO L225 Difference]: With dead ends: 5061 [2024-10-12 15:21:10,300 INFO L226 Difference]: Without dead ends: 3368 [2024-10-12 15:21:10,303 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-12 15:21:10,304 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 275 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:10,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 214 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2024-10-12 15:21:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 3359. [2024-10-12 15:21:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 3358 states have (on average 1.3847528290649196) internal successors, (4650), 3358 states have internal predecessors, (4650), 0 states have call successors, (0), 0 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-12 15:21:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4650 transitions. [2024-10-12 15:21:10,365 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4650 transitions. Word has length 173 [2024-10-12 15:21:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:10,366 INFO L471 AbstractCegarLoop]: Abstraction has 3359 states and 4650 transitions. [2024-10-12 15:21:10,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-12 15:21:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4650 transitions. [2024-10-12 15:21:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-12 15:21:10,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:10,372 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:21:10,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:21:10,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:10,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash 816073928, now seen corresponding path program 1 times [2024-10-12 15:21:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:10,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397561740] [2024-10-12 15:21:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:10,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:10,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:10,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397561740] [2024-10-12 15:21:10,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397561740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:10,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919339805] [2024-10-12 15:21:10,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:10,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:10,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:10,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:10,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:10,581 INFO L87 Difference]: Start difference. First operand 3359 states and 4650 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-12 15:21:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:11,423 INFO L93 Difference]: Finished difference Result 10005 states and 13850 transitions. [2024-10-12 15:21:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:11,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2024-10-12 15:21:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:11,451 INFO L225 Difference]: With dead ends: 10005 [2024-10-12 15:21:11,452 INFO L226 Difference]: Without dead ends: 6647 [2024-10-12 15:21:11,459 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-12 15:21:11,461 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 243 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:11,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 222 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:11,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6647 states. [2024-10-12 15:21:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6647 to 6640. [2024-10-12 15:21:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6640 states, 6639 states have (on average 1.3285133303208314) internal successors, (8820), 6639 states have internal predecessors, (8820), 0 states have call successors, (0), 0 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-12 15:21:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6640 states to 6640 states and 8820 transitions. [2024-10-12 15:21:11,595 INFO L78 Accepts]: Start accepts. Automaton has 6640 states and 8820 transitions. Word has length 174 [2024-10-12 15:21:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:11,596 INFO L471 AbstractCegarLoop]: Abstraction has 6640 states and 8820 transitions. [2024-10-12 15:21:11,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-12 15:21:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 6640 states and 8820 transitions. [2024-10-12 15:21:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 15:21:11,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:11,606 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:11,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:21:11,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:11,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1718626995, now seen corresponding path program 1 times [2024-10-12 15:21:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:11,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868853605] [2024-10-12 15:21:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 15:21:11,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868853605] [2024-10-12 15:21:11,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868853605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:11,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:11,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:11,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933025330] [2024-10-12 15:21:11,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:11,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:11,734 INFO L87 Difference]: Start difference. First operand 6640 states and 8820 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:12,588 INFO L93 Difference]: Finished difference Result 18402 states and 24735 transitions. [2024-10-12 15:21:12,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:12,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2024-10-12 15:21:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:12,616 INFO L225 Difference]: With dead ends: 18402 [2024-10-12 15:21:12,617 INFO L226 Difference]: Without dead ends: 12169 [2024-10-12 15:21:12,626 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-12 15:21:12,627 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:12,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 88 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12169 states. [2024-10-12 15:21:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12169 to 12126. [2024-10-12 15:21:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12126 states, 12125 states have (on average 1.3185154639175258) internal successors, (15987), 12125 states have internal predecessors, (15987), 0 states have call successors, (0), 0 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-12 15:21:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12126 states to 12126 states and 15987 transitions. [2024-10-12 15:21:12,845 INFO L78 Accepts]: Start accepts. Automaton has 12126 states and 15987 transitions. Word has length 175 [2024-10-12 15:21:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:12,845 INFO L471 AbstractCegarLoop]: Abstraction has 12126 states and 15987 transitions. [2024-10-12 15:21:12,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12126 states and 15987 transitions. [2024-10-12 15:21:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-12 15:21:12,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:12,864 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2024-10-12 15:21:12,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:21:12,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:12,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:12,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2060974238, now seen corresponding path program 1 times [2024-10-12 15:21:12,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:12,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882124773] [2024-10-12 15:21:12,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:12,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:13,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:13,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882124773] [2024-10-12 15:21:13,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882124773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:13,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496705871] [2024-10-12 15:21:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:13,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:13,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:13,193 INFO L87 Difference]: Start difference. First operand 12126 states and 15987 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-12 15:21:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:14,009 INFO L93 Difference]: Finished difference Result 31582 states and 42423 transitions. [2024-10-12 15:21:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:14,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 182 [2024-10-12 15:21:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:14,167 INFO L225 Difference]: With dead ends: 31582 [2024-10-12 15:21:14,168 INFO L226 Difference]: Without dead ends: 19863 [2024-10-12 15:21:14,176 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-12 15:21:14,177 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 218 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:14,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 359 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19863 states. [2024-10-12 15:21:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19863 to 19853. [2024-10-12 15:21:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19853 states, 19852 states have (on average 1.2798206729800523) internal successors, (25407), 19852 states have internal predecessors, (25407), 0 states have call successors, (0), 0 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-12 15:21:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 25407 transitions. [2024-10-12 15:21:14,476 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 25407 transitions. Word has length 182 [2024-10-12 15:21:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:14,476 INFO L471 AbstractCegarLoop]: Abstraction has 19853 states and 25407 transitions. [2024-10-12 15:21:14,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-12 15:21:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 25407 transitions. [2024-10-12 15:21:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-12 15:21:14,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:14,499 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2024-10-12 15:21:14,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:21:14,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:14,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1354510896, now seen corresponding path program 1 times [2024-10-12 15:21:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833081143] [2024-10-12 15:21:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:14,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833081143] [2024-10-12 15:21:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833081143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:14,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824282090] [2024-10-12 15:21:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:14,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:21:14,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:21:14,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:21:14,848 INFO L87 Difference]: Start difference. First operand 19853 states and 25407 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:15,843 INFO L93 Difference]: Finished difference Result 45522 states and 58725 transitions. [2024-10-12 15:21:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:21:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2024-10-12 15:21:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:15,899 INFO L225 Difference]: With dead ends: 45522 [2024-10-12 15:21:15,900 INFO L226 Difference]: Without dead ends: 26076 [2024-10-12 15:21:15,923 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-12 15:21:15,924 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 626 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:15,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 50 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26076 states. [2024-10-12 15:21:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26076 to 26067. [2024-10-12 15:21:16,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26067 states, 26066 states have (on average 1.234903705977135) internal successors, (32189), 26066 states have internal predecessors, (32189), 0 states have call successors, (0), 0 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-12 15:21:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26067 states to 26067 states and 32189 transitions. [2024-10-12 15:21:16,340 INFO L78 Accepts]: Start accepts. Automaton has 26067 states and 32189 transitions. Word has length 186 [2024-10-12 15:21:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:16,341 INFO L471 AbstractCegarLoop]: Abstraction has 26067 states and 32189 transitions. [2024-10-12 15:21:16,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 26067 states and 32189 transitions. [2024-10-12 15:21:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-12 15:21:16,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:16,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:16,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:21:16,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:16,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash -747284754, now seen corresponding path program 1 times [2024-10-12 15:21:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:16,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667883559] [2024-10-12 15:21:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:16,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:16,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667883559] [2024-10-12 15:21:16,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667883559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:16,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:16,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:16,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303930282] [2024-10-12 15:21:16,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:16,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:16,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:16,976 INFO L87 Difference]: Start difference. First operand 26067 states and 32189 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-12 15:21:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:17,731 INFO L93 Difference]: Finished difference Result 67614 states and 83813 transitions. [2024-10-12 15:21:17,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:17,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2024-10-12 15:21:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:17,809 INFO L225 Difference]: With dead ends: 67614 [2024-10-12 15:21:17,809 INFO L226 Difference]: Without dead ends: 41954 [2024-10-12 15:21:17,845 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-12 15:21:17,846 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 207 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:17,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 106 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:21:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41954 states. [2024-10-12 15:21:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41954 to 41939. [2024-10-12 15:21:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41939 states, 41938 states have (on average 1.2147694215270162) internal successors, (50945), 41938 states have internal predecessors, (50945), 0 states have call successors, (0), 0 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-12 15:21:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41939 states to 41939 states and 50945 transitions. [2024-10-12 15:21:18,644 INFO L78 Accepts]: Start accepts. Automaton has 41939 states and 50945 transitions. Word has length 189 [2024-10-12 15:21:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:18,644 INFO L471 AbstractCegarLoop]: Abstraction has 41939 states and 50945 transitions. [2024-10-12 15:21:18,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-12 15:21:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 41939 states and 50945 transitions. [2024-10-12 15:21:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-12 15:21:18,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:18,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:18,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:21:18,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:18,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash -310629943, now seen corresponding path program 1 times [2024-10-12 15:21:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:18,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514992773] [2024-10-12 15:21:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:18,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:19,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514992773] [2024-10-12 15:21:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514992773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:19,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:19,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:19,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086661653] [2024-10-12 15:21:19,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:19,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:19,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:19,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:19,195 INFO L87 Difference]: Start difference. First operand 41939 states and 50945 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 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-12 15:21:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:20,140 INFO L93 Difference]: Finished difference Result 98163 states and 120487 transitions. [2024-10-12 15:21:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:20,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2024-10-12 15:21:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:20,342 INFO L225 Difference]: With dead ends: 98163 [2024-10-12 15:21:20,342 INFO L226 Difference]: Without dead ends: 57240 [2024-10-12 15:21:20,401 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-12 15:21:20,401 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 202 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:20,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 178 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:21:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57240 states. [2024-10-12 15:21:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57240 to 57212. [2024-10-12 15:21:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57212 states, 57211 states have (on average 1.2304451941060286) internal successors, (70395), 57211 states have internal predecessors, (70395), 0 states have call successors, (0), 0 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-12 15:21:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57212 states to 57212 states and 70395 transitions. [2024-10-12 15:21:21,392 INFO L78 Accepts]: Start accepts. Automaton has 57212 states and 70395 transitions. Word has length 191 [2024-10-12 15:21:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:21,392 INFO L471 AbstractCegarLoop]: Abstraction has 57212 states and 70395 transitions. [2024-10-12 15:21:21,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 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-12 15:21:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 57212 states and 70395 transitions. [2024-10-12 15:21:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-12 15:21:21,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:21,433 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, 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] [2024-10-12 15:21:21,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:21:21,433 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:21,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 560096127, now seen corresponding path program 1 times [2024-10-12 15:21:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253218650] [2024-10-12 15:21:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:21,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253218650] [2024-10-12 15:21:21,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253218650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:21,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:21,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680346064] [2024-10-12 15:21:21,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:21,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:21,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:21,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:21,921 INFO L87 Difference]: Start difference. First operand 57212 states and 70395 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-12 15:21:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:23,006 INFO L93 Difference]: Finished difference Result 137640 states and 169698 transitions. [2024-10-12 15:21:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:23,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 195 [2024-10-12 15:21:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:23,110 INFO L225 Difference]: With dead ends: 137640 [2024-10-12 15:21:23,110 INFO L226 Difference]: Without dead ends: 81444 [2024-10-12 15:21:23,168 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-12 15:21:23,168 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 226 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:23,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 162 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81444 states. [2024-10-12 15:21:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81444 to 81440. [2024-10-12 15:21:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81440 states, 81439 states have (on average 1.2316334925527082) internal successors, (100303), 81439 states have internal predecessors, (100303), 0 states have call successors, (0), 0 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-12 15:21:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81440 states to 81440 states and 100303 transitions. [2024-10-12 15:21:24,297 INFO L78 Accepts]: Start accepts. Automaton has 81440 states and 100303 transitions. Word has length 195 [2024-10-12 15:21:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:24,297 INFO L471 AbstractCegarLoop]: Abstraction has 81440 states and 100303 transitions. [2024-10-12 15:21:24,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-12 15:21:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 81440 states and 100303 transitions. [2024-10-12 15:21:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-12 15:21:24,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:24,321 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2024-10-12 15:21:24,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:21:24,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:24,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1407650071, now seen corresponding path program 1 times [2024-10-12 15:21:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:24,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286321137] [2024-10-12 15:21:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:24,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:24,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286321137] [2024-10-12 15:21:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286321137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:24,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:24,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:24,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238399568] [2024-10-12 15:21:24,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:24,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:21:24,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:24,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:21:24,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:21:24,825 INFO L87 Difference]: Start difference. First operand 81440 states and 100303 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:26,435 INFO L93 Difference]: Finished difference Result 206239 states and 254660 transitions. [2024-10-12 15:21:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:21:26,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2024-10-12 15:21:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:26,649 INFO L225 Difference]: With dead ends: 206239 [2024-10-12 15:21:26,649 INFO L226 Difference]: Without dead ends: 125815 [2024-10-12 15:21:26,720 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-12 15:21:26,721 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 479 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:26,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 475 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125815 states. [2024-10-12 15:21:28,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125815 to 125595. [2024-10-12 15:21:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125595 states, 125594 states have (on average 1.2175900122617322) internal successors, (152922), 125594 states have internal predecessors, (152922), 0 states have call successors, (0), 0 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-12 15:21:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125595 states to 125595 states and 152922 transitions. [2024-10-12 15:21:28,663 INFO L78 Accepts]: Start accepts. Automaton has 125595 states and 152922 transitions. Word has length 206 [2024-10-12 15:21:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:28,663 INFO L471 AbstractCegarLoop]: Abstraction has 125595 states and 152922 transitions. [2024-10-12 15:21:28,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 125595 states and 152922 transitions. [2024-10-12 15:21:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-12 15:21:28,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:28,700 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:28,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:21:28,701 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:28,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:28,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1169610535, now seen corresponding path program 1 times [2024-10-12 15:21:28,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:28,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542558321] [2024-10-12 15:21:28,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:28,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:21:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542558321] [2024-10-12 15:21:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542558321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:29,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:29,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135337295] [2024-10-12 15:21:29,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:29,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:29,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:29,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:29,330 INFO L87 Difference]: Start difference. First operand 125595 states and 152922 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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-12 15:21:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:30,423 INFO L93 Difference]: Finished difference Result 217961 states and 268206 transitions. [2024-10-12 15:21:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 227 [2024-10-12 15:21:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:30,533 INFO L225 Difference]: With dead ends: 217961 [2024-10-12 15:21:30,533 INFO L226 Difference]: Without dead ends: 94809 [2024-10-12 15:21:31,045 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-12 15:21:31,045 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 171 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:31,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 367 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:21:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94809 states. [2024-10-12 15:21:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94809 to 88913. [2024-10-12 15:21:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88913 states, 88912 states have (on average 1.1646459420550657) internal successors, (103551), 88912 states have internal predecessors, (103551), 0 states have call successors, (0), 0 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-12 15:21:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88913 states to 88913 states and 103551 transitions. [2024-10-12 15:21:32,563 INFO L78 Accepts]: Start accepts. Automaton has 88913 states and 103551 transitions. Word has length 227 [2024-10-12 15:21:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:32,564 INFO L471 AbstractCegarLoop]: Abstraction has 88913 states and 103551 transitions. [2024-10-12 15:21:32,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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-12 15:21:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 88913 states and 103551 transitions. [2024-10-12 15:21:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-12 15:21:32,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:32,583 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:32,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:21:32,584 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:32,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash 301554004, now seen corresponding path program 1 times [2024-10-12 15:21:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:32,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30624321] [2024-10-12 15:21:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30624321] [2024-10-12 15:21:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30624321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:33,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:33,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:33,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478137694] [2024-10-12 15:21:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:33,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:33,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:33,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:33,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:33,112 INFO L87 Difference]: Start difference. First operand 88913 states and 103551 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-12 15:21:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:34,197 INFO L93 Difference]: Finished difference Result 168058 states and 195530 transitions. [2024-10-12 15:21:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:34,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2024-10-12 15:21:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:34,310 INFO L225 Difference]: With dead ends: 168058 [2024-10-12 15:21:34,310 INFO L226 Difference]: Without dead ends: 88710 [2024-10-12 15:21:34,366 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-12 15:21:34,367 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 133 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:34,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 148 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88710 states. [2024-10-12 15:21:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88710 to 88710. [2024-10-12 15:21:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88710 states, 88709 states have (on average 1.1647521671983676) internal successors, (103324), 88709 states have internal predecessors, (103324), 0 states have call successors, (0), 0 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-12 15:21:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88710 states to 88710 states and 103324 transitions. [2024-10-12 15:21:35,656 INFO L78 Accepts]: Start accepts. Automaton has 88710 states and 103324 transitions. Word has length 235 [2024-10-12 15:21:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:35,657 INFO L471 AbstractCegarLoop]: Abstraction has 88710 states and 103324 transitions. [2024-10-12 15:21:35,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-12 15:21:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 88710 states and 103324 transitions. [2024-10-12 15:21:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-12 15:21:35,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:35,677 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-12 15:21:35,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:21:35,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:35,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:35,678 INFO L85 PathProgramCache]: Analyzing trace with hash -88581847, now seen corresponding path program 1 times [2024-10-12 15:21:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:35,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177669534] [2024-10-12 15:21:35,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:36,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:36,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177669534] [2024-10-12 15:21:36,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177669534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:36,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:36,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:36,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113612560] [2024-10-12 15:21:36,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:36,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:21:36,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:36,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:21:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:21:36,482 INFO L87 Difference]: Start difference. First operand 88710 states and 103324 transitions. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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-12 15:21:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:37,878 INFO L93 Difference]: Finished difference Result 170140 states and 198634 transitions. [2024-10-12 15:21:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:21:37,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2024-10-12 15:21:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:38,002 INFO L225 Difference]: With dead ends: 170140 [2024-10-12 15:21:38,002 INFO L226 Difference]: Without dead ends: 96484 [2024-10-12 15:21:38,066 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-12 15:21:38,067 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 358 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:38,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 111 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:21:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96484 states. [2024-10-12 15:21:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96484 to 93398. [2024-10-12 15:21:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93398 states, 93397 states have (on average 1.164202276304378) internal successors, (108733), 93397 states have internal predecessors, (108733), 0 states have call successors, (0), 0 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-12 15:21:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93398 states to 93398 states and 108733 transitions. [2024-10-12 15:21:39,799 INFO L78 Accepts]: Start accepts. Automaton has 93398 states and 108733 transitions. Word has length 263 [2024-10-12 15:21:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:39,800 INFO L471 AbstractCegarLoop]: Abstraction has 93398 states and 108733 transitions. [2024-10-12 15:21:39,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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-12 15:21:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 93398 states and 108733 transitions. [2024-10-12 15:21:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-12 15:21:39,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:39,822 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 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, 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] [2024-10-12 15:21:39,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:21:39,822 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:39,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 949296900, now seen corresponding path program 1 times [2024-10-12 15:21:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439182425] [2024-10-12 15:21:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-12 15:21:40,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:40,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439182425] [2024-10-12 15:21:40,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439182425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:40,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:40,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437551827] [2024-10-12 15:21:40,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:40,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:40,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:40,092 INFO L87 Difference]: Start difference. First operand 93398 states and 108733 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-12 15:21:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:41,366 INFO L93 Difference]: Finished difference Result 185791 states and 216122 transitions. [2024-10-12 15:21:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:41,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 283 [2024-10-12 15:21:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:41,462 INFO L225 Difference]: With dead ends: 185791 [2024-10-12 15:21:41,462 INFO L226 Difference]: Without dead ends: 85701 [2024-10-12 15:21:41,491 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-12 15:21:41,492 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 163 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:41,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 372 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:21:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85701 states. [2024-10-12 15:21:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85701 to 67381. [2024-10-12 15:21:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67381 states, 67380 states have (on average 1.1146482635796973) internal successors, (75105), 67380 states have internal predecessors, (75105), 0 states have call successors, (0), 0 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-12 15:21:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67381 states to 67381 states and 75105 transitions. [2024-10-12 15:21:42,645 INFO L78 Accepts]: Start accepts. Automaton has 67381 states and 75105 transitions. Word has length 283 [2024-10-12 15:21:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:42,646 INFO L471 AbstractCegarLoop]: Abstraction has 67381 states and 75105 transitions. [2024-10-12 15:21:42,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-12 15:21:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 67381 states and 75105 transitions. [2024-10-12 15:21:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-12 15:21:42,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:42,675 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, 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, 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] [2024-10-12 15:21:42,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 15:21:42,675 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:42,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 60376186, now seen corresponding path program 1 times [2024-10-12 15:21:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175429554] [2024-10-12 15:21:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:43,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175429554] [2024-10-12 15:21:43,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175429554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:43,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:43,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962222762] [2024-10-12 15:21:43,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:43,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:43,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:43,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:43,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:43,364 INFO L87 Difference]: Start difference. First operand 67381 states and 75105 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 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-12 15:21:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:44,208 INFO L93 Difference]: Finished difference Result 129071 states and 143707 transitions. [2024-10-12 15:21:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:44,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 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 291 [2024-10-12 15:21:44,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:44,613 INFO L225 Difference]: With dead ends: 129071 [2024-10-12 15:21:44,613 INFO L226 Difference]: Without dead ends: 69223 [2024-10-12 15:21:44,630 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-12 15:21:44,631 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 85 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:44,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 108 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:21:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69223 states. [2024-10-12 15:21:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69223 to 69005. [2024-10-12 15:21:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69005 states, 69004 states have (on average 1.1108196626282534) internal successors, (76651), 69004 states have internal predecessors, (76651), 0 states have call successors, (0), 0 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-12 15:21:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69005 states to 69005 states and 76651 transitions. [2024-10-12 15:21:45,225 INFO L78 Accepts]: Start accepts. Automaton has 69005 states and 76651 transitions. Word has length 291 [2024-10-12 15:21:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:45,225 INFO L471 AbstractCegarLoop]: Abstraction has 69005 states and 76651 transitions. [2024-10-12 15:21:45,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 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-12 15:21:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 69005 states and 76651 transitions. [2024-10-12 15:21:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-10-12 15:21:45,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:45,240 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, 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, 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] [2024-10-12 15:21:45,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 15:21:45,240 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:45,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1176233585, now seen corresponding path program 1 times [2024-10-12 15:21:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369246530] [2024-10-12 15:21:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 131 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369246530] [2024-10-12 15:21:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369246530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321490414] [2024-10-12 15:21:45,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:45,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:45,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:45,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:45,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:21:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:46,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:21:46,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-12 15:21:46,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321490414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:46,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:46,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:21:46,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921281926] [2024-10-12 15:21:46,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:46,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:46,480 INFO L87 Difference]: Start difference. First operand 69005 states and 76651 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-12 15:21:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:47,325 INFO L93 Difference]: Finished difference Result 156756 states and 175248 transitions. [2024-10-12 15:21:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:47,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 293 [2024-10-12 15:21:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:47,438 INFO L225 Difference]: With dead ends: 156756 [2024-10-12 15:21:47,438 INFO L226 Difference]: Without dead ends: 88769 [2024-10-12 15:21:47,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:47,489 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 93 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:47,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 86 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:21:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88769 states. [2024-10-12 15:21:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88769 to 86323. [2024-10-12 15:21:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86323 states, 86322 states have (on average 1.112543731609555) internal successors, (96037), 86322 states have internal predecessors, (96037), 0 states have call successors, (0), 0 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-12 15:21:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86323 states to 86323 states and 96037 transitions. [2024-10-12 15:21:48,586 INFO L78 Accepts]: Start accepts. Automaton has 86323 states and 96037 transitions. Word has length 293 [2024-10-12 15:21:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:48,587 INFO L471 AbstractCegarLoop]: Abstraction has 86323 states and 96037 transitions. [2024-10-12 15:21:48,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-12 15:21:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 86323 states and 96037 transitions. [2024-10-12 15:21:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-12 15:21:48,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:48,601 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:21:48,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:21:48,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:48,802 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:48,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1309134433, now seen corresponding path program 1 times [2024-10-12 15:21:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:48,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084000223] [2024-10-12 15:21:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-12 15:21:49,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:49,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084000223] [2024-10-12 15:21:49,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084000223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:49,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:49,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:49,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191329630] [2024-10-12 15:21:49,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:49,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:21:49,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:49,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:21:49,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:21:49,475 INFO L87 Difference]: Start difference. First operand 86323 states and 96037 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-12 15:21:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:50,648 INFO L93 Difference]: Finished difference Result 166606 states and 185363 transitions. [2024-10-12 15:21:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:21:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 299 [2024-10-12 15:21:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:50,748 INFO L225 Difference]: With dead ends: 166606 [2024-10-12 15:21:50,748 INFO L226 Difference]: Without dead ends: 87002 [2024-10-12 15:21:50,802 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-12 15:21:50,802 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 366 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:50,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 96 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87002 states. [2024-10-12 15:21:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87002 to 85308. [2024-10-12 15:21:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85308 states, 85307 states have (on average 1.1124526709414233) internal successors, (94900), 85307 states have internal predecessors, (94900), 0 states have call successors, (0), 0 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-12 15:21:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85308 states to 85308 states and 94900 transitions. [2024-10-12 15:21:51,904 INFO L78 Accepts]: Start accepts. Automaton has 85308 states and 94900 transitions. Word has length 299 [2024-10-12 15:21:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:51,904 INFO L471 AbstractCegarLoop]: Abstraction has 85308 states and 94900 transitions. [2024-10-12 15:21:51,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-12 15:21:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 85308 states and 94900 transitions. [2024-10-12 15:21:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-10-12 15:21:51,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:51,918 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:21:51,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 15:21:51,918 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:51,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1609708082, now seen corresponding path program 1 times [2024-10-12 15:21:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:51,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351604697] [2024-10-12 15:21:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:51,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 129 proven. 6 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-12 15:21:52,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351604697] [2024-10-12 15:21:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351604697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125804391] [2024-10-12 15:21:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:52,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:52,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:52,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:52,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:21:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:52,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 15:21:52,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:53,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:53,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125804391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:53,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:53,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2024-10-12 15:21:53,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620150940] [2024-10-12 15:21:53,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:53,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:21:53,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:53,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:21:53,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:21:53,029 INFO L87 Difference]: Start difference. First operand 85308 states and 94900 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-12 15:21:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:54,621 INFO L93 Difference]: Finished difference Result 236703 states and 261750 transitions. [2024-10-12 15:21:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 15:21:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 0 states have call successors, (0), 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 306 [2024-10-12 15:21:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:54,831 INFO L225 Difference]: With dead ends: 236703 [2024-10-12 15:21:54,831 INFO L226 Difference]: Without dead ends: 152413 [2024-10-12 15:21:54,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:21:54,862 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 925 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:54,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 558 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152413 states. [2024-10-12 15:21:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152413 to 135921. [2024-10-12 15:21:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135921 states, 135920 states have (on average 1.1062389640965273) internal successors, (150360), 135920 states have internal predecessors, (150360), 0 states have call successors, (0), 0 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-12 15:21:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135921 states to 135921 states and 150360 transitions. [2024-10-12 15:21:56,693 INFO L78 Accepts]: Start accepts. Automaton has 135921 states and 150360 transitions. Word has length 306 [2024-10-12 15:21:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:56,693 INFO L471 AbstractCegarLoop]: Abstraction has 135921 states and 150360 transitions. [2024-10-12 15:21:56,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-12 15:21:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 135921 states and 150360 transitions. [2024-10-12 15:21:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-12 15:21:56,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:56,705 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:21:56,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:21:56,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-12 15:21:56,906 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:56,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:56,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1871530072, now seen corresponding path program 1 times [2024-10-12 15:21:56,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:56,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716199050] [2024-10-12 15:21:56,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:56,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-10-12 15:21:57,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:57,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716199050] [2024-10-12 15:21:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716199050] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:57,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044125822] [2024-10-12 15:21:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:57,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:57,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:57,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:57,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:21:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:57,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:21:57,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-12 15:21:58,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:58,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044125822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:58,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:58,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:21:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065492913] [2024-10-12 15:21:58,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:58,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:58,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:58,117 INFO L87 Difference]: Start difference. First operand 135921 states and 150360 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-12 15:21:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:59,602 INFO L93 Difference]: Finished difference Result 266595 states and 295202 transitions. [2024-10-12 15:21:59,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:59,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 324 [2024-10-12 15:21:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:59,778 INFO L225 Difference]: With dead ends: 266595 [2024-10-12 15:21:59,778 INFO L226 Difference]: Without dead ends: 134335 [2024-10-12 15:21:59,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:59,839 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 68 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:59,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 114 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:21:59,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134335 states. [2024-10-12 15:22:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134335 to 130430. [2024-10-12 15:22:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130430 states, 130429 states have (on average 1.1031902414340369) internal successors, (143888), 130429 states have internal predecessors, (143888), 0 states have call successors, (0), 0 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-12 15:22:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130430 states to 130430 states and 143888 transitions. [2024-10-12 15:22:01,468 INFO L78 Accepts]: Start accepts. Automaton has 130430 states and 143888 transitions. Word has length 324 [2024-10-12 15:22:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:22:01,468 INFO L471 AbstractCegarLoop]: Abstraction has 130430 states and 143888 transitions. [2024-10-12 15:22:01,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-12 15:22:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 130430 states and 143888 transitions. [2024-10-12 15:22:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-12 15:22:01,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:22:01,481 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1] [2024-10-12 15:22:01,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 15:22:01,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:22:01,682 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:22:01,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:22:01,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1762580846, now seen corresponding path program 1 times [2024-10-12 15:22:01,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:22:01,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591448265] [2024-10-12 15:22:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:22:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:22:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:22:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-12 15:22:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:22:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591448265] [2024-10-12 15:22:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591448265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:22:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198751054] [2024-10-12 15:22:02,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:22:02,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:22:02,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:22:02,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:22:02,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:22:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:22:02,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:22:02,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:22:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-12 15:22:02,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:22:02,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198751054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:22:02,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:22:02,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:22:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407187583] [2024-10-12 15:22:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:22:02,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:22:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:22:02,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:22:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:22:02,988 INFO L87 Difference]: Start difference. First operand 130430 states and 143888 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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-12 15:22:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:22:03,974 INFO L93 Difference]: Finished difference Result 257667 states and 284304 transitions. [2024-10-12 15:22:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:22:03,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 335 [2024-10-12 15:22:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:22:04,118 INFO L225 Difference]: With dead ends: 257667 [2024-10-12 15:22:04,118 INFO L226 Difference]: Without dead ends: 127441 [2024-10-12 15:22:04,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:22:04,190 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 61 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:22:04,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 303 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:22:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127441 states.