./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/Problem17_label47.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/Problem17_label47.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 584120db80e48cf9596b5da45bc5f64e7e8f9b48dd0380aa05459606ea632f16 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:30:24,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:30:24,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:30:24,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:30:24,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:30:25,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:30:25,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:30:25,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:30:25,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:30:25,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:30:25,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:30:25,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:30:25,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:30:25,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:30:25,019 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:30:25,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:30:25,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:30:25,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:30:25,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:30:25,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:30:25,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:30:25,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:30:25,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:30:25,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:30:25,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:30:25,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:30:25,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:30:25,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:30:25,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:30:25,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:30:25,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:30:25,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:30:25,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:30:25,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:30:25,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:30:25,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:30:25,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:30:25,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:30:25,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:30:25,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:30:25,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:30:25,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:30:25,032 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 -> 584120db80e48cf9596b5da45bc5f64e7e8f9b48dd0380aa05459606ea632f16 [2024-10-12 16:30:25,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:30:25,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:30:25,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:30:25,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:30:25,335 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:30:25,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label47.c [2024-10-12 16:30:26,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:30:27,194 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:30:27,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label47.c [2024-10-12 16:30:27,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07abc3f41/d2d338ca28d84ebd8f45aa85f8a2bba2/FLAG9931168d1 [2024-10-12 16:30:27,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07abc3f41/d2d338ca28d84ebd8f45aa85f8a2bba2 [2024-10-12 16:30:27,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:30:27,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:30:27,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:30:27,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:30:27,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:30:27,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:30:27" (1/1) ... [2024-10-12 16:30:27,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcec269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:27, skipping insertion in model container [2024-10-12 16:30:27,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:30:27" (1/1) ... [2024-10-12 16:30:27,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:30:27,623 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/Problem17_label47.c[6608,6621] [2024-10-12 16:30:28,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:30:28,142 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:30:28,162 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/Problem17_label47.c[6608,6621] [2024-10-12 16:30:28,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:30:28,396 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:30:28,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28 WrapperNode [2024-10-12 16:30:28,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:30:28,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:30:28,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:30:28,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:30:28,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:28,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:28,757 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-12 16:30:28,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:30:28,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:30:28,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:30:28,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:30:28,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:28,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:28,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:28,977 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 16:30:28,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:28,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:29,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:29,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:29,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:29,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:29,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:30:29,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:30:29,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:30:29,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:30:29,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (1/1) ... [2024-10-12 16:30:29,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:30:29,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:30:29,243 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 16:30:29,245 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 16:30:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:30:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:30:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:30:29,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:30:29,352 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:30:29,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:30:32,543 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-12 16:30:32,544 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:30:32,607 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:30:32,607 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:30:32,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:30:32 BoogieIcfgContainer [2024-10-12 16:30:32,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:30:32,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:30:32,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:30:32,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:30:32,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:30:27" (1/3) ... [2024-10-12 16:30:32,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9ea72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:30:32, skipping insertion in model container [2024-10-12 16:30:32,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:30:28" (2/3) ... [2024-10-12 16:30:32,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9ea72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:30:32, skipping insertion in model container [2024-10-12 16:30:32,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:30:32" (3/3) ... [2024-10-12 16:30:32,621 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label47.c [2024-10-12 16:30:32,638 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:30:32,638 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:30:32,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:30:32,731 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;@56c605d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:30:32,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:30:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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 16:30:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 16:30:32,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:32,744 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] [2024-10-12 16:30:32,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:32,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash 676865586, now seen corresponding path program 1 times [2024-10-12 16:30:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92371051] [2024-10-12 16:30:32,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:32,961 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 16:30:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92371051] [2024-10-12 16:30:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92371051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:32,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:32,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:30:32,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033034502] [2024-10-12 16:30:32,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:32,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:30:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:30:32,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:30:32,995 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 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 16:30:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:33,081 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-12 16:30:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:30:33,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-12 16:30:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:33,107 INFO L225 Difference]: With dead ends: 1055 [2024-10-12 16:30:33,107 INFO L226 Difference]: Without dead ends: 526 [2024-10-12 16:30:33,114 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 16:30:33,119 INFO L432 NwaCegarLoop]: 935 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, 935 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 16:30:33,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:30:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-12 16:30:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-12 16:30:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 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 16:30:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-12 16:30:33,199 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 43 [2024-10-12 16:30:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:33,199 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-12 16:30:33,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 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 16:30:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-12 16:30:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 16:30:33,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:33,201 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] [2024-10-12 16:30:33,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:30:33,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:33,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash -922284342, now seen corresponding path program 1 times [2024-10-12 16:30:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:33,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225733361] [2024-10-12 16:30:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:33,404 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 16:30:33,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225733361] [2024-10-12 16:30:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225733361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:33,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:33,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:30:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080083075] [2024-10-12 16:30:33,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:33,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:33,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:33,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:33,409 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 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 16:30:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:35,669 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-12 16:30:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:35,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-12 16:30:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:35,676 INFO L225 Difference]: With dead ends: 1501 [2024-10-12 16:30:35,677 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 16:30:35,678 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 16:30:35,679 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 428 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:35,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:30:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 16:30:35,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-12 16:30:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 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 16:30:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-12 16:30:35,714 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 43 [2024-10-12 16:30:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:35,715 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-12 16:30:35,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 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 16:30:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-12 16:30:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 16:30:35,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:35,719 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, 1, 1, 1, 1, 1, 1, 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 16:30:35,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:30:35,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:35,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:35,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1374818798, now seen corresponding path program 1 times [2024-10-12 16:30:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:35,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802564736] [2024-10-12 16:30:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:35,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:35,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802564736] [2024-10-12 16:30:35,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802564736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:35,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:35,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:30:35,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851317310] [2024-10-12 16:30:35,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:35,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:35,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:35,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:35,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:35,963 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 16:30:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:38,051 INFO L93 Difference]: Finished difference Result 2814 states and 4381 transitions. [2024-10-12 16:30:38,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:38,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-12 16:30:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:38,059 INFO L225 Difference]: With dead ends: 2814 [2024-10-12 16:30:38,060 INFO L226 Difference]: Without dead ends: 1845 [2024-10-12 16:30:38,061 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 16:30:38,062 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:38,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 578 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 16:30:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2024-10-12 16:30:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1840. [2024-10-12 16:30:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3507340946166395) internal successors, (2484), 1839 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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 16:30:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2484 transitions. [2024-10-12 16:30:38,101 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2484 transitions. Word has length 110 [2024-10-12 16:30:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:38,103 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2484 transitions. [2024-10-12 16:30:38,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 16:30:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2484 transitions. [2024-10-12 16:30:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 16:30:38,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:38,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:30:38,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:30:38,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:38,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:38,110 INFO L85 PathProgramCache]: Analyzing trace with hash 366740150, now seen corresponding path program 1 times [2024-10-12 16:30:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165348226] [2024-10-12 16:30:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:38,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:38,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165348226] [2024-10-12 16:30:38,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165348226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:38,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:38,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168839296] [2024-10-12 16:30:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:38,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:30:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:30:38,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:30:38,398 INFO L87 Difference]: Start difference. First operand 1840 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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 16:30:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:41,718 INFO L93 Difference]: Finished difference Result 5864 states and 8158 transitions. [2024-10-12 16:30:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:30:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-12 16:30:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:41,732 INFO L225 Difference]: With dead ends: 5864 [2024-10-12 16:30:41,733 INFO L226 Difference]: Without dead ends: 4025 [2024-10-12 16:30:41,739 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 16:30:41,744 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1001 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 760 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 760 IncrementalHoareTripleChecker+Valid, 2761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:41,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 411 Invalid, 3521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [760 Valid, 2761 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:30:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2024-10-12 16:30:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 4019. [2024-10-12 16:30:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4019 states, 4018 states have (on average 1.3265306122448979) internal successors, (5330), 4018 states have internal predecessors, (5330), 0 states have call successors, (0), 0 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 16:30:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5330 transitions. [2024-10-12 16:30:41,817 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5330 transitions. Word has length 113 [2024-10-12 16:30:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:41,818 INFO L471 AbstractCegarLoop]: Abstraction has 4019 states and 5330 transitions. [2024-10-12 16:30:41,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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 16:30:41,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5330 transitions. [2024-10-12 16:30:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-12 16:30:41,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:41,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:41,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:30:41,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:41,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash 572554155, now seen corresponding path program 1 times [2024-10-12 16:30:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:41,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231773308] [2024-10-12 16:30:41,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 16:30:42,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:42,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231773308] [2024-10-12 16:30:42,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231773308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:42,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:42,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:30:42,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556160362] [2024-10-12 16:30:42,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:42,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:42,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:42,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:42,116 INFO L87 Difference]: Start difference. First operand 4019 states and 5330 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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 16:30:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:43,792 INFO L93 Difference]: Finished difference Result 10601 states and 14366 transitions. [2024-10-12 16:30:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:43,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 178 [2024-10-12 16:30:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:43,814 INFO L225 Difference]: With dead ends: 10601 [2024-10-12 16:30:43,814 INFO L226 Difference]: Without dead ends: 6579 [2024-10-12 16:30:43,821 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 16:30:43,825 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:43,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:30:43,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2024-10-12 16:30:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 5300. [2024-10-12 16:30:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5300 states, 5299 states have (on average 1.227023966786186) internal successors, (6502), 5299 states have internal predecessors, (6502), 0 states have call successors, (0), 0 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 16:30:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 6502 transitions. [2024-10-12 16:30:43,919 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 6502 transitions. Word has length 178 [2024-10-12 16:30:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:43,919 INFO L471 AbstractCegarLoop]: Abstraction has 5300 states and 6502 transitions. [2024-10-12 16:30:43,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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 16:30:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 6502 transitions. [2024-10-12 16:30:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-12 16:30:43,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:43,923 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 16:30:43,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:30:43,924 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:43,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1155799671, now seen corresponding path program 1 times [2024-10-12 16:30:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531691938] [2024-10-12 16:30:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:43,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:30:44,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:44,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531691938] [2024-10-12 16:30:44,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531691938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:44,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:44,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:44,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297040090] [2024-10-12 16:30:44,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:44,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:44,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:44,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:44,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:44,147 INFO L87 Difference]: Start difference. First operand 5300 states and 6502 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 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 16:30:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:45,809 INFO L93 Difference]: Finished difference Result 13156 states and 16528 transitions. [2024-10-12 16:30:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:45,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 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 16:30:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:45,836 INFO L225 Difference]: With dead ends: 13156 [2024-10-12 16:30:45,837 INFO L226 Difference]: Without dead ends: 7857 [2024-10-12 16:30:45,845 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 16:30:45,847 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 500 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:45,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 805 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:30:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7857 states. [2024-10-12 16:30:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7857 to 7857. [2024-10-12 16:30:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7857 states, 7856 states have (on average 1.210285132382892) internal successors, (9508), 7856 states have internal predecessors, (9508), 0 states have call successors, (0), 0 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 16:30:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 9508 transitions. [2024-10-12 16:30:45,963 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 9508 transitions. Word has length 191 [2024-10-12 16:30:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:45,963 INFO L471 AbstractCegarLoop]: Abstraction has 7857 states and 9508 transitions. [2024-10-12 16:30:45,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 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 16:30:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 9508 transitions. [2024-10-12 16:30:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-10-12 16:30:45,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:45,969 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:30:45,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:30:45,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:45,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:45,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1810310512, now seen corresponding path program 1 times [2024-10-12 16:30:45,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:45,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180695941] [2024-10-12 16:30:45,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:45,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-10-12 16:30:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180695941] [2024-10-12 16:30:46,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180695941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:46,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:46,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:46,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966203748] [2024-10-12 16:30:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:46,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:46,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:46,321 INFO L87 Difference]: Start difference. First operand 7857 states and 9508 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 16:30:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:48,357 INFO L93 Difference]: Finished difference Result 23004 states and 27849 transitions. [2024-10-12 16:30:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:48,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 295 [2024-10-12 16:30:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:48,391 INFO L225 Difference]: With dead ends: 23004 [2024-10-12 16:30:48,391 INFO L226 Difference]: Without dead ends: 15148 [2024-10-12 16:30:48,402 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 16:30:48,403 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 463 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:48,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 920 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 16:30:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15148 states. [2024-10-12 16:30:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15148 to 12994. [2024-10-12 16:30:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12994 states, 12993 states have (on average 1.2274301546986839) internal successors, (15948), 12993 states have internal predecessors, (15948), 0 states have call successors, (0), 0 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 16:30:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12994 states to 12994 states and 15948 transitions. [2024-10-12 16:30:48,603 INFO L78 Accepts]: Start accepts. Automaton has 12994 states and 15948 transitions. Word has length 295 [2024-10-12 16:30:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:48,604 INFO L471 AbstractCegarLoop]: Abstraction has 12994 states and 15948 transitions. [2024-10-12 16:30:48,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 16:30:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 12994 states and 15948 transitions. [2024-10-12 16:30:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-10-12 16:30:48,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:48,609 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:30:48,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:30:48,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:48,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1792699051, now seen corresponding path program 1 times [2024-10-12 16:30:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:48,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403978475] [2024-10-12 16:30:48,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-10-12 16:30:48,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:48,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403978475] [2024-10-12 16:30:48,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403978475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:48,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:48,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:48,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864596432] [2024-10-12 16:30:48,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:48,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:48,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:48,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:48,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:48,833 INFO L87 Difference]: Start difference. First operand 12994 states and 15948 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:50,655 INFO L93 Difference]: Finished difference Result 31500 states and 38601 transitions. [2024-10-12 16:30:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:50,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 296 [2024-10-12 16:30:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:50,687 INFO L225 Difference]: With dead ends: 31500 [2024-10-12 16:30:50,688 INFO L226 Difference]: Without dead ends: 17657 [2024-10-12 16:30:50,703 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 16:30:50,704 INFO L432 NwaCegarLoop]: 879 mSDtfsCounter, 400 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:50,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 949 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:30:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17657 states. [2024-10-12 16:30:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17657 to 12120. [2024-10-12 16:30:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12120 states, 12119 states have (on average 1.179717798498226) internal successors, (14297), 12119 states have internal predecessors, (14297), 0 states have call successors, (0), 0 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 16:30:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12120 states to 12120 states and 14297 transitions. [2024-10-12 16:30:50,874 INFO L78 Accepts]: Start accepts. Automaton has 12120 states and 14297 transitions. Word has length 296 [2024-10-12 16:30:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:50,875 INFO L471 AbstractCegarLoop]: Abstraction has 12120 states and 14297 transitions. [2024-10-12 16:30:50,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 12120 states and 14297 transitions. [2024-10-12 16:30:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-10-12 16:30:50,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:50,881 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:30:50,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:30:50,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:50,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:50,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1012161555, now seen corresponding path program 1 times [2024-10-12 16:30:50,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:50,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540274282] [2024-10-12 16:30:50,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-12 16:30:51,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:51,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540274282] [2024-10-12 16:30:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540274282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367759276] [2024-10-12 16:30:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:51,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:51,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:51,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:51,160 INFO L87 Difference]: Start difference. First operand 12120 states and 14297 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:52,887 INFO L93 Difference]: Finished difference Result 31044 states and 36680 transitions. [2024-10-12 16:30:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313 [2024-10-12 16:30:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:52,927 INFO L225 Difference]: With dead ends: 31044 [2024-10-12 16:30:52,928 INFO L226 Difference]: Without dead ends: 18925 [2024-10-12 16:30:52,943 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 16:30:52,946 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 448 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:52,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 403 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:30:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18925 states. [2024-10-12 16:30:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18925 to 16792. [2024-10-12 16:30:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16792 states, 16791 states have (on average 1.167887558811268) internal successors, (19610), 16791 states have internal predecessors, (19610), 0 states have call successors, (0), 0 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 16:30:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16792 states to 16792 states and 19610 transitions. [2024-10-12 16:30:53,179 INFO L78 Accepts]: Start accepts. Automaton has 16792 states and 19610 transitions. Word has length 313 [2024-10-12 16:30:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:53,181 INFO L471 AbstractCegarLoop]: Abstraction has 16792 states and 19610 transitions. [2024-10-12 16:30:53,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:30:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 16792 states and 19610 transitions. [2024-10-12 16:30:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-10-12 16:30:53,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:53,189 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:30:53,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:30:53,190 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:53,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:53,190 INFO L85 PathProgramCache]: Analyzing trace with hash -171712320, now seen corresponding path program 1 times [2024-10-12 16:30:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:53,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686317782] [2024-10-12 16:30:53,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-10-12 16:30:53,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:53,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686317782] [2024-10-12 16:30:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686317782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:53,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:53,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581266034] [2024-10-12 16:30:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:53,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:53,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:53,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:53,688 INFO L87 Difference]: Start difference. First operand 16792 states and 19610 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 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 16:30:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:55,288 INFO L93 Difference]: Finished difference Result 41277 states and 48340 transitions. [2024-10-12 16:30:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:55,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 357 [2024-10-12 16:30:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:55,326 INFO L225 Difference]: With dead ends: 41277 [2024-10-12 16:30:55,326 INFO L226 Difference]: Without dead ends: 23622 [2024-10-12 16:30:55,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:55,348 INFO L432 NwaCegarLoop]: 736 mSDtfsCounter, 482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:55,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 798 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:30:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23622 states. [2024-10-12 16:30:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23622 to 21063. [2024-10-12 16:30:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21063 states, 21062 states have (on average 1.1666033615041307) internal successors, (24571), 21062 states have internal predecessors, (24571), 0 states have call successors, (0), 0 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 16:30:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21063 states to 21063 states and 24571 transitions. [2024-10-12 16:30:55,599 INFO L78 Accepts]: Start accepts. Automaton has 21063 states and 24571 transitions. Word has length 357 [2024-10-12 16:30:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:55,600 INFO L471 AbstractCegarLoop]: Abstraction has 21063 states and 24571 transitions. [2024-10-12 16:30:55,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 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 16:30:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 21063 states and 24571 transitions. [2024-10-12 16:30:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-12 16:30:55,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:55,608 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-10-12 16:30:55,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:30:55,608 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:55,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash 544855260, now seen corresponding path program 1 times [2024-10-12 16:30:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:55,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650794797] [2024-10-12 16:30:55,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-12 16:30:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650794797] [2024-10-12 16:30:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650794797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:56,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:30:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634408201] [2024-10-12 16:30:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:56,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:30:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:30:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:30:56,346 INFO L87 Difference]: Start difference. First operand 21063 states and 24571 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 16:30:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:58,820 INFO L93 Difference]: Finished difference Result 61334 states and 70910 transitions. [2024-10-12 16:30:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:30:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 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 365 [2024-10-12 16:30:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:58,880 INFO L225 Difference]: With dead ends: 61334 [2024-10-12 16:30:58,880 INFO L226 Difference]: Without dead ends: 39847 [2024-10-12 16:30:58,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:30:58,903 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 919 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:58,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 187 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:30:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39847 states. [2024-10-12 16:30:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39847 to 26633. [2024-10-12 16:30:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26633 states, 26632 states have (on average 1.1684815259837789) internal successors, (31119), 26632 states have internal predecessors, (31119), 0 states have call successors, (0), 0 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 16:30:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26633 states to 26633 states and 31119 transitions. [2024-10-12 16:30:59,294 INFO L78 Accepts]: Start accepts. Automaton has 26633 states and 31119 transitions. Word has length 365 [2024-10-12 16:30:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:59,295 INFO L471 AbstractCegarLoop]: Abstraction has 26633 states and 31119 transitions. [2024-10-12 16:30:59,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 16:30:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 26633 states and 31119 transitions. [2024-10-12 16:30:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-10-12 16:30:59,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:59,303 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:30:59,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:30:59,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:59,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:59,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1165789282, now seen corresponding path program 1 times [2024-10-12 16:30:59,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:59,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113795053] [2024-10-12 16:30:59,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:59,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-12 16:30:59,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:59,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113795053] [2024-10-12 16:30:59,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113795053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:59,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:59,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:59,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143285905] [2024-10-12 16:30:59,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:59,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:59,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:59,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:59,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:59,689 INFO L87 Difference]: Start difference. First operand 26633 states and 31119 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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 16:31:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:01,284 INFO L93 Difference]: Finished difference Result 64403 states and 75813 transitions. [2024-10-12 16:31:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:01,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 385 [2024-10-12 16:31:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:01,325 INFO L225 Difference]: With dead ends: 64403 [2024-10-12 16:31:01,326 INFO L226 Difference]: Without dead ends: 36921 [2024-10-12 16:31:01,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:01,352 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 379 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:01,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 883 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:31:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36921 states. [2024-10-12 16:31:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36921 to 36057. [2024-10-12 16:31:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36057 states, 36056 states have (on average 1.1453572220989572) internal successors, (41297), 36056 states have internal predecessors, (41297), 0 states have call successors, (0), 0 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 16:31:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36057 states to 36057 states and 41297 transitions. [2024-10-12 16:31:01,912 INFO L78 Accepts]: Start accepts. Automaton has 36057 states and 41297 transitions. Word has length 385 [2024-10-12 16:31:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:01,913 INFO L471 AbstractCegarLoop]: Abstraction has 36057 states and 41297 transitions. [2024-10-12 16:31:01,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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 16:31:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 36057 states and 41297 transitions. [2024-10-12 16:31:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-12 16:31:01,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:01,927 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:31:01,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:31:01,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:01,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 670029058, now seen corresponding path program 1 times [2024-10-12 16:31:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708109167] [2024-10-12 16:31:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:01,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:31:02,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:02,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708109167] [2024-10-12 16:31:02,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708109167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:02,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:02,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:02,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186305913] [2024-10-12 16:31:02,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:02,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:02,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:02,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:02,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:02,321 INFO L87 Difference]: Start difference. First operand 36057 states and 41297 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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 16:31:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:03,984 INFO L93 Difference]: Finished difference Result 82781 states and 94744 transitions. [2024-10-12 16:31:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:03,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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 432 [2024-10-12 16:31:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:04,052 INFO L225 Difference]: With dead ends: 82781 [2024-10-12 16:31:04,052 INFO L226 Difference]: Without dead ends: 45437 [2024-10-12 16:31:04,076 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 16:31:04,078 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 320 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:04,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 743 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:31:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45437 states. [2024-10-12 16:31:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45437 to 36048. [2024-10-12 16:31:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36048 states, 36047 states have (on average 1.1423142009043747) internal successors, (41177), 36047 states have internal predecessors, (41177), 0 states have call successors, (0), 0 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 16:31:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36048 states to 36048 states and 41177 transitions. [2024-10-12 16:31:04,450 INFO L78 Accepts]: Start accepts. Automaton has 36048 states and 41177 transitions. Word has length 432 [2024-10-12 16:31:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:04,451 INFO L471 AbstractCegarLoop]: Abstraction has 36048 states and 41177 transitions. [2024-10-12 16:31:04,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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 16:31:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 36048 states and 41177 transitions. [2024-10-12 16:31:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-10-12 16:31:04,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:04,462 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:31:04,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:31:04,463 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:04,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:04,463 INFO L85 PathProgramCache]: Analyzing trace with hash 255359819, now seen corresponding path program 1 times [2024-10-12 16:31:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980546418] [2024-10-12 16:31:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:04,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:31:05,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:05,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980546418] [2024-10-12 16:31:05,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980546418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:05,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:05,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:31:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488438992] [2024-10-12 16:31:05,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:05,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:31:05,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:05,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:31:05,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:31:05,283 INFO L87 Difference]: Start difference. First operand 36048 states and 41177 transitions. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 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 16:31:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:07,974 INFO L93 Difference]: Finished difference Result 106197 states and 120765 transitions. [2024-10-12 16:31:07,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:31:07,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 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 448 [2024-10-12 16:31:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:08,045 INFO L225 Difference]: With dead ends: 106197 [2024-10-12 16:31:08,045 INFO L226 Difference]: Without dead ends: 69725 [2024-10-12 16:31:08,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:31:08,069 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 782 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:08,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 184 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:31:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69725 states. [2024-10-12 16:31:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69725 to 60286. [2024-10-12 16:31:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60286 states, 60285 states have (on average 1.1287716679107573) internal successors, (68048), 60285 states have internal predecessors, (68048), 0 states have call successors, (0), 0 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 16:31:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60286 states to 60286 states and 68048 transitions. [2024-10-12 16:31:08,953 INFO L78 Accepts]: Start accepts. Automaton has 60286 states and 68048 transitions. Word has length 448 [2024-10-12 16:31:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:08,958 INFO L471 AbstractCegarLoop]: Abstraction has 60286 states and 68048 transitions. [2024-10-12 16:31:08,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 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 16:31:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 60286 states and 68048 transitions. [2024-10-12 16:31:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-10-12 16:31:08,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:08,992 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-10-12 16:31:08,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:31:08,996 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:08,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1506163575, now seen corresponding path program 1 times [2024-10-12 16:31:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32959950] [2024-10-12 16:31:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-10-12 16:31:09,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:09,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32959950] [2024-10-12 16:31:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32959950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978016058] [2024-10-12 16:31:09,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:09,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:09,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:09,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:09,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:09,693 INFO L87 Difference]: Start difference. First operand 60286 states and 68048 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 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 16:31:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:11,551 INFO L93 Difference]: Finished difference Result 140999 states and 159170 transitions. [2024-10-12 16:31:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 467 [2024-10-12 16:31:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:11,634 INFO L225 Difference]: With dead ends: 140999 [2024-10-12 16:31:11,634 INFO L226 Difference]: Without dead ends: 79422 [2024-10-12 16:31:11,678 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 16:31:11,678 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 445 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:11,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 646 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:31:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79422 states. [2024-10-12 16:31:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79422 to 73449. [2024-10-12 16:31:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73449 states, 73448 states have (on average 1.1131140398649384) internal successors, (81756), 73448 states have internal predecessors, (81756), 0 states have call successors, (0), 0 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 16:31:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73449 states to 73449 states and 81756 transitions. [2024-10-12 16:31:12,983 INFO L78 Accepts]: Start accepts. Automaton has 73449 states and 81756 transitions. Word has length 467 [2024-10-12 16:31:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:12,983 INFO L471 AbstractCegarLoop]: Abstraction has 73449 states and 81756 transitions. [2024-10-12 16:31:12,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 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 16:31:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 73449 states and 81756 transitions. [2024-10-12 16:31:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-10-12 16:31:12,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:12,997 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:12,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:31:12,997 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:12,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash 21077806, now seen corresponding path program 1 times [2024-10-12 16:31:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857903607] [2024-10-12 16:31:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-10-12 16:31:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857903607] [2024-10-12 16:31:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857903607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:31:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109072513] [2024-10-12 16:31:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:14,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:31:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:14,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:31:14,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:31:14,021 INFO L87 Difference]: Start difference. First operand 73449 states and 81756 transitions. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 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 16:31:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:16,594 INFO L93 Difference]: Finished difference Result 184846 states and 205030 transitions. [2024-10-12 16:31:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:31:16,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 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 471 [2024-10-12 16:31:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:16,733 INFO L225 Difference]: With dead ends: 184846 [2024-10-12 16:31:16,733 INFO L226 Difference]: Without dead ends: 110973 [2024-10-12 16:31:16,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:31:16,768 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 811 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:16,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 174 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 16:31:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110973 states. [2024-10-12 16:31:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110973 to 102445. [2024-10-12 16:31:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102445 states, 102444 states have (on average 1.1084885400804343) internal successors, (113558), 102444 states have internal predecessors, (113558), 0 states have call successors, (0), 0 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 16:31:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102445 states to 102445 states and 113558 transitions. [2024-10-12 16:31:18,292 INFO L78 Accepts]: Start accepts. Automaton has 102445 states and 113558 transitions. Word has length 471 [2024-10-12 16:31:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:18,293 INFO L471 AbstractCegarLoop]: Abstraction has 102445 states and 113558 transitions. [2024-10-12 16:31:18,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 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 16:31:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 102445 states and 113558 transitions. [2024-10-12 16:31:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-10-12 16:31:18,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:18,310 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:18,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:31:18,311 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:18,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:18,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1132363243, now seen corresponding path program 1 times [2024-10-12 16:31:18,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:18,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456821300] [2024-10-12 16:31:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-10-12 16:31:19,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:19,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456821300] [2024-10-12 16:31:19,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456821300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:19,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:19,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:31:19,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736395412] [2024-10-12 16:31:19,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:19,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:31:19,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:19,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:31:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:31:19,133 INFO L87 Difference]: Start difference. First operand 102445 states and 113558 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 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 16:31:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:21,930 INFO L93 Difference]: Finished difference Result 231728 states and 256393 transitions. [2024-10-12 16:31:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:31:21,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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 491 [2024-10-12 16:31:21,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:22,327 INFO L225 Difference]: With dead ends: 231728 [2024-10-12 16:31:22,327 INFO L226 Difference]: Without dead ends: 128007 [2024-10-12 16:31:22,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:31:22,370 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 806 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:22,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 205 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:31:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128007 states. [2024-10-12 16:31:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128007 to 101162. [2024-10-12 16:31:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101162 states, 101161 states have (on average 1.106029003272012) internal successors, (111887), 101161 states have internal predecessors, (111887), 0 states have call successors, (0), 0 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 16:31:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101162 states to 101162 states and 111887 transitions. [2024-10-12 16:31:24,240 INFO L78 Accepts]: Start accepts. Automaton has 101162 states and 111887 transitions. Word has length 491 [2024-10-12 16:31:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:24,241 INFO L471 AbstractCegarLoop]: Abstraction has 101162 states and 111887 transitions. [2024-10-12 16:31:24,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 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 16:31:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 101162 states and 111887 transitions. [2024-10-12 16:31:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2024-10-12 16:31:24,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:24,259 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:24,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:31:24,260 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1168926500, now seen corresponding path program 1 times [2024-10-12 16:31:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:24,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804830788] [2024-10-12 16:31:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 630 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-12 16:31:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804830788] [2024-10-12 16:31:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804830788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:24,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:31:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686154175] [2024-10-12 16:31:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:24,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:31:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:24,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:31:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:31:24,797 INFO L87 Difference]: Start difference. First operand 101162 states and 111887 transitions. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 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 16:31:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:27,959 INFO L93 Difference]: Finished difference Result 237300 states and 263340 transitions. [2024-10-12 16:31:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:31:27,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 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 511 [2024-10-12 16:31:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:28,123 INFO L225 Difference]: With dead ends: 237300 [2024-10-12 16:31:28,123 INFO L226 Difference]: Without dead ends: 136139 [2024-10-12 16:31:28,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:31:28,147 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 833 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:28,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 197 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:31:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136139 states. [2024-10-12 16:31:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136139 to 126768. [2024-10-12 16:31:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126768 states, 126767 states have (on average 1.1143120843752712) internal successors, (141258), 126767 states have internal predecessors, (141258), 0 states have call successors, (0), 0 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 16:31:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126768 states to 126768 states and 141258 transitions. [2024-10-12 16:31:30,334 INFO L78 Accepts]: Start accepts. Automaton has 126768 states and 141258 transitions. Word has length 511 [2024-10-12 16:31:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:30,334 INFO L471 AbstractCegarLoop]: Abstraction has 126768 states and 141258 transitions. [2024-10-12 16:31:30,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 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 16:31:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 126768 states and 141258 transitions. [2024-10-12 16:31:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2024-10-12 16:31:30,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:30,350 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:30,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:31:30,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:30,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1762125450, now seen corresponding path program 1 times [2024-10-12 16:31:30,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:30,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094985216] [2024-10-12 16:31:30,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:30,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-12 16:31:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:30,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094985216] [2024-10-12 16:31:30,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094985216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:30,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:30,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:31:30,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439790921] [2024-10-12 16:31:30,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:30,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:31:30,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:30,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:31:30,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:31:30,644 INFO L87 Difference]: Start difference. First operand 126768 states and 141258 transitions. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 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 16:31:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:32,842 INFO L93 Difference]: Finished difference Result 282460 states and 315837 transitions. [2024-10-12 16:31:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:31:32,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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 530 [2024-10-12 16:31:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:33,029 INFO L225 Difference]: With dead ends: 282460 [2024-10-12 16:31:33,029 INFO L226 Difference]: Without dead ends: 155693 [2024-10-12 16:31:33,105 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 16:31:33,105 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 391 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:33,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 310 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:31:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155693 states. [2024-10-12 16:31:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155693 to 153980. [2024-10-12 16:31:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153980 states, 153979 states have (on average 1.1081835834756688) internal successors, (170637), 153979 states have internal predecessors, (170637), 0 states have call successors, (0), 0 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 16:31:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153980 states to 153980 states and 170637 transitions. [2024-10-12 16:31:36,245 INFO L78 Accepts]: Start accepts. Automaton has 153980 states and 170637 transitions. Word has length 530 [2024-10-12 16:31:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:31:36,245 INFO L471 AbstractCegarLoop]: Abstraction has 153980 states and 170637 transitions. [2024-10-12 16:31:36,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 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 16:31:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 153980 states and 170637 transitions. [2024-10-12 16:31:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-10-12 16:31:36,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:31:36,280 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:31:36,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 16:31:36,281 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:31:36,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:31:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash 276013354, now seen corresponding path program 1 times [2024-10-12 16:31:36,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:31:36,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363049553] [2024-10-12 16:31:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:31:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:31:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:31:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-10-12 16:31:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:31:37,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363049553] [2024-10-12 16:31:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363049553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:31:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:31:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:31:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782556506] [2024-10-12 16:31:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:31:37,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:31:37,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:31:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:31:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:31:37,269 INFO L87 Difference]: Start difference. First operand 153980 states and 170637 transitions. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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 16:31:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:31:40,373 INFO L93 Difference]: Finished difference Result 334783 states and 370571 transitions. [2024-10-12 16:31:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:31:40,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 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 531 [2024-10-12 16:31:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:31:40,626 INFO L225 Difference]: With dead ends: 334783 [2024-10-12 16:31:40,626 INFO L226 Difference]: Without dead ends: 180378 [2024-10-12 16:31:40,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:31:40,710 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 785 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:31:40,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 225 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 16:31:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180378 states.