./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.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 1f7b08d697525a6b6e4b6c32e081a52208b7f6ea0ef3da259b2ed32d3a516e9b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:35:10,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:35:10,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:35:10,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:35:10,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:35:10,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:35:10,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:35:10,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:35:10,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:35:10,186 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:35:10,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:35:10,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:35:10,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:35:10,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:35:10,188 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:35:10,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:35:10,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:35:10,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:35:10,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:35:10,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:35:10,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:35:10,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:35:10,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:35:10,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:35:10,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:35:10,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:35:10,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:35:10,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:35:10,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:35:10,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:35:10,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:35:10,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:35:10,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:35:10,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:35:10,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:35:10,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:35:10,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:35:10,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:35:10,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:35:10,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:35:10,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:35:10,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:35:10,201 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 -> 1f7b08d697525a6b6e4b6c32e081a52208b7f6ea0ef3da259b2ed32d3a516e9b [2024-10-14 03:35:10,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:35:10,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:35:10,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:35:10,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:35:10,465 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:35:10,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2024-10-14 03:35:11,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:35:12,055 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:35:12,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2024-10-14 03:35:12,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c6f19bf/e7fe6384b46d40e69051f646806e08ff/FLAG24f070db6 [2024-10-14 03:35:12,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c6f19bf/e7fe6384b46d40e69051f646806e08ff [2024-10-14 03:35:12,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:35:12,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:35:12,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:35:12,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:35:12,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:35:12,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f4a6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12, skipping insertion in model container [2024-10-14 03:35:12,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:35:12,714 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/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480] [2024-10-14 03:35:12,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:35:12,729 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:35:12,784 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/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480] [2024-10-14 03:35:12,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:35:12,805 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:35:12,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12 WrapperNode [2024-10-14 03:35:12,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:35:12,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:35:12,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:35:12,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:35:12,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,859 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 490 [2024-10-14 03:35:12,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:35:12,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:35:12,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:35:12,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:35:12,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,894 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-14 03:35:12,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:35:12,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:35:12,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:35:12,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:35:12,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (1/1) ... [2024-10-14 03:35:12,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:35:12,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:35:12,967 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-14 03:35:12,971 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-14 03:35:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:35:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:35:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:35:13,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:35:13,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:35:13,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:35:13,575 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-14 03:35:13,576 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:35:13,643 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:35:13,643 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:35:13,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:35:13 BoogieIcfgContainer [2024-10-14 03:35:13,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:35:13,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:35:13,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:35:13,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:35:13,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:35:12" (1/3) ... [2024-10-14 03:35:13,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601e40e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:35:13, skipping insertion in model container [2024-10-14 03:35:13,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:35:12" (2/3) ... [2024-10-14 03:35:13,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601e40e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:35:13, skipping insertion in model container [2024-10-14 03:35:13,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:35:13" (3/3) ... [2024-10-14 03:35:13,650 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2024-10-14 03:35:13,664 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:35:13,664 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:35:13,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:35:13,741 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;@79745558, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:35:13,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:35:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.814516129032258) internal successors, (225), 125 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:35:13,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:13,755 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] [2024-10-14 03:35:13,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:13,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:13,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1384301439, now seen corresponding path program 1 times [2024-10-14 03:35:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:13,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958567587] [2024-10-14 03:35:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:14,080 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-14 03:35:14,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:14,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958567587] [2024-10-14 03:35:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958567587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:14,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:35:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934090934] [2024-10-14 03:35:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:14,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:35:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:14,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:35:14,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:35:14,119 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.814516129032258) internal successors, (225), 125 states have internal predecessors, (225), 0 states have call successors, (0), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:14,161 INFO L93 Difference]: Finished difference Result 193 states and 343 transitions. [2024-10-14 03:35:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:35:14,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-14 03:35:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:14,172 INFO L225 Difference]: With dead ends: 193 [2024-10-14 03:35:14,172 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 03:35:14,175 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-14 03:35:14,177 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:14,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 03:35:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-14 03:35:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.7886178861788617) internal successors, (220), 123 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 220 transitions. [2024-10-14 03:35:14,216 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 220 transitions. Word has length 34 [2024-10-14 03:35:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:14,216 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 220 transitions. [2024-10-14 03:35:14,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 220 transitions. [2024-10-14 03:35:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:35:14,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:14,219 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] [2024-10-14 03:35:14,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:35:14,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:14,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1221722115, now seen corresponding path program 1 times [2024-10-14 03:35:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:14,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002114049] [2024-10-14 03:35:14,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:14,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:14,431 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-14 03:35:14,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:14,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002114049] [2024-10-14 03:35:14,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002114049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:14,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:14,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:35:14,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514896743] [2024-10-14 03:35:14,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:14,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:35:14,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:14,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:35:14,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:14,435 INFO L87 Difference]: Start difference. First operand 124 states and 220 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:14,520 INFO L93 Difference]: Finished difference Result 193 states and 337 transitions. [2024-10-14 03:35:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:35:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-14 03:35:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:14,524 INFO L225 Difference]: With dead ends: 193 [2024-10-14 03:35:14,524 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 03:35:14,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:14,526 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:14,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:35:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 03:35:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-14 03:35:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.5447154471544715) internal successors, (190), 123 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 190 transitions. [2024-10-14 03:35:14,541 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 190 transitions. Word has length 34 [2024-10-14 03:35:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:14,541 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 190 transitions. [2024-10-14 03:35:14,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 190 transitions. [2024-10-14 03:35:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:35:14,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:14,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:14,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:35:14,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:14,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:14,544 INFO L85 PathProgramCache]: Analyzing trace with hash 480220631, now seen corresponding path program 1 times [2024-10-14 03:35:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:14,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963000046] [2024-10-14 03:35:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:14,766 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-14 03:35:14,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:14,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963000046] [2024-10-14 03:35:14,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963000046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:14,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964250747] [2024-10-14 03:35:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:14,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:14,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:14,768 INFO L87 Difference]: Start difference. First operand 124 states and 190 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:14,821 INFO L93 Difference]: Finished difference Result 246 states and 400 transitions. [2024-10-14 03:35:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:14,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-14 03:35:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:14,824 INFO L225 Difference]: With dead ends: 246 [2024-10-14 03:35:14,826 INFO L226 Difference]: Without dead ends: 180 [2024-10-14 03:35:14,827 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-14 03:35:14,828 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 88 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:14,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 330 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-14 03:35:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-10-14 03:35:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.5819209039548023) internal successors, (280), 177 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 280 transitions. [2024-10-14 03:35:14,841 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 280 transitions. Word has length 63 [2024-10-14 03:35:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:14,841 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 280 transitions. [2024-10-14 03:35:14,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 280 transitions. [2024-10-14 03:35:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:35:14,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:14,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:14,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:35:14,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:14,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1065677961, now seen corresponding path program 1 times [2024-10-14 03:35:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240631109] [2024-10-14 03:35:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:14,950 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-14 03:35:14,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:14,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240631109] [2024-10-14 03:35:14,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240631109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:14,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675120820] [2024-10-14 03:35:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:14,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:14,953 INFO L87 Difference]: Start difference. First operand 178 states and 280 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:14,980 INFO L93 Difference]: Finished difference Result 402 states and 660 transitions. [2024-10-14 03:35:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:14,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-14 03:35:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:14,982 INFO L225 Difference]: With dead ends: 402 [2024-10-14 03:35:14,984 INFO L226 Difference]: Without dead ends: 282 [2024-10-14 03:35:14,985 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-14 03:35:14,986 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 90 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:14,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 342 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-14 03:35:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2024-10-14 03:35:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.6236559139784945) internal successors, (453), 279 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 453 transitions. [2024-10-14 03:35:15,010 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 453 transitions. Word has length 65 [2024-10-14 03:35:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:15,010 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 453 transitions. [2024-10-14 03:35:15,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 453 transitions. [2024-10-14 03:35:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:35:15,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:15,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:15,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:35:15,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1472684379, now seen corresponding path program 1 times [2024-10-14 03:35:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:15,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847482205] [2024-10-14 03:35:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:15,115 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-14 03:35:15,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:15,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847482205] [2024-10-14 03:35:15,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847482205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:15,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:15,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090375774] [2024-10-14 03:35:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:15,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:15,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:15,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:15,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:15,118 INFO L87 Difference]: Start difference. First operand 280 states and 453 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:15,147 INFO L93 Difference]: Finished difference Result 692 states and 1151 transitions. [2024-10-14 03:35:15,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:15,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-14 03:35:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:15,151 INFO L225 Difference]: With dead ends: 692 [2024-10-14 03:35:15,152 INFO L226 Difference]: Without dead ends: 470 [2024-10-14 03:35:15,153 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-14 03:35:15,155 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 84 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:15,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 343 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-14 03:35:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2024-10-14 03:35:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.6466809421841542) internal successors, (769), 467 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 769 transitions. [2024-10-14 03:35:15,180 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 769 transitions. Word has length 67 [2024-10-14 03:35:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:15,181 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 769 transitions. [2024-10-14 03:35:15,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 769 transitions. [2024-10-14 03:35:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:35:15,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:15,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:15,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:35:15,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:15,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1702765645, now seen corresponding path program 1 times [2024-10-14 03:35:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:15,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421514075] [2024-10-14 03:35:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:15,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:15,321 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-14 03:35:15,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:15,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421514075] [2024-10-14 03:35:15,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421514075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:15,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:15,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:35:15,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270346265] [2024-10-14 03:35:15,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:15,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:35:15,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:15,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:35:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:35:15,325 INFO L87 Difference]: Start difference. First operand 468 states and 769 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:15,486 INFO L93 Difference]: Finished difference Result 1980 states and 3359 transitions. [2024-10-14 03:35:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:35:15,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-14 03:35:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:15,495 INFO L225 Difference]: With dead ends: 1980 [2024-10-14 03:35:15,495 INFO L226 Difference]: Without dead ends: 1570 [2024-10-14 03:35:15,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:35:15,498 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 659 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:15,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1133 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:35:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-10-14 03:35:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 826. [2024-10-14 03:35:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.6654545454545455) internal successors, (1374), 825 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1374 transitions. [2024-10-14 03:35:15,540 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1374 transitions. Word has length 69 [2024-10-14 03:35:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:15,541 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1374 transitions. [2024-10-14 03:35:15,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1374 transitions. [2024-10-14 03:35:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 03:35:15,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:15,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:15,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:35:15,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:15,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1183406413, now seen corresponding path program 1 times [2024-10-14 03:35:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598002447] [2024-10-14 03:35:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:15,621 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-14 03:35:15,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:15,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598002447] [2024-10-14 03:35:15,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598002447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:15,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:15,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:35:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648556896] [2024-10-14 03:35:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:35:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:35:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:15,625 INFO L87 Difference]: Start difference. First operand 826 states and 1374 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:15,708 INFO L93 Difference]: Finished difference Result 2398 states and 4060 transitions. [2024-10-14 03:35:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:35:15,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-14 03:35:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:15,715 INFO L225 Difference]: With dead ends: 2398 [2024-10-14 03:35:15,715 INFO L226 Difference]: Without dead ends: 1630 [2024-10-14 03:35:15,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:35:15,717 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 327 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:15,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 605 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:35:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2024-10-14 03:35:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1219. [2024-10-14 03:35:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 1.674055829228243) internal successors, (2039), 1218 states have internal predecessors, (2039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2039 transitions. [2024-10-14 03:35:15,753 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2039 transitions. Word has length 70 [2024-10-14 03:35:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:15,753 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 2039 transitions. [2024-10-14 03:35:15,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2039 transitions. [2024-10-14 03:35:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:35:15,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:15,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:15,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:35:15,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:15,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1621689265, now seen corresponding path program 1 times [2024-10-14 03:35:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768605763] [2024-10-14 03:35:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:15,835 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-14 03:35:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768605763] [2024-10-14 03:35:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768605763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:15,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:15,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138735627] [2024-10-14 03:35:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:15,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:15,837 INFO L87 Difference]: Start difference. First operand 1219 states and 2039 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:15,881 INFO L93 Difference]: Finished difference Result 2417 states and 4058 transitions. [2024-10-14 03:35:15,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:15,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-14 03:35:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:15,888 INFO L225 Difference]: With dead ends: 2417 [2024-10-14 03:35:15,888 INFO L226 Difference]: Without dead ends: 1747 [2024-10-14 03:35:15,889 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-14 03:35:15,891 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 91 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:15,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 410 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2024-10-14 03:35:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1745. [2024-10-14 03:35:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1744 states have (on average 1.6639908256880733) internal successors, (2902), 1744 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2902 transitions. [2024-10-14 03:35:15,943 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2902 transitions. Word has length 71 [2024-10-14 03:35:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:15,944 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2902 transitions. [2024-10-14 03:35:15,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2902 transitions. [2024-10-14 03:35:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:35:15,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:15,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:15,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:35:15,945 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:15,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash -894960913, now seen corresponding path program 1 times [2024-10-14 03:35:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:15,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162566311] [2024-10-14 03:35:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:16,026 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-14 03:35:16,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:16,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162566311] [2024-10-14 03:35:16,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162566311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:16,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:16,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:16,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104171314] [2024-10-14 03:35:16,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:16,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:16,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:16,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:16,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:16,028 INFO L87 Difference]: Start difference. First operand 1745 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:16,087 INFO L93 Difference]: Finished difference Result 3413 states and 5698 transitions. [2024-10-14 03:35:16,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:16,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-14 03:35:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:16,095 INFO L225 Difference]: With dead ends: 3413 [2024-10-14 03:35:16,095 INFO L226 Difference]: Without dead ends: 2469 [2024-10-14 03:35:16,097 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-14 03:35:16,097 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 85 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:16,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 399 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2024-10-14 03:35:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2024-10-14 03:35:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 1.6536901865369018) internal successors, (4078), 2466 states have internal predecessors, (4078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 4078 transitions. [2024-10-14 03:35:16,163 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 4078 transitions. Word has length 71 [2024-10-14 03:35:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:16,164 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 4078 transitions. [2024-10-14 03:35:16,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 4078 transitions. [2024-10-14 03:35:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:35:16,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:16,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:16,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:35:16,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:16,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2026376138, now seen corresponding path program 1 times [2024-10-14 03:35:16,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:16,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637185697] [2024-10-14 03:35:16,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:16,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:16,275 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-14 03:35:16,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:16,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637185697] [2024-10-14 03:35:16,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637185697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:16,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:16,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:35:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808275953] [2024-10-14 03:35:16,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:16,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:35:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:35:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:16,278 INFO L87 Difference]: Start difference. First operand 2467 states and 4078 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:16,381 INFO L93 Difference]: Finished difference Result 7754 states and 12893 transitions. [2024-10-14 03:35:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:35:16,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-14 03:35:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:16,397 INFO L225 Difference]: With dead ends: 7754 [2024-10-14 03:35:16,397 INFO L226 Difference]: Without dead ends: 5403 [2024-10-14 03:35:16,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:35:16,405 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 326 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:16,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 602 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2024-10-14 03:35:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 3917. [2024-10-14 03:35:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3917 states, 3916 states have (on average 1.646067415730337) internal successors, (6446), 3916 states have internal predecessors, (6446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 6446 transitions. [2024-10-14 03:35:16,514 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 6446 transitions. Word has length 71 [2024-10-14 03:35:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:16,514 INFO L471 AbstractCegarLoop]: Abstraction has 3917 states and 6446 transitions. [2024-10-14 03:35:16,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 6446 transitions. [2024-10-14 03:35:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:35:16,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:16,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:35:16,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:35:16,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:16,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1319668305, now seen corresponding path program 1 times [2024-10-14 03:35:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:16,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412548535] [2024-10-14 03:35:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:35:16,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412548535] [2024-10-14 03:35:16,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412548535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:16,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:16,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:16,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917936611] [2024-10-14 03:35:16,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:16,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:16,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:16,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:16,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:16,582 INFO L87 Difference]: Start difference. First operand 3917 states and 6446 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:16,706 INFO L93 Difference]: Finished difference Result 8718 states and 14491 transitions. [2024-10-14 03:35:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:16,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-14 03:35:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:16,725 INFO L225 Difference]: With dead ends: 8718 [2024-10-14 03:35:16,725 INFO L226 Difference]: Without dead ends: 5892 [2024-10-14 03:35:16,730 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-14 03:35:16,731 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 97 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:16,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 427 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2024-10-14 03:35:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5890. [2024-10-14 03:35:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5890 states, 5889 states have (on average 1.641365257259297) internal successors, (9666), 5889 states have internal predecessors, (9666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5890 states to 5890 states and 9666 transitions. [2024-10-14 03:35:16,888 INFO L78 Accepts]: Start accepts. Automaton has 5890 states and 9666 transitions. Word has length 71 [2024-10-14 03:35:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:16,888 INFO L471 AbstractCegarLoop]: Abstraction has 5890 states and 9666 transitions. [2024-10-14 03:35:16,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5890 states and 9666 transitions. [2024-10-14 03:35:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:35:16,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:16,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:16,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:35:16,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:16,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:16,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1555031638, now seen corresponding path program 1 times [2024-10-14 03:35:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:16,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550560688] [2024-10-14 03:35:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:16,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:16,987 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-14 03:35:16,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:16,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550560688] [2024-10-14 03:35:16,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550560688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:16,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:16,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:35:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570162611] [2024-10-14 03:35:16,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:16,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:35:16,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:16,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:35:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:16,991 INFO L87 Difference]: Start difference. First operand 5890 states and 9666 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:17,243 INFO L93 Difference]: Finished difference Result 18560 states and 30532 transitions. [2024-10-14 03:35:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:35:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-10-14 03:35:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:17,284 INFO L225 Difference]: With dead ends: 18560 [2024-10-14 03:35:17,284 INFO L226 Difference]: Without dead ends: 12746 [2024-10-14 03:35:17,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:35:17,298 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 324 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:17,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 604 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:35:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12746 states. [2024-10-14 03:35:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12746 to 9275. [2024-10-14 03:35:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9275 states, 9274 states have (on average 1.6293940047444468) internal successors, (15111), 9274 states have internal predecessors, (15111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 15111 transitions. [2024-10-14 03:35:17,630 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 15111 transitions. Word has length 72 [2024-10-14 03:35:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:17,630 INFO L471 AbstractCegarLoop]: Abstraction has 9275 states and 15111 transitions. [2024-10-14 03:35:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 15111 transitions. [2024-10-14 03:35:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:35:17,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:17,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:35:17,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:17,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1739531394, now seen corresponding path program 1 times [2024-10-14 03:35:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:17,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617925114] [2024-10-14 03:35:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:17,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:17,815 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-14 03:35:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:17,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617925114] [2024-10-14 03:35:17,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617925114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:17,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:17,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:35:17,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502947311] [2024-10-14 03:35:17,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:17,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:35:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:35:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:35:17,817 INFO L87 Difference]: Start difference. First operand 9275 states and 15111 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:18,066 INFO L93 Difference]: Finished difference Result 18476 states and 30121 transitions. [2024-10-14 03:35:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:35:18,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-14 03:35:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:18,083 INFO L225 Difference]: With dead ends: 18476 [2024-10-14 03:35:18,084 INFO L226 Difference]: Without dead ends: 9277 [2024-10-14 03:35:18,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:35:18,094 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 169 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:18,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 498 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:35:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9277 states. [2024-10-14 03:35:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9277 to 9275. [2024-10-14 03:35:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9275 states, 9274 states have (on average 1.615915462583567) internal successors, (14986), 9274 states have internal predecessors, (14986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 14986 transitions. [2024-10-14 03:35:18,383 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 14986 transitions. Word has length 74 [2024-10-14 03:35:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:18,384 INFO L471 AbstractCegarLoop]: Abstraction has 9275 states and 14986 transitions. [2024-10-14 03:35:18,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:18,384 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 14986 transitions. [2024-10-14 03:35:18,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:35:18,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:18,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:35:18,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:35:18,385 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:18,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash -770026797, now seen corresponding path program 1 times [2024-10-14 03:35:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:18,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410605147] [2024-10-14 03:35:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:18,551 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-14 03:35:18,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:18,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410605147] [2024-10-14 03:35:18,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410605147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:18,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:18,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:35:18,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405981012] [2024-10-14 03:35:18,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:18,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:35:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:18,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:35:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:35:18,554 INFO L87 Difference]: Start difference. First operand 9275 states and 14986 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:18,882 INFO L93 Difference]: Finished difference Result 26568 states and 43073 transitions. [2024-10-14 03:35:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:35:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-14 03:35:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:18,918 INFO L225 Difference]: With dead ends: 26568 [2024-10-14 03:35:18,918 INFO L226 Difference]: Without dead ends: 17369 [2024-10-14 03:35:18,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:35:18,932 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 83 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:18,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 666 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:35:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17369 states. [2024-10-14 03:35:19,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17369 to 17367. [2024-10-14 03:35:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17367 states, 17366 states have (on average 1.6007716227110447) internal successors, (27799), 17366 states have internal predecessors, (27799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17367 states to 17367 states and 27799 transitions. [2024-10-14 03:35:19,480 INFO L78 Accepts]: Start accepts. Automaton has 17367 states and 27799 transitions. Word has length 77 [2024-10-14 03:35:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:19,481 INFO L471 AbstractCegarLoop]: Abstraction has 17367 states and 27799 transitions. [2024-10-14 03:35:19,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 17367 states and 27799 transitions. [2024-10-14 03:35:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:35:19,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:19,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:19,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:35:19,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:19,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1884453877, now seen corresponding path program 1 times [2024-10-14 03:35:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:19,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30133497] [2024-10-14 03:35:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:19,663 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-14 03:35:19,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:19,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30133497] [2024-10-14 03:35:19,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30133497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:19,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:19,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:35:19,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264760399] [2024-10-14 03:35:19,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:19,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:35:19,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:19,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:35:19,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:19,665 INFO L87 Difference]: Start difference. First operand 17367 states and 27799 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:19,960 INFO L93 Difference]: Finished difference Result 18093 states and 28886 transitions. [2024-10-14 03:35:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:35:19,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-14 03:35:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:19,993 INFO L225 Difference]: With dead ends: 18093 [2024-10-14 03:35:19,993 INFO L226 Difference]: Without dead ends: 18091 [2024-10-14 03:35:20,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:20,006 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:20,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18091 states. [2024-10-14 03:35:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18091 to 18091. [2024-10-14 03:35:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18091 states, 18090 states have (on average 1.5762299613045883) internal successors, (28514), 18090 states have internal predecessors, (28514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18091 states to 18091 states and 28514 transitions. [2024-10-14 03:35:20,472 INFO L78 Accepts]: Start accepts. Automaton has 18091 states and 28514 transitions. Word has length 78 [2024-10-14 03:35:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:20,472 INFO L471 AbstractCegarLoop]: Abstraction has 18091 states and 28514 transitions. [2024-10-14 03:35:20,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18091 states and 28514 transitions. [2024-10-14 03:35:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:35:20,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:20,474 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:20,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:35:20,474 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:20,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1055535180, now seen corresponding path program 1 times [2024-10-14 03:35:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:20,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711442992] [2024-10-14 03:35:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:20,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:35:20,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711442992] [2024-10-14 03:35:20,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711442992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:20,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:20,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:35:20,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116193095] [2024-10-14 03:35:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:20,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:35:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:20,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:35:20,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:35:20,612 INFO L87 Difference]: Start difference. First operand 18091 states and 28514 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:21,088 INFO L93 Difference]: Finished difference Result 44397 states and 70178 transitions. [2024-10-14 03:35:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:35:21,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 103 [2024-10-14 03:35:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:21,165 INFO L225 Difference]: With dead ends: 44397 [2024-10-14 03:35:21,166 INFO L226 Difference]: Without dead ends: 35785 [2024-10-14 03:35:21,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:35:21,186 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 408 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:21,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 855 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:35:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35785 states. [2024-10-14 03:35:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35785 to 27861. [2024-10-14 03:35:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27861 states, 27860 states have (on average 1.5737975592246949) internal successors, (43846), 27860 states have internal predecessors, (43846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27861 states to 27861 states and 43846 transitions. [2024-10-14 03:35:21,980 INFO L78 Accepts]: Start accepts. Automaton has 27861 states and 43846 transitions. Word has length 103 [2024-10-14 03:35:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:21,981 INFO L471 AbstractCegarLoop]: Abstraction has 27861 states and 43846 transitions. [2024-10-14 03:35:21,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 27861 states and 43846 transitions. [2024-10-14 03:35:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:35:21,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:21,983 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:21,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:35:21,983 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:21,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash -328806828, now seen corresponding path program 1 times [2024-10-14 03:35:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:21,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257167123] [2024-10-14 03:35:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:35:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257167123] [2024-10-14 03:35:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257167123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:22,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:35:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290452477] [2024-10-14 03:35:22,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:22,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:35:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:22,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:35:22,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:35:22,121 INFO L87 Difference]: Start difference. First operand 27861 states and 43846 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:22,703 INFO L93 Difference]: Finished difference Result 47873 states and 75670 transitions. [2024-10-14 03:35:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:35:22,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 103 [2024-10-14 03:35:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:22,779 INFO L225 Difference]: With dead ends: 47873 [2024-10-14 03:35:22,780 INFO L226 Difference]: Without dead ends: 39261 [2024-10-14 03:35:22,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:35:22,802 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 419 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:22,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 776 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:35:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39261 states. [2024-10-14 03:35:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39261 to 37815. [2024-10-14 03:35:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37815 states, 37814 states have (on average 1.5738615327656424) internal successors, (59514), 37814 states have internal predecessors, (59514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37815 states to 37815 states and 59514 transitions. [2024-10-14 03:35:23,590 INFO L78 Accepts]: Start accepts. Automaton has 37815 states and 59514 transitions. Word has length 103 [2024-10-14 03:35:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:23,591 INFO L471 AbstractCegarLoop]: Abstraction has 37815 states and 59514 transitions. [2024-10-14 03:35:23,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 37815 states and 59514 transitions. [2024-10-14 03:35:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:35:23,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:23,593 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:23,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:35:23,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:23,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash -753514220, now seen corresponding path program 1 times [2024-10-14 03:35:23,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:23,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399544290] [2024-10-14 03:35:23,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:23,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:35:23,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399544290] [2024-10-14 03:35:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399544290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:35:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943418002] [2024-10-14 03:35:23,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:35:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:23,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:35:23,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:35:23,723 INFO L87 Difference]: Start difference. First operand 37815 states and 59514 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:24,461 INFO L93 Difference]: Finished difference Result 53799 states and 85194 transitions. [2024-10-14 03:35:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:35:24,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 103 [2024-10-14 03:35:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:24,570 INFO L225 Difference]: With dead ends: 53799 [2024-10-14 03:35:24,570 INFO L226 Difference]: Without dead ends: 44957 [2024-10-14 03:35:24,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:35:24,596 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 408 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:24,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 864 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:35:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44957 states. [2024-10-14 03:35:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44957 to 43511. [2024-10-14 03:35:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43511 states, 43510 states have (on average 1.5766030797517812) internal successors, (68598), 43510 states have internal predecessors, (68598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43511 states to 43511 states and 68598 transitions. [2024-10-14 03:35:25,591 INFO L78 Accepts]: Start accepts. Automaton has 43511 states and 68598 transitions. Word has length 103 [2024-10-14 03:35:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:25,591 INFO L471 AbstractCegarLoop]: Abstraction has 43511 states and 68598 transitions. [2024-10-14 03:35:25,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 43511 states and 68598 transitions. [2024-10-14 03:35:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 03:35:25,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:25,593 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:25,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:35:25,594 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:25,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1946825370, now seen corresponding path program 1 times [2024-10-14 03:35:25,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:25,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895793565] [2024-10-14 03:35:25,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:25,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:35:25,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:25,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895793565] [2024-10-14 03:35:25,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895793565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:25,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:25,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:35:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147662841] [2024-10-14 03:35:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:25,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:35:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:25,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:35:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:25,701 INFO L87 Difference]: Start difference. First operand 43511 states and 68598 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:26,509 INFO L93 Difference]: Finished difference Result 71154 states and 112827 transitions. [2024-10-14 03:35:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:35:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-14 03:35:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:26,625 INFO L225 Difference]: With dead ends: 71154 [2024-10-14 03:35:26,626 INFO L226 Difference]: Without dead ends: 56616 [2024-10-14 03:35:26,646 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-14 03:35:26,647 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 170 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:26,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 629 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56616 states. [2024-10-14 03:35:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56616 to 55172. [2024-10-14 03:35:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55172 states, 55171 states have (on average 1.5766979028837613) internal successors, (86988), 55171 states have internal predecessors, (86988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55172 states to 55172 states and 86988 transitions. [2024-10-14 03:35:28,021 INFO L78 Accepts]: Start accepts. Automaton has 55172 states and 86988 transitions. Word has length 104 [2024-10-14 03:35:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:28,022 INFO L471 AbstractCegarLoop]: Abstraction has 55172 states and 86988 transitions. [2024-10-14 03:35:28,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 55172 states and 86988 transitions. [2024-10-14 03:35:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 03:35:28,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:28,024 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:28,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:35:28,024 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:28,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1530493476, now seen corresponding path program 1 times [2024-10-14 03:35:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339695009] [2024-10-14 03:35:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:35:28,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:28,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339695009] [2024-10-14 03:35:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339695009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:28,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705347108] [2024-10-14 03:35:28,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:28,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:28,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:28,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:28,098 INFO L87 Difference]: Start difference. First operand 55172 states and 86988 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:29,253 INFO L93 Difference]: Finished difference Result 119538 states and 189154 transitions. [2024-10-14 03:35:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:29,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-14 03:35:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:29,429 INFO L225 Difference]: With dead ends: 119538 [2024-10-14 03:35:29,429 INFO L226 Difference]: Without dead ends: 93444 [2024-10-14 03:35:29,473 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-14 03:35:29,474 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 74 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:29,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 342 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93444 states. [2024-10-14 03:35:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93444 to 93166. [2024-10-14 03:35:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93166 states, 93165 states have (on average 1.576182042612569) internal successors, (146845), 93165 states have internal predecessors, (146845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93166 states to 93166 states and 146845 transitions. [2024-10-14 03:35:31,475 INFO L78 Accepts]: Start accepts. Automaton has 93166 states and 146845 transitions. Word has length 104 [2024-10-14 03:35:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:31,476 INFO L471 AbstractCegarLoop]: Abstraction has 93166 states and 146845 transitions. [2024-10-14 03:35:31,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 93166 states and 146845 transitions. [2024-10-14 03:35:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:35:31,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:31,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:31,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:35:31,478 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:31,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:31,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1627232106, now seen corresponding path program 1 times [2024-10-14 03:35:31,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:31,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743884488] [2024-10-14 03:35:31,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:31,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:35:31,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:31,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743884488] [2024-10-14 03:35:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743884488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:31,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:31,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695224409] [2024-10-14 03:35:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:31,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:31,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:31,577 INFO L87 Difference]: Start difference. First operand 93166 states and 146845 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:32,936 INFO L93 Difference]: Finished difference Result 181012 states and 285671 transitions. [2024-10-14 03:35:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:32,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-14 03:35:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:33,099 INFO L225 Difference]: With dead ends: 181012 [2024-10-14 03:35:33,099 INFO L226 Difference]: Without dead ends: 87922 [2024-10-14 03:35:33,175 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-14 03:35:33,176 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 74 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:33,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:33,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87922 states. [2024-10-14 03:35:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87922 to 87915. [2024-10-14 03:35:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87915 states, 87914 states have (on average 1.5689082512455355) internal successors, (137929), 87914 states have internal predecessors, (137929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87915 states to 87915 states and 137929 transitions. [2024-10-14 03:35:35,123 INFO L78 Accepts]: Start accepts. Automaton has 87915 states and 137929 transitions. Word has length 105 [2024-10-14 03:35:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:35,123 INFO L471 AbstractCegarLoop]: Abstraction has 87915 states and 137929 transitions. [2024-10-14 03:35:35,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 87915 states and 137929 transitions. [2024-10-14 03:35:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:35:35,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:35,125 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:35,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:35:35,126 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:35,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:35,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1572123986, now seen corresponding path program 1 times [2024-10-14 03:35:35,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:35,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192917603] [2024-10-14 03:35:35,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:35,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:35:35,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192917603] [2024-10-14 03:35:35,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192917603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:35,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:35,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:35,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438864711] [2024-10-14 03:35:35,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:35,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:35,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:35,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:35,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:35,178 INFO L87 Difference]: Start difference. First operand 87915 states and 137929 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:37,379 INFO L93 Difference]: Finished difference Result 261522 states and 409395 transitions. [2024-10-14 03:35:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:37,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-14 03:35:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:37,707 INFO L225 Difference]: With dead ends: 261522 [2024-10-14 03:35:37,708 INFO L226 Difference]: Without dead ends: 173685 [2024-10-14 03:35:37,768 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-14 03:35:37,768 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 143 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:37,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 448 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173685 states. [2024-10-14 03:35:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173685 to 173683. [2024-10-14 03:35:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173683 states, 173682 states have (on average 1.5513236835135478) internal successors, (269437), 173682 states have internal predecessors, (269437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173683 states to 173683 states and 269437 transitions. [2024-10-14 03:35:42,056 INFO L78 Accepts]: Start accepts. Automaton has 173683 states and 269437 transitions. Word has length 105 [2024-10-14 03:35:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:42,056 INFO L471 AbstractCegarLoop]: Abstraction has 173683 states and 269437 transitions. [2024-10-14 03:35:42,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 173683 states and 269437 transitions. [2024-10-14 03:35:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:35:42,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:42,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:42,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:35:42,060 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:42,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash 125373270, now seen corresponding path program 1 times [2024-10-14 03:35:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736746963] [2024-10-14 03:35:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:35:42,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:42,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736746963] [2024-10-14 03:35:42,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736746963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:42,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:42,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:42,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678208800] [2024-10-14 03:35:42,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:42,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:42,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:42,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:42,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:42,160 INFO L87 Difference]: Start difference. First operand 173683 states and 269437 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:43,438 INFO L93 Difference]: Finished difference Result 247991 states and 385051 transitions. [2024-10-14 03:35:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:43,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-14 03:35:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:43,558 INFO L225 Difference]: With dead ends: 247991 [2024-10-14 03:35:43,559 INFO L226 Difference]: Without dead ends: 74481 [2024-10-14 03:35:43,660 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-14 03:35:43,660 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 58 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:43,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 371 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74481 states. [2024-10-14 03:35:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74481 to 74231. [2024-10-14 03:35:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74231 states, 74230 states have (on average 1.5439714401185505) internal successors, (114609), 74230 states have internal predecessors, (114609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74231 states to 74231 states and 114609 transitions. [2024-10-14 03:35:45,565 INFO L78 Accepts]: Start accepts. Automaton has 74231 states and 114609 transitions. Word has length 105 [2024-10-14 03:35:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:45,566 INFO L471 AbstractCegarLoop]: Abstraction has 74231 states and 114609 transitions. [2024-10-14 03:35:45,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 74231 states and 114609 transitions. [2024-10-14 03:35:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:35:45,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:45,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:35:45,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:35:45,569 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash 852101622, now seen corresponding path program 1 times [2024-10-14 03:35:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517286011] [2024-10-14 03:35:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:35:45,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:45,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517286011] [2024-10-14 03:35:45,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517286011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:45,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:45,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844461080] [2024-10-14 03:35:45,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:45,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:45,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:45,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:45,696 INFO L87 Difference]: Start difference. First operand 74231 states and 114609 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:46,588 INFO L93 Difference]: Finished difference Result 105611 states and 163167 transitions. [2024-10-14 03:35:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-14 03:35:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:46,646 INFO L225 Difference]: With dead ends: 105611 [2024-10-14 03:35:46,646 INFO L226 Difference]: Without dead ends: 31553 [2024-10-14 03:35:46,673 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-14 03:35:46,673 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 45 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:46,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 346 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31553 states. [2024-10-14 03:35:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31553 to 31495. [2024-10-14 03:35:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31495 states, 31494 states have (on average 1.5350542960563918) internal successors, (48345), 31494 states have internal predecessors, (48345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31495 states to 31495 states and 48345 transitions. [2024-10-14 03:35:47,160 INFO L78 Accepts]: Start accepts. Automaton has 31495 states and 48345 transitions. Word has length 105 [2024-10-14 03:35:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:47,161 INFO L471 AbstractCegarLoop]: Abstraction has 31495 states and 48345 transitions. [2024-10-14 03:35:47,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 31495 states and 48345 transitions. [2024-10-14 03:35:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 03:35:47,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:47,163 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:47,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:35:47,163 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:47,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash 110503649, now seen corresponding path program 1 times [2024-10-14 03:35:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957307474] [2024-10-14 03:35:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:35:47,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957307474] [2024-10-14 03:35:47,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957307474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:47,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:47,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:47,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832876848] [2024-10-14 03:35:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:47,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:35:47,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:35:47,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:47,358 INFO L87 Difference]: Start difference. First operand 31495 states and 48345 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:48,144 INFO L93 Difference]: Finished difference Result 93822 states and 143648 transitions. [2024-10-14 03:35:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:35:48,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 106 [2024-10-14 03:35:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:48,244 INFO L225 Difference]: With dead ends: 93822 [2024-10-14 03:35:48,245 INFO L226 Difference]: Without dead ends: 62363 [2024-10-14 03:35:48,281 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-14 03:35:48,282 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 199 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:48,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 560 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62363 states. [2024-10-14 03:35:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62363 to 62269. [2024-10-14 03:35:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62269 states, 62268 states have (on average 1.5182116014646367) internal successors, (94536), 62268 states have internal predecessors, (94536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62269 states to 62269 states and 94536 transitions. [2024-10-14 03:35:49,673 INFO L78 Accepts]: Start accepts. Automaton has 62269 states and 94536 transitions. Word has length 106 [2024-10-14 03:35:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:49,674 INFO L471 AbstractCegarLoop]: Abstraction has 62269 states and 94536 transitions. [2024-10-14 03:35:49,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 62269 states and 94536 transitions. [2024-10-14 03:35:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 03:35:49,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:49,677 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:49,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:35:49,678 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1965746491, now seen corresponding path program 1 times [2024-10-14 03:35:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546471530] [2024-10-14 03:35:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 03:35:49,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:49,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546471530] [2024-10-14 03:35:49,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546471530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:49,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:49,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807688736] [2024-10-14 03:35:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:49,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:35:49,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:49,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:35:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:35:49,731 INFO L87 Difference]: Start difference. First operand 62269 states and 94536 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:50,529 INFO L93 Difference]: Finished difference Result 124501 states and 189009 transitions. [2024-10-14 03:35:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:35:50,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 107 [2024-10-14 03:35:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:50,634 INFO L225 Difference]: With dead ends: 124501 [2024-10-14 03:35:50,635 INFO L226 Difference]: Without dead ends: 62271 [2024-10-14 03:35:50,688 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-14 03:35:50,688 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:50,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62271 states. [2024-10-14 03:35:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62271 to 62271. [2024-10-14 03:35:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62271 states, 62270 states have (on average 1.5181949574433917) internal successors, (94538), 62270 states have internal predecessors, (94538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62271 states to 62271 states and 94538 transitions. [2024-10-14 03:35:52,127 INFO L78 Accepts]: Start accepts. Automaton has 62271 states and 94538 transitions. Word has length 107 [2024-10-14 03:35:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:52,128 INFO L471 AbstractCegarLoop]: Abstraction has 62271 states and 94538 transitions. [2024-10-14 03:35:52,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 62271 states and 94538 transitions. [2024-10-14 03:35:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 03:35:52,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:52,131 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:52,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:35:52,131 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:52,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2118749093, now seen corresponding path program 1 times [2024-10-14 03:35:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997692434] [2024-10-14 03:35:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:35:52,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:52,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997692434] [2024-10-14 03:35:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997692434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:35:52,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186601513] [2024-10-14 03:35:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:52,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:35:52,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:35:52,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:35:52,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:35:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:52,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 03:35:52,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:35:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:35:52,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:35:52,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186601513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:52,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:35:52,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-10-14 03:35:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974592296] [2024-10-14 03:35:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:52,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:35:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:52,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:35:52,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:35:52,887 INFO L87 Difference]: Start difference. First operand 62271 states and 94538 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:35:53,993 INFO L93 Difference]: Finished difference Result 121607 states and 184932 transitions. [2024-10-14 03:35:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:35:53,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 108 [2024-10-14 03:35:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:35:54,188 INFO L225 Difference]: With dead ends: 121607 [2024-10-14 03:35:54,188 INFO L226 Difference]: Without dead ends: 102069 [2024-10-14 03:35:54,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:35:54,230 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 177 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:35:54,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 474 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:35:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102069 states. [2024-10-14 03:35:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102069 to 97683. [2024-10-14 03:35:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97683 states, 97682 states have (on average 1.5160418500849695) internal successors, (148090), 97682 states have internal predecessors, (148090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97683 states to 97683 states and 148090 transitions. [2024-10-14 03:35:56,432 INFO L78 Accepts]: Start accepts. Automaton has 97683 states and 148090 transitions. Word has length 108 [2024-10-14 03:35:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:35:56,432 INFO L471 AbstractCegarLoop]: Abstraction has 97683 states and 148090 transitions. [2024-10-14 03:35:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:35:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 97683 states and 148090 transitions. [2024-10-14 03:35:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 03:35:56,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:35:56,437 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:35:56,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 03:35:56,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 03:35:56,642 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:35:56,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:35:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1343642646, now seen corresponding path program 1 times [2024-10-14 03:35:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:35:56,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105544211] [2024-10-14 03:35:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:35:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:35:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:35:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:35:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:35:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105544211] [2024-10-14 03:35:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105544211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:35:56,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:35:56,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:35:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892138727] [2024-10-14 03:35:56,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:35:56,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:35:56,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:35:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:35:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:35:56,888 INFO L87 Difference]: Start difference. First operand 97683 states and 148090 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)