./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-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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 87f1dffc4791cf25ae510fd8866e3e496425d62832b1b02adb55ef79c14eda4f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:20:34,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:20:34,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:20:34,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:20:34,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:20:34,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:20:34,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:20:34,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:20:34,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:20:34,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:20:34,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:20:34,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:20:34,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:20:34,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:20:34,846 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:20:34,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:20:34,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:20:34,847 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:20:34,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:20:34,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:20:34,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:20:34,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:20:34,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:20:34,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:20:34,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:20:34,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:20:34,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:20:34,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:20:34,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:20:34,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:20:34,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:20:34,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:20:34,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:20:34,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:20:34,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:20:34,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:20:34,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:20:34,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:20:34,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:20:34,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:20:34,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:20:34,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:20:34,855 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 -> 87f1dffc4791cf25ae510fd8866e3e496425d62832b1b02adb55ef79c14eda4f [2024-10-12 20:20:35,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:20:35,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:20:35,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:20:35,166 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:20:35,166 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:20:35,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-12 20:20:36,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:20:36,755 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:20:36,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-12 20:20:36,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eec9145a/d98c7fc09f9b45c196884089245a15e2/FLAGc75b00684 [2024-10-12 20:20:36,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eec9145a/d98c7fc09f9b45c196884089245a15e2 [2024-10-12 20:20:36,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:20:36,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:20:36,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:20:36,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:20:36,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:20:36,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:20:36" (1/1) ... [2024-10-12 20:20:36,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28324f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:36, skipping insertion in model container [2024-10-12 20:20:36,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:20:36" (1/1) ... [2024-10-12 20:20:36,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:20:37,035 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-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4371,4384] [2024-10-12 20:20:37,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:20:37,072 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:20:37,111 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-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4371,4384] [2024-10-12 20:20:37,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:20:37,155 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:20:37,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37 WrapperNode [2024-10-12 20:20:37,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:20:37,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:20:37,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:20:37,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:20:37,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,203 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 366 [2024-10-12 20:20:37,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:20:37,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:20:37,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:20:37,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:20:37,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,252 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:20:37,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:20:37,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:20:37,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:20:37,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:20:37,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (1/1) ... [2024-10-12 20:20:37,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:20:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:20:37,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:20:37,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:20:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:20:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:20:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:20:37,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:20:37,486 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:20:37,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:20:37,944 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-12 20:20:37,944 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:20:37,995 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:20:37,995 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:20:37,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:20:37 BoogieIcfgContainer [2024-10-12 20:20:37,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:20:37,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:20:38,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:20:38,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:20:38,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:20:36" (1/3) ... [2024-10-12 20:20:38,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56adfbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:20:38, skipping insertion in model container [2024-10-12 20:20:38,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:20:37" (2/3) ... [2024-10-12 20:20:38,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56adfbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:20:38, skipping insertion in model container [2024-10-12 20:20:38,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:20:37" (3/3) ... [2024-10-12 20:20:38,007 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-12 20:20:38,023 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:20:38,024 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:20:38,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:20:38,134 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;@5a00e5d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:20:38,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:20:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 82 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 20:20:38,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:38,147 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] [2024-10-12 20:20:38,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:38,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:38,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1085213270, now seen corresponding path program 1 times [2024-10-12 20:20:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:38,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495695428] [2024-10-12 20:20:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:38,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:38,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495695428] [2024-10-12 20:20:38,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495695428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:38,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943275453] [2024-10-12 20:20:38,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:38,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:38,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:38,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:38,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:38,578 INFO L87 Difference]: Start difference. First operand has 83 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 82 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:38,649 INFO L93 Difference]: Finished difference Result 195 states and 314 transitions. [2024-10-12 20:20:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:38,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-12 20:20:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:38,665 INFO L225 Difference]: With dead ends: 195 [2024-10-12 20:20:38,666 INFO L226 Difference]: Without dead ends: 127 [2024-10-12 20:20:38,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:38,673 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 100 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 292 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-12 20:20:38,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 292 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-12 20:20:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-12 20:20:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.5080645161290323) internal successors, (187), 124 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 187 transitions. [2024-10-12 20:20:38,718 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 187 transitions. Word has length 36 [2024-10-12 20:20:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:38,718 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 187 transitions. [2024-10-12 20:20:38,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 187 transitions. [2024-10-12 20:20:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 20:20:38,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:38,720 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] [2024-10-12 20:20:38,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:20:38,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:38,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1921613256, now seen corresponding path program 1 times [2024-10-12 20:20:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:38,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396282603] [2024-10-12 20:20:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:38,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:38,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396282603] [2024-10-12 20:20:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396282603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:38,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:38,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887561142] [2024-10-12 20:20:38,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:38,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:38,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:38,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:38,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:38,852 INFO L87 Difference]: Start difference. First operand 125 states and 187 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:38,875 INFO L93 Difference]: Finished difference Result 305 states and 471 transitions. [2024-10-12 20:20:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:38,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-12 20:20:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:38,878 INFO L225 Difference]: With dead ends: 305 [2024-10-12 20:20:38,878 INFO L226 Difference]: Without dead ends: 199 [2024-10-12 20:20:38,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:38,880 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 81 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:38,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-12 20:20:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2024-10-12 20:20:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.530612244897959) internal successors, (300), 196 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 300 transitions. [2024-10-12 20:20:38,907 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 300 transitions. Word has length 37 [2024-10-12 20:20:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:38,907 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 300 transitions. [2024-10-12 20:20:38,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 300 transitions. [2024-10-12 20:20:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 20:20:38,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:38,909 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] [2024-10-12 20:20:38,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:20:38,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:38,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1122057593, now seen corresponding path program 1 times [2024-10-12 20:20:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:38,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014550162] [2024-10-12 20:20:38,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:39,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:39,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014550162] [2024-10-12 20:20:39,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014550162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:39,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342147297] [2024-10-12 20:20:39,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:39,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:39,020 INFO L87 Difference]: Start difference. First operand 197 states and 300 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:39,044 INFO L93 Difference]: Finished difference Result 489 states and 758 transitions. [2024-10-12 20:20:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:39,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-12 20:20:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:39,051 INFO L225 Difference]: With dead ends: 489 [2024-10-12 20:20:39,052 INFO L226 Difference]: Without dead ends: 311 [2024-10-12 20:20:39,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:39,054 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 76 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:39,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-12 20:20:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2024-10-12 20:20:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5324675324675325) internal successors, (472), 308 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2024-10-12 20:20:39,075 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 38 [2024-10-12 20:20:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:39,079 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2024-10-12 20:20:39,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2024-10-12 20:20:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 20:20:39,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:39,083 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] [2024-10-12 20:20:39,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:20:39,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:39,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash -664411233, now seen corresponding path program 1 times [2024-10-12 20:20:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:39,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545793171] [2024-10-12 20:20:39,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:39,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:39,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545793171] [2024-10-12 20:20:39,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545793171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:39,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:20:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672719106] [2024-10-12 20:20:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:39,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:20:39,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:39,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:20:39,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:39,301 INFO L87 Difference]: Start difference. First operand 309 states and 472 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:39,409 INFO L93 Difference]: Finished difference Result 1469 states and 2284 transitions. [2024-10-12 20:20:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:20:39,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-12 20:20:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:39,416 INFO L225 Difference]: With dead ends: 1469 [2024-10-12 20:20:39,416 INFO L226 Difference]: Without dead ends: 1179 [2024-10-12 20:20:39,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:20:39,422 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 486 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:39,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 658 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:20:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-10-12 20:20:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 597. [2024-10-12 20:20:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.523489932885906) internal successors, (908), 596 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 908 transitions. [2024-10-12 20:20:39,473 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 908 transitions. Word has length 39 [2024-10-12 20:20:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:39,473 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 908 transitions. [2024-10-12 20:20:39,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 908 transitions. [2024-10-12 20:20:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 20:20:39,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:39,475 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] [2024-10-12 20:20:39,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:20:39,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:39,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash 858631940, now seen corresponding path program 1 times [2024-10-12 20:20:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154642777] [2024-10-12 20:20:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154642777] [2024-10-12 20:20:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154642777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:39,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:39,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:20:39,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903109073] [2024-10-12 20:20:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:39,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:20:39,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:20:39,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:39,623 INFO L87 Difference]: Start difference. First operand 597 states and 908 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:39,688 INFO L93 Difference]: Finished difference Result 2067 states and 3143 transitions. [2024-10-12 20:20:39,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:20:39,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-12 20:20:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:39,695 INFO L225 Difference]: With dead ends: 2067 [2024-10-12 20:20:39,695 INFO L226 Difference]: Without dead ends: 1489 [2024-10-12 20:20:39,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:39,699 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 323 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:39,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 328 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:20:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2024-10-12 20:20:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1485. [2024-10-12 20:20:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1484 states have (on average 1.5067385444743935) internal successors, (2236), 1484 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2236 transitions. [2024-10-12 20:20:39,736 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2236 transitions. Word has length 40 [2024-10-12 20:20:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:39,737 INFO L471 AbstractCegarLoop]: Abstraction has 1485 states and 2236 transitions. [2024-10-12 20:20:39,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2236 transitions. [2024-10-12 20:20:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 20:20:39,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:39,760 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] [2024-10-12 20:20:39,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:20:39,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:39,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:39,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1083564261, now seen corresponding path program 1 times [2024-10-12 20:20:39,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:39,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432467239] [2024-10-12 20:20:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:39,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:39,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:39,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432467239] [2024-10-12 20:20:39,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432467239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:39,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:20:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516667356] [2024-10-12 20:20:39,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:39,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:20:39,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:39,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:20:39,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:39,902 INFO L87 Difference]: Start difference. First operand 1485 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:40,071 INFO L93 Difference]: Finished difference Result 4417 states and 6670 transitions. [2024-10-12 20:20:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:20:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-12 20:20:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:40,087 INFO L225 Difference]: With dead ends: 4417 [2024-10-12 20:20:40,088 INFO L226 Difference]: Without dead ends: 2951 [2024-10-12 20:20:40,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:20:40,092 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 496 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:40,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 137 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:20:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2024-10-12 20:20:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2024-10-12 20:20:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.4993215739484396) internal successors, (4420), 2948 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4420 transitions. [2024-10-12 20:20:40,164 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4420 transitions. Word has length 42 [2024-10-12 20:20:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:40,165 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4420 transitions. [2024-10-12 20:20:40,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4420 transitions. [2024-10-12 20:20:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 20:20:40,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:40,166 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] [2024-10-12 20:20:40,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:20:40,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:40,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash 542600406, now seen corresponding path program 1 times [2024-10-12 20:20:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:40,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068036635] [2024-10-12 20:20:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:40,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:40,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068036635] [2024-10-12 20:20:40,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068036635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:40,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:40,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:20:40,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570456542] [2024-10-12 20:20:40,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:40,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:20:40,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:40,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:20:40,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:40,483 INFO L87 Difference]: Start difference. First operand 2949 states and 4420 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:40,521 INFO L93 Difference]: Finished difference Result 3143 states and 4709 transitions. [2024-10-12 20:20:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:20:40,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-12 20:20:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:40,533 INFO L225 Difference]: With dead ends: 3143 [2024-10-12 20:20:40,533 INFO L226 Difference]: Without dead ends: 3141 [2024-10-12 20:20:40,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:40,537 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:40,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-10-12 20:20:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 3141. [2024-10-12 20:20:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.4687898089171973) internal successors, (4612), 3140 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4612 transitions. [2024-10-12 20:20:40,603 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4612 transitions. Word has length 42 [2024-10-12 20:20:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:40,603 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4612 transitions. [2024-10-12 20:20:40,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4612 transitions. [2024-10-12 20:20:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 20:20:40,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:40,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:20:40,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:20:40,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:40,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -348683587, now seen corresponding path program 1 times [2024-10-12 20:20:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873164167] [2024-10-12 20:20:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:40,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:40,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:40,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873164167] [2024-10-12 20:20:40,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873164167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:40,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:40,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:40,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650294923] [2024-10-12 20:20:40,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:40,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:40,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:40,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:40,678 INFO L87 Difference]: Start difference. First operand 3141 states and 4612 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:40,717 INFO L93 Difference]: Finished difference Result 7603 states and 11170 transitions. [2024-10-12 20:20:40,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:40,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-12 20:20:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:40,734 INFO L225 Difference]: With dead ends: 7603 [2024-10-12 20:20:40,734 INFO L226 Difference]: Without dead ends: 4481 [2024-10-12 20:20:40,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:40,741 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 66 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:40,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 234 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2024-10-12 20:20:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4479. [2024-10-12 20:20:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4479 states, 4478 states have (on average 1.4595801697186244) internal successors, (6536), 4478 states have internal predecessors, (6536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4479 states to 4479 states and 6536 transitions. [2024-10-12 20:20:40,864 INFO L78 Accepts]: Start accepts. Automaton has 4479 states and 6536 transitions. Word has length 43 [2024-10-12 20:20:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:40,864 INFO L471 AbstractCegarLoop]: Abstraction has 4479 states and 6536 transitions. [2024-10-12 20:20:40,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4479 states and 6536 transitions. [2024-10-12 20:20:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 20:20:40,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:40,867 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:20:40,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:20:40,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:40,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1611610844, now seen corresponding path program 1 times [2024-10-12 20:20:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:40,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990346324] [2024-10-12 20:20:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:41,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990346324] [2024-10-12 20:20:41,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990346324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:20:41,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838226234] [2024-10-12 20:20:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:41,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:20:41,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:20:41,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:20:41,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:20:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:41,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 20:20:41,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:20:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:41,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:20:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:42,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838226234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:20:42,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:20:42,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2024-10-12 20:20:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742569283] [2024-10-12 20:20:42,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:20:42,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 20:20:42,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 20:20:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:20:42,685 INFO L87 Difference]: Start difference. First operand 4479 states and 6536 transitions. Second operand has 21 states, 21 states have (on average 8.19047619047619) internal successors, (172), 21 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:51,194 INFO L93 Difference]: Finished difference Result 26295 states and 37921 transitions. [2024-10-12 20:20:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-10-12 20:20:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.19047619047619) internal successors, (172), 21 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-12 20:20:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:51,266 INFO L225 Difference]: With dead ends: 26295 [2024-10-12 20:20:51,266 INFO L226 Difference]: Without dead ends: 21837 [2024-10-12 20:20:51,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11217 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=4143, Invalid=22589, Unknown=0, NotChecked=0, Total=26732 [2024-10-12 20:20:51,284 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 8414 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8414 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:51,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8414 Valid, 1508 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 20:20:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21837 states. [2024-10-12 20:20:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21837 to 18625. [2024-10-12 20:20:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18625 states, 18624 states have (on average 1.430895618556701) internal successors, (26649), 18624 states have internal predecessors, (26649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18625 states to 18625 states and 26649 transitions. [2024-10-12 20:20:51,632 INFO L78 Accepts]: Start accepts. Automaton has 18625 states and 26649 transitions. Word has length 60 [2024-10-12 20:20:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:51,633 INFO L471 AbstractCegarLoop]: Abstraction has 18625 states and 26649 transitions. [2024-10-12 20:20:51,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.19047619047619) internal successors, (172), 21 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18625 states and 26649 transitions. [2024-10-12 20:20:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:20:51,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:51,636 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] [2024-10-12 20:20:51,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:20:51,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:20:51,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:51,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1774270321, now seen corresponding path program 1 times [2024-10-12 20:20:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011722949] [2024-10-12 20:20:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:51,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011722949] [2024-10-12 20:20:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011722949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:51,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:51,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806541022] [2024-10-12 20:20:51,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:51,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:51,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:51,973 INFO L87 Difference]: Start difference. First operand 18625 states and 26649 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:52,049 INFO L93 Difference]: Finished difference Result 29267 states and 41573 transitions. [2024-10-12 20:20:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:52,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 20:20:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:52,086 INFO L225 Difference]: With dead ends: 29267 [2024-10-12 20:20:52,087 INFO L226 Difference]: Without dead ends: 19039 [2024-10-12 20:20:52,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:52,103 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 67 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:52,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19039 states. [2024-10-12 20:20:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19039 to 18674. [2024-10-12 20:20:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18674 states, 18673 states have (on average 1.404862635891394) internal successors, (26233), 18673 states have internal predecessors, (26233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18674 states to 18674 states and 26233 transitions. [2024-10-12 20:20:52,489 INFO L78 Accepts]: Start accepts. Automaton has 18674 states and 26233 transitions. Word has length 61 [2024-10-12 20:20:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:52,489 INFO L471 AbstractCegarLoop]: Abstraction has 18674 states and 26233 transitions. [2024-10-12 20:20:52,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 18674 states and 26233 transitions. [2024-10-12 20:20:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:20:52,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:52,493 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] [2024-10-12 20:20:52,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:20:52,494 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:52,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1902637812, now seen corresponding path program 1 times [2024-10-12 20:20:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:52,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900351294] [2024-10-12 20:20:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:52,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:52,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900351294] [2024-10-12 20:20:52,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900351294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:52,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654333004] [2024-10-12 20:20:52,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:52,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:52,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:52,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:52,563 INFO L87 Difference]: Start difference. First operand 18674 states and 26233 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:52,680 INFO L93 Difference]: Finished difference Result 47570 states and 66424 transitions. [2024-10-12 20:20:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:52,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 20:20:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:52,731 INFO L225 Difference]: With dead ends: 47570 [2024-10-12 20:20:52,731 INFO L226 Difference]: Without dead ends: 31753 [2024-10-12 20:20:52,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:52,756 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:52,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 220 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31753 states. [2024-10-12 20:20:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31753 to 31702. [2024-10-12 20:20:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31702 states, 31701 states have (on average 1.3796410207879877) internal successors, (43736), 31701 states have internal predecessors, (43736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31702 states to 31702 states and 43736 transitions. [2024-10-12 20:20:53,352 INFO L78 Accepts]: Start accepts. Automaton has 31702 states and 43736 transitions. Word has length 61 [2024-10-12 20:20:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:53,352 INFO L471 AbstractCegarLoop]: Abstraction has 31702 states and 43736 transitions. [2024-10-12 20:20:53,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31702 states and 43736 transitions. [2024-10-12 20:20:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:20:53,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:53,355 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] [2024-10-12 20:20:53,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:20:53,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:53,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:53,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1440820303, now seen corresponding path program 1 times [2024-10-12 20:20:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:53,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893216107] [2024-10-12 20:20:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:53,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893216107] [2024-10-12 20:20:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893216107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:53,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:53,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:53,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884100225] [2024-10-12 20:20:53,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:53,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:53,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:53,415 INFO L87 Difference]: Start difference. First operand 31702 states and 43736 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:53,670 INFO L93 Difference]: Finished difference Result 60019 states and 82726 transitions. [2024-10-12 20:20:53,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:53,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 20:20:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:53,730 INFO L225 Difference]: With dead ends: 60019 [2024-10-12 20:20:53,730 INFO L226 Difference]: Without dead ends: 30980 [2024-10-12 20:20:53,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:53,765 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:53,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 264 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30980 states. [2024-10-12 20:20:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30980 to 27401. [2024-10-12 20:20:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27401 states, 27400 states have (on average 1.3677007299270072) internal successors, (37475), 27400 states have internal predecessors, (37475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27401 states to 27401 states and 37475 transitions. [2024-10-12 20:20:54,702 INFO L78 Accepts]: Start accepts. Automaton has 27401 states and 37475 transitions. Word has length 61 [2024-10-12 20:20:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:54,703 INFO L471 AbstractCegarLoop]: Abstraction has 27401 states and 37475 transitions. [2024-10-12 20:20:54,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27401 states and 37475 transitions. [2024-10-12 20:20:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:20:54,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:54,705 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] [2024-10-12 20:20:54,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:20:54,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:54,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash 977464216, now seen corresponding path program 1 times [2024-10-12 20:20:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061300020] [2024-10-12 20:20:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:20:54,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:54,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061300020] [2024-10-12 20:20:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061300020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:54,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:54,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:20:54,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622375192] [2024-10-12 20:20:54,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:54,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:20:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:54,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:20:54,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:54,801 INFO L87 Difference]: Start difference. First operand 27401 states and 37475 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:54,942 INFO L93 Difference]: Finished difference Result 53332 states and 73742 transitions. [2024-10-12 20:20:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:20:54,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 61 [2024-10-12 20:20:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:55,018 INFO L225 Difference]: With dead ends: 53332 [2024-10-12 20:20:55,018 INFO L226 Difference]: Without dead ends: 46159 [2024-10-12 20:20:55,043 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-12 20:20:55,044 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 341 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:55,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 546 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46159 states. [2024-10-12 20:20:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46159 to 34302. [2024-10-12 20:20:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34302 states, 34301 states have (on average 1.3666073875397218) internal successors, (46876), 34301 states have internal predecessors, (46876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34302 states to 34302 states and 46876 transitions. [2024-10-12 20:20:55,741 INFO L78 Accepts]: Start accepts. Automaton has 34302 states and 46876 transitions. Word has length 61 [2024-10-12 20:20:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:55,742 INFO L471 AbstractCegarLoop]: Abstraction has 34302 states and 46876 transitions. [2024-10-12 20:20:55,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 34302 states and 46876 transitions. [2024-10-12 20:20:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:20:55,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:55,746 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] [2024-10-12 20:20:55,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:20:55,747 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:55,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1662623151, now seen corresponding path program 1 times [2024-10-12 20:20:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900073797] [2024-10-12 20:20:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:20:55,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:55,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900073797] [2024-10-12 20:20:55,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900073797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:55,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:55,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:20:55,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706194175] [2024-10-12 20:20:55,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:55,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:20:55,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:55,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:20:55,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:55,867 INFO L87 Difference]: Start difference. First operand 34302 states and 46876 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:56,165 INFO L93 Difference]: Finished difference Result 66248 states and 91449 transitions. [2024-10-12 20:20:56,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:20:56,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 61 [2024-10-12 20:20:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:56,319 INFO L225 Difference]: With dead ends: 66248 [2024-10-12 20:20:56,320 INFO L226 Difference]: Without dead ends: 52614 [2024-10-12 20:20:56,330 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-12 20:20:56,331 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 335 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:56,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 575 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52614 states. [2024-10-12 20:20:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52614 to 45331. [2024-10-12 20:20:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45331 states, 45330 states have (on average 1.3618354290756673) internal successors, (61732), 45330 states have internal predecessors, (61732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45331 states to 45331 states and 61732 transitions. [2024-10-12 20:20:56,895 INFO L78 Accepts]: Start accepts. Automaton has 45331 states and 61732 transitions. Word has length 61 [2024-10-12 20:20:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:56,896 INFO L471 AbstractCegarLoop]: Abstraction has 45331 states and 61732 transitions. [2024-10-12 20:20:56,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 45331 states and 61732 transitions. [2024-10-12 20:20:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:20:56,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:56,902 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] [2024-10-12 20:20:56,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:20:56,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:56,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash -337091279, now seen corresponding path program 1 times [2024-10-12 20:20:56,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:56,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249557158] [2024-10-12 20:20:56,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:56,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:20:56,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:56,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249557158] [2024-10-12 20:20:56,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249557158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:56,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:56,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931404174] [2024-10-12 20:20:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:56,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:56,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:56,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:56,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:56,976 INFO L87 Difference]: Start difference. First operand 45331 states and 61732 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:57,203 INFO L93 Difference]: Finished difference Result 85899 states and 117024 transitions. [2024-10-12 20:20:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 62 [2024-10-12 20:20:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:57,480 INFO L225 Difference]: With dead ends: 85899 [2024-10-12 20:20:57,481 INFO L226 Difference]: Without dead ends: 40858 [2024-10-12 20:20:57,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:57,516 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 82 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:57,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 123 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40858 states. [2024-10-12 20:20:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40858 to 39617. [2024-10-12 20:20:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39617 states, 39616 states have (on average 1.3460218093699516) internal successors, (53324), 39616 states have internal predecessors, (53324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39617 states to 39617 states and 53324 transitions. [2024-10-12 20:20:57,990 INFO L78 Accepts]: Start accepts. Automaton has 39617 states and 53324 transitions. Word has length 62 [2024-10-12 20:20:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:57,991 INFO L471 AbstractCegarLoop]: Abstraction has 39617 states and 53324 transitions. [2024-10-12 20:20:57,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 39617 states and 53324 transitions. [2024-10-12 20:20:57,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:20:57,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:57,993 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:20:57,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:20:57,993 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:57,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1360545378, now seen corresponding path program 1 times [2024-10-12 20:20:57,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189515826] [2024-10-12 20:20:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:20:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:58,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189515826] [2024-10-12 20:20:58,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189515826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:58,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:58,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:20:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576676311] [2024-10-12 20:20:58,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:58,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:20:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:58,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:20:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:58,076 INFO L87 Difference]: Start difference. First operand 39617 states and 53324 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:58,493 INFO L93 Difference]: Finished difference Result 66220 states and 90098 transitions. [2024-10-12 20:20:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:20:58,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 62 [2024-10-12 20:20:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:58,590 INFO L225 Difference]: With dead ends: 66220 [2024-10-12 20:20:58,590 INFO L226 Difference]: Without dead ends: 55954 [2024-10-12 20:20:58,599 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-12 20:20:58,599 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 322 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:58,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 547 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:20:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55954 states. [2024-10-12 20:20:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55954 to 48302. [2024-10-12 20:20:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48302 states, 48301 states have (on average 1.345500093165773) internal successors, (64989), 48301 states have internal predecessors, (64989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48302 states to 48302 states and 64989 transitions. [2024-10-12 20:20:59,231 INFO L78 Accepts]: Start accepts. Automaton has 48302 states and 64989 transitions. Word has length 62 [2024-10-12 20:20:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:59,231 INFO L471 AbstractCegarLoop]: Abstraction has 48302 states and 64989 transitions. [2024-10-12 20:20:59,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48302 states and 64989 transitions. [2024-10-12 20:20:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:20:59,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:59,235 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] [2024-10-12 20:20:59,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:20:59,235 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:59,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:59,235 INFO L85 PathProgramCache]: Analyzing trace with hash 561582588, now seen corresponding path program 1 times [2024-10-12 20:20:59,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:59,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609162024] [2024-10-12 20:20:59,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:59,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:59,328 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-12 20:20:59,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609162024] [2024-10-12 20:20:59,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609162024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:59,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:59,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:20:59,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313609131] [2024-10-12 20:20:59,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:59,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:20:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:59,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:20:59,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:20:59,331 INFO L87 Difference]: Start difference. First operand 48302 states and 64989 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:20:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:59,688 INFO L93 Difference]: Finished difference Result 112828 states and 151620 transitions. [2024-10-12 20:20:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:20:59,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 66 [2024-10-12 20:20:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:59,767 INFO L225 Difference]: With dead ends: 112828 [2024-10-12 20:20:59,767 INFO L226 Difference]: Without dead ends: 64612 [2024-10-12 20:20:59,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:20:59,808 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 437 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:59,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 139 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:20:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64612 states. [2024-10-12 20:21:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64612 to 63948. [2024-10-12 20:21:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63948 states, 63947 states have (on average 1.3311179570581888) internal successors, (85121), 63947 states have internal predecessors, (85121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63948 states to 63948 states and 85121 transitions. [2024-10-12 20:21:00,720 INFO L78 Accepts]: Start accepts. Automaton has 63948 states and 85121 transitions. Word has length 66 [2024-10-12 20:21:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:21:00,720 INFO L471 AbstractCegarLoop]: Abstraction has 63948 states and 85121 transitions. [2024-10-12 20:21:00,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 63948 states and 85121 transitions. [2024-10-12 20:21:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:21:00,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:21:00,724 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] [2024-10-12 20:21:00,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:21:00,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:21:00,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:21:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1883270751, now seen corresponding path program 1 times [2024-10-12 20:21:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:21:00,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61114924] [2024-10-12 20:21:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:21:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:01,200 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-12 20:21:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:21:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61114924] [2024-10-12 20:21:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61114924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:21:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252711303] [2024-10-12 20:21:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:01,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:21:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:21:01,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:21:01,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:21:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:01,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:21:01,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:21:01,484 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-12 20:21:01,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:21:01,578 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-12 20:21:01,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252711303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:21:01,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:21:01,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 20:21:01,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412634792] [2024-10-12 20:21:01,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:21:01,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:21:01,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:21:01,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:21:01,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:21:01,580 INFO L87 Difference]: Start difference. First operand 63948 states and 85121 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:21:02,062 INFO L93 Difference]: Finished difference Result 158369 states and 211053 transitions. [2024-10-12 20:21:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:21:02,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 66 [2024-10-12 20:21:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:21:02,195 INFO L225 Difference]: With dead ends: 158369 [2024-10-12 20:21:02,195 INFO L226 Difference]: Without dead ends: 113525 [2024-10-12 20:21:02,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:21:02,241 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 845 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:21:02,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 341 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:21:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113525 states. [2024-10-12 20:21:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113525 to 78538. [2024-10-12 20:21:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78538 states, 78537 states have (on average 1.329093293606835) internal successors, (104383), 78537 states have internal predecessors, (104383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78538 states to 78538 states and 104383 transitions. [2024-10-12 20:21:03,735 INFO L78 Accepts]: Start accepts. Automaton has 78538 states and 104383 transitions. Word has length 66 [2024-10-12 20:21:03,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:21:03,735 INFO L471 AbstractCegarLoop]: Abstraction has 78538 states and 104383 transitions. [2024-10-12 20:21:03,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 78538 states and 104383 transitions. [2024-10-12 20:21:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:21:03,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:21:03,739 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] [2024-10-12 20:21:03,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:21:03,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 20:21:03,944 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:21:03,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:21:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2036642874, now seen corresponding path program 1 times [2024-10-12 20:21:03,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:21:03,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104987165] [2024-10-12 20:21:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:21:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:21:04,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:21:04,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104987165] [2024-10-12 20:21:04,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104987165] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:21:04,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160108043] [2024-10-12 20:21:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:04,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:21:04,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:21:04,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:21:04,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:21:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:04,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:21:04,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:21:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:21:04,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:21:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:21:04,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160108043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:21:04,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:21:04,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 20:21:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672400079] [2024-10-12 20:21:04,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:21:04,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:21:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:21:04,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:21:04,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:21:04,525 INFO L87 Difference]: Start difference. First operand 78538 states and 104383 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:21:05,007 INFO L93 Difference]: Finished difference Result 135318 states and 179027 transitions. [2024-10-12 20:21:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:21:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-12 20:21:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:21:05,139 INFO L225 Difference]: With dead ends: 135318 [2024-10-12 20:21:05,139 INFO L226 Difference]: Without dead ends: 100198 [2024-10-12 20:21:05,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:21:05,188 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 535 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:21:05,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 325 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:21:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100198 states. [2024-10-12 20:21:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100198 to 83431. [2024-10-12 20:21:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83431 states, 83430 states have (on average 1.3256023013304568) internal successors, (110595), 83430 states have internal predecessors, (110595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83431 states to 83431 states and 110595 transitions. [2024-10-12 20:21:06,482 INFO L78 Accepts]: Start accepts. Automaton has 83431 states and 110595 transitions. Word has length 66 [2024-10-12 20:21:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:21:06,482 INFO L471 AbstractCegarLoop]: Abstraction has 83431 states and 110595 transitions. [2024-10-12 20:21:06,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 83431 states and 110595 transitions. [2024-10-12 20:21:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 20:21:06,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:21:06,486 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:21:06,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 20:21:06,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:21:06,688 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:21:06,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:21:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash -432252977, now seen corresponding path program 1 times [2024-10-12 20:21:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:21:06,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465046141] [2024-10-12 20:21:06,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:21:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:21:07,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:21:07,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465046141] [2024-10-12 20:21:07,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465046141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:21:07,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499896151] [2024-10-12 20:21:07,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:07,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:21:07,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:21:07,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:21:07,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:21:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:07,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:21:07,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:21:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:21:07,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:21:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:21:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499896151] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:21:07,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:21:07,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 20:21:07,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326074256] [2024-10-12 20:21:07,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:21:07,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:21:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:21:07,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:21:07,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:21:07,660 INFO L87 Difference]: Start difference. First operand 83431 states and 110595 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:21:08,145 INFO L93 Difference]: Finished difference Result 174648 states and 230691 transitions. [2024-10-12 20:21:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:21:08,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-12 20:21:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:21:08,270 INFO L225 Difference]: With dead ends: 174648 [2024-10-12 20:21:08,270 INFO L226 Difference]: Without dead ends: 100095 [2024-10-12 20:21:08,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:21:08,334 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 793 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:21:08,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 349 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:21:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100095 states. [2024-10-12 20:21:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100095 to 84903. [2024-10-12 20:21:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84903 states, 84902 states have (on average 1.3209818378836777) internal successors, (112154), 84902 states have internal predecessors, (112154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84903 states to 84903 states and 112154 transitions. [2024-10-12 20:21:09,555 INFO L78 Accepts]: Start accepts. Automaton has 84903 states and 112154 transitions. Word has length 67 [2024-10-12 20:21:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:21:09,556 INFO L471 AbstractCegarLoop]: Abstraction has 84903 states and 112154 transitions. [2024-10-12 20:21:09,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 84903 states and 112154 transitions. [2024-10-12 20:21:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 20:21:09,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:21:09,560 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] [2024-10-12 20:21:09,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 20:21:09,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:21:09,761 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:21:09,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:21:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1037283468, now seen corresponding path program 1 times [2024-10-12 20:21:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:21:09,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149457535] [2024-10-12 20:21:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:21:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:10,058 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-12 20:21:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:21:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149457535] [2024-10-12 20:21:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149457535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:21:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14358663] [2024-10-12 20:21:10,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:10,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:21:10,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:21:10,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:21:10,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:21:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:10,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 20:21:10,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:21:12,176 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-12 20:21:12,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:21:13,900 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-12 20:21:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14358663] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:21:13,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:21:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 16] total 36 [2024-10-12 20:21:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411022541] [2024-10-12 20:21:13,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:21:13,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-12 20:21:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:21:13,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-12 20:21:13,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 20:21:13,903 INFO L87 Difference]: Start difference. First operand 84903 states and 112154 transitions. Second operand has 37 states, 37 states have (on average 4.702702702702703) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:21:25,193 INFO L93 Difference]: Finished difference Result 801089 states and 1039097 transitions. [2024-10-12 20:21:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-10-12 20:21:25,194 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.702702702702703) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-12 20:21:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:21:26,296 INFO L225 Difference]: With dead ends: 801089 [2024-10-12 20:21:26,296 INFO L226 Difference]: Without dead ends: 715991 [2024-10-12 20:21:27,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15184 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=5973, Invalid=31857, Unknown=0, NotChecked=0, Total=37830 [2024-10-12 20:21:27,234 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 7144 mSDsluCounter, 3620 mSDsCounter, 0 mSdLazyCounter, 5200 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7144 SdHoareTripleChecker+Valid, 3896 SdHoareTripleChecker+Invalid, 5316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 5200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:21:27,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7144 Valid, 3896 Invalid, 5316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 5200 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 20:21:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715991 states. [2024-10-12 20:21:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715991 to 347627. [2024-10-12 20:21:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347627 states, 347626 states have (on average 1.308699579433069) internal successors, (454938), 347626 states have internal predecessors, (454938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347627 states to 347627 states and 454938 transitions. [2024-10-12 20:21:34,806 INFO L78 Accepts]: Start accepts. Automaton has 347627 states and 454938 transitions. Word has length 68 [2024-10-12 20:21:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:21:34,806 INFO L471 AbstractCegarLoop]: Abstraction has 347627 states and 454938 transitions. [2024-10-12 20:21:34,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.702702702702703) internal successors, (174), 36 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 347627 states and 454938 transitions. [2024-10-12 20:21:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:21:34,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:21:34,812 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] [2024-10-12 20:21:34,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 20:21:35,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:21:35,017 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:21:35,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:21:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1040321737, now seen corresponding path program 1 times [2024-10-12 20:21:35,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:21:35,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474732444] [2024-10-12 20:21:35,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:21:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:35,071 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-12 20:21:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:21:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474732444] [2024-10-12 20:21:35,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474732444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:21:35,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:21:35,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:21:35,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145942365] [2024-10-12 20:21:35,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:21:35,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:21:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:21:35,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:21:35,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:21:35,074 INFO L87 Difference]: Start difference. First operand 347627 states and 454938 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-12 20:21:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:21:38,559 INFO L93 Difference]: Finished difference Result 689962 states and 903974 transitions. [2024-10-12 20:21:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:21:38,560 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 69 [2024-10-12 20:21:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:21:39,260 INFO L225 Difference]: With dead ends: 689962 [2024-10-12 20:21:39,260 INFO L226 Difference]: Without dead ends: 343077 [2024-10-12 20:21:39,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:21:39,504 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 69 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:21:39,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 94 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:21:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343077 states. [2024-10-12 20:21:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343077 to 341369. [2024-10-12 20:21:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341369 states, 341368 states have (on average 1.2962638560146236) internal successors, (442503), 341368 states have internal predecessors, (442503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:21:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341369 states to 341369 states and 442503 transitions. [2024-10-12 20:21:45,433 INFO L78 Accepts]: Start accepts. Automaton has 341369 states and 442503 transitions. Word has length 69 [2024-10-12 20:21:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:21:45,434 INFO L471 AbstractCegarLoop]: Abstraction has 341369 states and 442503 transitions. [2024-10-12 20:21:45,434 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-12 20:21:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 341369 states and 442503 transitions. [2024-10-12 20:21:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:21:45,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:21:45,440 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:21:45,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:21:45,440 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:21:45,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:21:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash 962524779, now seen corresponding path program 1 times [2024-10-12 20:21:45,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:21:45,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676514815] [2024-10-12 20:21:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:21:45,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:21:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:21:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:21:45,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:21:45,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676514815] [2024-10-12 20:21:45,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676514815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:21:45,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:21:45,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:21:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992665953] [2024-10-12 20:21:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:21:45,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:21:45,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:21:45,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:21:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:21:45,502 INFO L87 Difference]: Start difference. First operand 341369 states and 442503 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-12 20:21:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:21:46,611 INFO L93 Difference]: Finished difference Result 406177 states and 525830 transitions. [2024-10-12 20:21:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:21:46,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-12 20:21:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted.