./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.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 160554c42c564a52ebd5fe8cd6d07ff66d908df6432eaaa8c30073c4760a7967 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:40:15,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:40:15,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:40:15,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:40:15,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:40:15,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:40:15,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:40:15,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:40:15,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:40:15,211 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:40:15,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:40:15,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:40:15,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:40:15,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:40:15,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:40:15,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:40:15,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:40:15,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:40:15,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:40:15,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:40:15,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:40:15,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:40:15,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:40:15,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:40:15,218 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:40:15,218 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:40:15,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:40:15,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:40:15,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:40:15,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:40:15,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:40:15,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:40:15,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:40:15,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:40:15,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:40:15,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:40:15,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:40:15,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:40:15,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:40:15,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:40:15,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:40:15,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:40:15,225 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 -> 160554c42c564a52ebd5fe8cd6d07ff66d908df6432eaaa8c30073c4760a7967 [2024-11-11 21:40:15,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:40:15,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:40:15,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:40:15,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:40:15,536 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:40:15,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-11-11 21:40:16,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:40:17,093 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:40:17,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-11-11 21:40:17,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df3b6ff7/d33a0c491f7240bcb1e5eeeee7058910/FLAGaddb29d36 [2024-11-11 21:40:17,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df3b6ff7/d33a0c491f7240bcb1e5eeeee7058910 [2024-11-11 21:40:17,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:40:17,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:40:17,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:40:17,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:40:17,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:40:17,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e3a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17, skipping insertion in model container [2024-11-11 21:40:17,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:40:17,424 WARN L250 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.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4902,4915] [2024-11-11 21:40:17,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:40:17,477 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:40:17,506 WARN L250 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.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4902,4915] [2024-11-11 21:40:17,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:40:17,545 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:40:17,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17 WrapperNode [2024-11-11 21:40:17,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:40:17,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:40:17,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:40:17,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:40:17,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,600 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 375 [2024-11-11 21:40:17,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:40:17,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:40:17,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:40:17,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:40:17,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,644 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-11-11 21:40:17,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:40:17,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:40:17,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:40:17,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:40:17,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (1/1) ... [2024-11-11 21:40:17,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:40:17,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:40:17,711 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-11-11 21:40:17,716 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-11-11 21:40:17,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:40:17,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:40:17,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:40:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:40:17,873 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:40:17,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:40:18,292 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-11 21:40:18,292 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:40:18,310 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:40:18,310 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:40:18,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:40:18 BoogieIcfgContainer [2024-11-11 21:40:18,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:40:18,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:40:18,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:40:18,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:40:18,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:40:17" (1/3) ... [2024-11-11 21:40:18,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e00fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:40:18, skipping insertion in model container [2024-11-11 21:40:18,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:40:17" (2/3) ... [2024-11-11 21:40:18,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e00fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:40:18, skipping insertion in model container [2024-11-11 21:40:18,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:40:18" (3/3) ... [2024-11-11 21:40:18,317 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-11-11 21:40:18,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:40:18,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:40:18,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:40:18,389 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;@4137e3bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:40:18,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:40:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 21:40:18,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:18,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:18,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:18,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash -347547403, now seen corresponding path program 1 times [2024-11-11 21:40:18,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:18,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735761279] [2024-11-11 21:40:18,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:18,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735761279] [2024-11-11 21:40:18,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735761279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:18,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:18,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:18,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859584540] [2024-11-11 21:40:18,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:18,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:18,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:18,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:18,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:18,870 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 0 states have call successors, (0), 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 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:18,917 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2024-11-11 21:40:18,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:18,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-11 21:40:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:18,928 INFO L225 Difference]: With dead ends: 177 [2024-11-11 21:40:18,929 INFO L226 Difference]: Without dead ends: 118 [2024-11-11 21:40:18,932 INFO L434 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-11-11 21:40:18,937 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 91 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:18,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-11 21:40:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-11-11 21:40:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2024-11-11 21:40:18,980 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 47 [2024-11-11 21:40:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:18,981 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2024-11-11 21:40:18,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2024-11-11 21:40:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 21:40:18,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:18,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:18,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:40:18,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:18,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -391185874, now seen corresponding path program 1 times [2024-11-11 21:40:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:18,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473609916] [2024-11-11 21:40:18,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:18,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473609916] [2024-11-11 21:40:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473609916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:19,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847744826] [2024-11-11 21:40:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:19,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:19,120 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:19,156 INFO L93 Difference]: Finished difference Result 280 states and 429 transitions. [2024-11-11 21:40:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:19,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-11 21:40:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:19,160 INFO L225 Difference]: With dead ends: 280 [2024-11-11 21:40:19,160 INFO L226 Difference]: Without dead ends: 190 [2024-11-11 21:40:19,161 INFO L434 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-11-11 21:40:19,162 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:19,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-11 21:40:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-11-11 21:40:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2024-11-11 21:40:19,178 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 48 [2024-11-11 21:40:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:19,179 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2024-11-11 21:40:19,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2024-11-11 21:40:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-11 21:40:19,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:19,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:19,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:40:19,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:19,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:19,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2047730124, now seen corresponding path program 1 times [2024-11-11 21:40:19,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:19,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948466831] [2024-11-11 21:40:19,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:19,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:19,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948466831] [2024-11-11 21:40:19,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948466831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:19,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:19,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202551212] [2024-11-11 21:40:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:19,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:19,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:19,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:19,354 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:19,382 INFO L93 Difference]: Finished difference Result 480 states and 745 transitions. [2024-11-11 21:40:19,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:19,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-11 21:40:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:19,385 INFO L225 Difference]: With dead ends: 480 [2024-11-11 21:40:19,385 INFO L226 Difference]: Without dead ends: 318 [2024-11-11 21:40:19,386 INFO L434 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-11-11 21:40:19,387 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:19,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-11 21:40:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2024-11-11 21:40:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 483 transitions. [2024-11-11 21:40:19,417 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 483 transitions. Word has length 49 [2024-11-11 21:40:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:19,417 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 483 transitions. [2024-11-11 21:40:19,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 483 transitions. [2024-11-11 21:40:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 21:40:19,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:19,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:19,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:40:19,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:19,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash -415311335, now seen corresponding path program 1 times [2024-11-11 21:40:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:19,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881864464] [2024-11-11 21:40:19,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:19,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881864464] [2024-11-11 21:40:19,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881864464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:19,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:19,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408488445] [2024-11-11 21:40:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:19,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:19,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:19,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:19,534 INFO L87 Difference]: Start difference. First operand 316 states and 483 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:19,558 INFO L93 Difference]: Finished difference Result 832 states and 1293 transitions. [2024-11-11 21:40:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-11 21:40:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:19,562 INFO L225 Difference]: With dead ends: 832 [2024-11-11 21:40:19,562 INFO L226 Difference]: Without dead ends: 542 [2024-11-11 21:40:19,564 INFO L434 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-11-11 21:40:19,567 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 54 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:19,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-11 21:40:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2024-11-11 21:40:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 827 transitions. [2024-11-11 21:40:19,599 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 827 transitions. Word has length 50 [2024-11-11 21:40:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:19,599 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 827 transitions. [2024-11-11 21:40:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 827 transitions. [2024-11-11 21:40:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 21:40:19,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:19,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:19,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:40:19,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:19,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash -103942672, now seen corresponding path program 1 times [2024-11-11 21:40:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:19,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917758895] [2024-11-11 21:40:19,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:19,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:19,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917758895] [2024-11-11 21:40:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917758895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:19,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:19,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:19,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210600897] [2024-11-11 21:40:19,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:19,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:19,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:19,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:19,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:19,775 INFO L87 Difference]: Start difference. First operand 540 states and 827 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:19,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:19,969 INFO L93 Difference]: Finished difference Result 4652 states and 7235 transitions. [2024-11-11 21:40:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:40:19,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-11-11 21:40:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:19,986 INFO L225 Difference]: With dead ends: 4652 [2024-11-11 21:40:19,987 INFO L226 Difference]: Without dead ends: 4138 [2024-11-11 21:40:19,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:40:19,990 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 784 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:19,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 993 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2024-11-11 21:40:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 1052. [2024-11-11 21:40:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1595 transitions. [2024-11-11 21:40:20,055 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1595 transitions. Word has length 51 [2024-11-11 21:40:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:20,057 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1595 transitions. [2024-11-11 21:40:20,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1595 transitions. [2024-11-11 21:40:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:40:20,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:20,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:20,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:40:20,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:20,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2026482100, now seen corresponding path program 1 times [2024-11-11 21:40:20,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:20,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052178137] [2024-11-11 21:40:20,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:20,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:20,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:20,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052178137] [2024-11-11 21:40:20,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052178137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:20,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:20,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:20,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922407724] [2024-11-11 21:40:20,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:20,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:20,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:20,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:20,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:20,182 INFO L87 Difference]: Start difference. First operand 1052 states and 1595 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:20,212 INFO L93 Difference]: Finished difference Result 2570 states and 3911 transitions. [2024-11-11 21:40:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:20,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-11 21:40:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:20,219 INFO L225 Difference]: With dead ends: 2570 [2024-11-11 21:40:20,220 INFO L226 Difference]: Without dead ends: 1544 [2024-11-11 21:40:20,222 INFO L434 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-11-11 21:40:20,222 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 201 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-11-11 21:40:20,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 201 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-11 21:40:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2024-11-11 21:40:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2317 transitions. [2024-11-11 21:40:20,264 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2317 transitions. Word has length 53 [2024-11-11 21:40:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:20,264 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2317 transitions. [2024-11-11 21:40:20,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2317 transitions. [2024-11-11 21:40:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:40:20,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:20,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:20,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:40:20,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:20,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:20,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2005479445, now seen corresponding path program 1 times [2024-11-11 21:40:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:20,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931100574] [2024-11-11 21:40:20,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931100574] [2024-11-11 21:40:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931100574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146043342] [2024-11-11 21:40:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:20,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:20,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:20,568 INFO L87 Difference]: Start difference. First operand 1542 states and 2317 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:20,685 INFO L93 Difference]: Finished difference Result 3058 states and 4607 transitions. [2024-11-11 21:40:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:20,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-11 21:40:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:20,690 INFO L225 Difference]: With dead ends: 3058 [2024-11-11 21:40:20,691 INFO L226 Difference]: Without dead ends: 1544 [2024-11-11 21:40:20,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:40:20,693 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 208 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:20,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 324 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-11 21:40:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2024-11-11 21:40:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2293 transitions. [2024-11-11 21:40:20,737 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2293 transitions. Word has length 53 [2024-11-11 21:40:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:20,738 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2293 transitions. [2024-11-11 21:40:20,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2293 transitions. [2024-11-11 21:40:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:40:20,739 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:20,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:20,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:40:20,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:20,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2042230043, now seen corresponding path program 1 times [2024-11-11 21:40:20,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:20,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16648782] [2024-11-11 21:40:20,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:20,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16648782] [2024-11-11 21:40:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16648782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:20,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:40:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764292757] [2024-11-11 21:40:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:20,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:40:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:20,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:40:20,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:40:20,839 INFO L87 Difference]: Start difference. First operand 1542 states and 2293 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:20,978 INFO L93 Difference]: Finished difference Result 4082 states and 6111 transitions. [2024-11-11 21:40:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:40:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-11 21:40:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:20,986 INFO L225 Difference]: With dead ends: 4082 [2024-11-11 21:40:20,987 INFO L226 Difference]: Without dead ends: 2568 [2024-11-11 21:40:20,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:40:20,992 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 432 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:20,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 109 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2024-11-11 21:40:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2566. [2024-11-11 21:40:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.4865497076023393) internal successors, (3813), 2565 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3813 transitions. [2024-11-11 21:40:21,036 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3813 transitions. Word has length 54 [2024-11-11 21:40:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:21,037 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3813 transitions. [2024-11-11 21:40:21,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3813 transitions. [2024-11-11 21:40:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:40:21,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:21,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:21,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:40:21,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:21,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1489873546, now seen corresponding path program 1 times [2024-11-11 21:40:21,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:21,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875110211] [2024-11-11 21:40:21,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:21,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:21,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875110211] [2024-11-11 21:40:21,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875110211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:21,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:21,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:40:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852840862] [2024-11-11 21:40:21,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:21,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:40:21,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:21,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:40:21,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:40:21,145 INFO L87 Difference]: Start difference. First operand 2566 states and 3813 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:21,228 INFO L93 Difference]: Finished difference Result 5104 states and 7598 transitions. [2024-11-11 21:40:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:40:21,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-11 21:40:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:21,238 INFO L225 Difference]: With dead ends: 5104 [2024-11-11 21:40:21,239 INFO L226 Difference]: Without dead ends: 2566 [2024-11-11 21:40:21,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:40:21,242 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 262 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:21,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 75 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2024-11-11 21:40:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2566. [2024-11-11 21:40:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.470955165692008) internal successors, (3773), 2565 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3773 transitions. [2024-11-11 21:40:21,290 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3773 transitions. Word has length 54 [2024-11-11 21:40:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:21,290 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3773 transitions. [2024-11-11 21:40:21,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3773 transitions. [2024-11-11 21:40:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:40:21,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:21,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:21,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:40:21,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:21,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1617958853, now seen corresponding path program 1 times [2024-11-11 21:40:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:21,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239648290] [2024-11-11 21:40:21,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:21,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239648290] [2024-11-11 21:40:21,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239648290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:21,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:21,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:40:21,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771853195] [2024-11-11 21:40:21,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:21,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:40:21,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:21,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:40:21,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:40:21,427 INFO L87 Difference]: Start difference. First operand 2566 states and 3773 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:21,514 INFO L93 Difference]: Finished difference Result 5104 states and 7518 transitions. [2024-11-11 21:40:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:40:21,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-11 21:40:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:21,522 INFO L225 Difference]: With dead ends: 5104 [2024-11-11 21:40:21,522 INFO L226 Difference]: Without dead ends: 2566 [2024-11-11 21:40:21,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:40:21,525 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 246 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:21,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 83 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2024-11-11 21:40:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2566. [2024-11-11 21:40:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.4553606237816765) internal successors, (3733), 2565 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3733 transitions. [2024-11-11 21:40:21,566 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3733 transitions. Word has length 54 [2024-11-11 21:40:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:21,567 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3733 transitions. [2024-11-11 21:40:21,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3733 transitions. [2024-11-11 21:40:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:40:21,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:21,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:21,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:40:21,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:21,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1811476054, now seen corresponding path program 1 times [2024-11-11 21:40:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812594951] [2024-11-11 21:40:21,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:21,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:21,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:21,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812594951] [2024-11-11 21:40:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812594951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:21,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:21,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:40:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074690986] [2024-11-11 21:40:21,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:21,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:40:21,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:21,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:40:21,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:40:21,770 INFO L87 Difference]: Start difference. First operand 2566 states and 3733 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:21,797 INFO L93 Difference]: Finished difference Result 2696 states and 3926 transitions. [2024-11-11 21:40:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:40:21,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-11 21:40:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:21,805 INFO L225 Difference]: With dead ends: 2696 [2024-11-11 21:40:21,805 INFO L226 Difference]: Without dead ends: 2694 [2024-11-11 21:40:21,806 INFO L434 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-11-11 21:40:21,806 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 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-11-11 21:40:21,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2024-11-11 21:40:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2694. [2024-11-11 21:40:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2693 states have (on average 1.4307463795024136) internal successors, (3853), 2693 states have internal predecessors, (3853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 3853 transitions. [2024-11-11 21:40:21,848 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 3853 transitions. Word has length 54 [2024-11-11 21:40:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:21,849 INFO L471 AbstractCegarLoop]: Abstraction has 2694 states and 3853 transitions. [2024-11-11 21:40:21,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 3853 transitions. [2024-11-11 21:40:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:40:21,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:21,852 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:21,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:40:21,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:21,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:21,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1690284398, now seen corresponding path program 1 times [2024-11-11 21:40:21,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:21,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822715102] [2024-11-11 21:40:21,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:40:22,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:22,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822715102] [2024-11-11 21:40:22,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822715102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:22,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:22,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054510354] [2024-11-11 21:40:22,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:22,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:22,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:22,011 INFO L87 Difference]: Start difference. First operand 2694 states and 3853 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:22,127 INFO L93 Difference]: Finished difference Result 13720 states and 19666 transitions. [2024-11-11 21:40:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:22,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 76 [2024-11-11 21:40:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:22,162 INFO L225 Difference]: With dead ends: 13720 [2024-11-11 21:40:22,162 INFO L226 Difference]: Without dead ends: 11542 [2024-11-11 21:40:22,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:22,170 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 478 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:22,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 524 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11542 states. [2024-11-11 21:40:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11542 to 5118. [2024-11-11 21:40:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5118 states, 5117 states have (on average 1.426812585499316) internal successors, (7301), 5117 states have internal predecessors, (7301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 7301 transitions. [2024-11-11 21:40:22,292 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 7301 transitions. Word has length 76 [2024-11-11 21:40:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:22,293 INFO L471 AbstractCegarLoop]: Abstraction has 5118 states and 7301 transitions. [2024-11-11 21:40:22,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 7301 transitions. [2024-11-11 21:40:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:40:22,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:22,295 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:22,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:40:22,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:22,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash -34257664, now seen corresponding path program 1 times [2024-11-11 21:40:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:22,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000729455] [2024-11-11 21:40:22,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:22,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:40:22,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:22,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000729455] [2024-11-11 21:40:22,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000729455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:22,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:22,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348844577] [2024-11-11 21:40:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:22,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:22,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:22,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:22,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:22,473 INFO L87 Difference]: Start difference. First operand 5118 states and 7301 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:22,612 INFO L93 Difference]: Finished difference Result 16384 states and 23458 transitions. [2024-11-11 21:40:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-11 21:40:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:22,642 INFO L225 Difference]: With dead ends: 16384 [2024-11-11 21:40:22,642 INFO L226 Difference]: Without dead ends: 13718 [2024-11-11 21:40:22,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:22,653 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 492 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:22,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 588 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13718 states. [2024-11-11 21:40:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13718 to 8870. [2024-11-11 21:40:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8870 states, 8869 states have (on average 1.4221445484271056) internal successors, (12613), 8869 states have internal predecessors, (12613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8870 states to 8870 states and 12613 transitions. [2024-11-11 21:40:22,827 INFO L78 Accepts]: Start accepts. Automaton has 8870 states and 12613 transitions. Word has length 76 [2024-11-11 21:40:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:22,827 INFO L471 AbstractCegarLoop]: Abstraction has 8870 states and 12613 transitions. [2024-11-11 21:40:22,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 8870 states and 12613 transitions. [2024-11-11 21:40:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:40:22,829 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:22,830 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:22,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:40:22,830 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:22,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1119688442, now seen corresponding path program 1 times [2024-11-11 21:40:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518621515] [2024-11-11 21:40:22,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:40:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:22,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518621515] [2024-11-11 21:40:22,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518621515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:22,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615781451] [2024-11-11 21:40:22,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:22,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:22,983 INFO L87 Difference]: Start difference. First operand 8870 states and 12613 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:23,142 INFO L93 Difference]: Finished difference Result 19048 states and 27242 transitions. [2024-11-11 21:40:23,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:23,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 76 [2024-11-11 21:40:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:23,174 INFO L225 Difference]: With dead ends: 19048 [2024-11-11 21:40:23,175 INFO L226 Difference]: Without dead ends: 16382 [2024-11-11 21:40:23,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:23,185 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 442 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:23,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 631 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16382 states. [2024-11-11 21:40:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16382 to 11534. [2024-11-11 21:40:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11534 states, 11533 states have (on average 1.4217462932454694) internal successors, (16397), 11533 states have internal predecessors, (16397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11534 states to 11534 states and 16397 transitions. [2024-11-11 21:40:23,408 INFO L78 Accepts]: Start accepts. Automaton has 11534 states and 16397 transitions. Word has length 76 [2024-11-11 21:40:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:23,408 INFO L471 AbstractCegarLoop]: Abstraction has 11534 states and 16397 transitions. [2024-11-11 21:40:23,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 11534 states and 16397 transitions. [2024-11-11 21:40:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:40:23,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:23,411 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:23,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:40:23,411 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:23,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash 261787764, now seen corresponding path program 1 times [2024-11-11 21:40:23,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767559499] [2024-11-11 21:40:23,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:40:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767559499] [2024-11-11 21:40:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767559499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:23,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:23,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:40:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184600932] [2024-11-11 21:40:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:23,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:40:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:40:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:40:23,580 INFO L87 Difference]: Start difference. First operand 11534 states and 16397 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:23,705 INFO L93 Difference]: Finished difference Result 21712 states and 31026 transitions. [2024-11-11 21:40:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:40:23,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-11 21:40:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:23,737 INFO L225 Difference]: With dead ends: 21712 [2024-11-11 21:40:23,738 INFO L226 Difference]: Without dead ends: 19046 [2024-11-11 21:40:23,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:40:23,748 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 480 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:23,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 615 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:40:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19046 states. [2024-11-11 21:40:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19046 to 14198. [2024-11-11 21:40:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14198 states, 14197 states have (on average 1.4214974994717193) internal successors, (20181), 14197 states have internal predecessors, (20181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14198 states to 14198 states and 20181 transitions. [2024-11-11 21:40:23,959 INFO L78 Accepts]: Start accepts. Automaton has 14198 states and 20181 transitions. Word has length 76 [2024-11-11 21:40:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:23,960 INFO L471 AbstractCegarLoop]: Abstraction has 14198 states and 20181 transitions. [2024-11-11 21:40:23,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 14198 states and 20181 transitions. [2024-11-11 21:40:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:40:23,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:23,962 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:23,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:40:23,963 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:23,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1414120063, now seen corresponding path program 1 times [2024-11-11 21:40:23,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:23,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977170280] [2024-11-11 21:40:23,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:40:24,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:24,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977170280] [2024-11-11 21:40:24,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977170280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:40:24,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548568611] [2024-11-11 21:40:24,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:24,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:40:24,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:40:24,208 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-11-11 21:40:24,210 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-11-11 21:40:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:24,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 21:40:24,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:40:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:24,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:40:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:25,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548568611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:40:25,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:40:25,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 20 [2024-11-11 21:40:25,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361827464] [2024-11-11 21:40:25,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:40:25,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 21:40:25,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:25,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 21:40:25,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:40:25,752 INFO L87 Difference]: Start difference. First operand 14198 states and 20181 transitions. Second operand has 20 states, 20 states have (on average 10.6) internal successors, (212), 20 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:28,057 INFO L93 Difference]: Finished difference Result 89148 states and 126670 transitions. [2024-11-11 21:40:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-11 21:40:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.6) internal successors, (212), 20 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-11 21:40:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:28,190 INFO L225 Difference]: With dead ends: 89148 [2024-11-11 21:40:28,190 INFO L226 Difference]: Without dead ends: 74978 [2024-11-11 21:40:28,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1035, Invalid=3935, Unknown=0, NotChecked=0, Total=4970 [2024-11-11 21:40:28,222 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 2549 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2549 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:28,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2549 Valid, 1048 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 21:40:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74978 states. [2024-11-11 21:40:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74978 to 56760. [2024-11-11 21:40:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56760 states, 56759 states have (on average 1.3923959195898448) internal successors, (79031), 56759 states have internal predecessors, (79031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56760 states to 56760 states and 79031 transitions. [2024-11-11 21:40:29,614 INFO L78 Accepts]: Start accepts. Automaton has 56760 states and 79031 transitions. Word has length 77 [2024-11-11 21:40:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:29,615 INFO L471 AbstractCegarLoop]: Abstraction has 56760 states and 79031 transitions. [2024-11-11 21:40:29,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.6) internal successors, (212), 20 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 56760 states and 79031 transitions. [2024-11-11 21:40:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:40:29,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:29,620 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:29,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:40:29,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 21:40:29,821 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:29,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -968717224, now seen corresponding path program 1 times [2024-11-11 21:40:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419728597] [2024-11-11 21:40:29,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:30,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:30,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419728597] [2024-11-11 21:40:30,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419728597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:40:30,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576358837] [2024-11-11 21:40:30,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:30,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:40:30,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:40:30,300 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-11-11 21:40:30,302 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-11-11 21:40:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:30,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 21:40:30,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:40:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:30,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:40:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576358837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:40:31,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:40:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-11 21:40:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104703623] [2024-11-11 21:40:31,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:40:31,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:40:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:40:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:40:31,431 INFO L87 Difference]: Start difference. First operand 56760 states and 79031 transitions. Second operand has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 20 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:32,869 INFO L93 Difference]: Finished difference Result 213026 states and 296751 transitions. [2024-11-11 21:40:32,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 21:40:32,870 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 20 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:40:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:33,139 INFO L225 Difference]: With dead ends: 213026 [2024-11-11 21:40:33,140 INFO L226 Difference]: Without dead ends: 156294 [2024-11-11 21:40:33,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 21:40:33,192 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1720 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:33,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 761 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:40:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156294 states. [2024-11-11 21:40:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156294 to 97742. [2024-11-11 21:40:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97742 states, 97741 states have (on average 1.381027409173223) internal successors, (134983), 97741 states have internal predecessors, (134983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97742 states to 97742 states and 134983 transitions. [2024-11-11 21:40:35,025 INFO L78 Accepts]: Start accepts. Automaton has 97742 states and 134983 transitions. Word has length 78 [2024-11-11 21:40:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:35,026 INFO L471 AbstractCegarLoop]: Abstraction has 97742 states and 134983 transitions. [2024-11-11 21:40:35,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 20 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 97742 states and 134983 transitions. [2024-11-11 21:40:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:40:35,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:35,033 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:35,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:40:35,234 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,SelfDestructingSolverStorable16 [2024-11-11 21:40:35,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:35,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash 635552222, now seen corresponding path program 1 times [2024-11-11 21:40:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:35,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815039774] [2024-11-11 21:40:35,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:35,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:35,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815039774] [2024-11-11 21:40:35,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815039774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:40:35,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139586564] [2024-11-11 21:40:35,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:35,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:40:35,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:40:35,799 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-11-11 21:40:35,801 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-11-11 21:40:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:35,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 21:40:35,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:40:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:36,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:40:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139586564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:40:37,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:40:37,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-11 21:40:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725458278] [2024-11-11 21:40:37,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:40:37,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:40:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:40:37,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:40:37,099 INFO L87 Difference]: Start difference. First operand 97742 states and 134983 transitions. Second operand has 21 states, 21 states have (on average 8.476190476190476) internal successors, (178), 20 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:39,111 INFO L93 Difference]: Finished difference Result 440122 states and 605025 transitions. [2024-11-11 21:40:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 21:40:39,112 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.476190476190476) internal successors, (178), 20 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:40:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:39,594 INFO L225 Difference]: With dead ends: 440122 [2024-11-11 21:40:39,594 INFO L226 Difference]: Without dead ends: 342408 [2024-11-11 21:40:39,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=1015, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 21:40:39,702 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 860 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:39,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 843 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:40:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342408 states. [2024-11-11 21:40:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342408 to 204730. [2024-11-11 21:40:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204730 states, 204729 states have (on average 1.3701722765216457) internal successors, (280514), 204729 states have internal predecessors, (280514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204730 states to 204730 states and 280514 transitions. [2024-11-11 21:40:43,981 INFO L78 Accepts]: Start accepts. Automaton has 204730 states and 280514 transitions. Word has length 78 [2024-11-11 21:40:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:43,981 INFO L471 AbstractCegarLoop]: Abstraction has 204730 states and 280514 transitions. [2024-11-11 21:40:43,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.476190476190476) internal successors, (178), 20 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 204730 states and 280514 transitions. [2024-11-11 21:40:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:40:43,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:43,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:44,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 21:40:44,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 21:40:44,189 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:44,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1417022205, now seen corresponding path program 1 times [2024-11-11 21:40:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:44,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536671601] [2024-11-11 21:40:44,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:44,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:44,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536671601] [2024-11-11 21:40:44,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536671601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:40:44,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:40:44,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:40:44,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281439249] [2024-11-11 21:40:44,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:40:44,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:40:44,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:44,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:40:44,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:40:44,281 INFO L87 Difference]: Start difference. First operand 204730 states and 280514 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:40:45,907 INFO L93 Difference]: Finished difference Result 402914 states and 552525 transitions. [2024-11-11 21:40:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:40:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 21:40:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:40:46,195 INFO L225 Difference]: With dead ends: 402914 [2024-11-11 21:40:46,195 INFO L226 Difference]: Without dead ends: 198212 [2024-11-11 21:40:46,286 INFO L434 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-11-11 21:40:46,287 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 46 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:40:46,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 225 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:40:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198212 states. [2024-11-11 21:40:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198212 to 194490. [2024-11-11 21:40:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194490 states, 194489 states have (on average 1.3501946125487816) internal successors, (262598), 194489 states have internal predecessors, (262598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194490 states to 194490 states and 262598 transitions. [2024-11-11 21:40:49,098 INFO L78 Accepts]: Start accepts. Automaton has 194490 states and 262598 transitions. Word has length 79 [2024-11-11 21:40:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:40:49,099 INFO L471 AbstractCegarLoop]: Abstraction has 194490 states and 262598 transitions. [2024-11-11 21:40:49,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:40:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 194490 states and 262598 transitions. [2024-11-11 21:40:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:40:49,103 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:40:49,103 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:40:49,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:40:49,103 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:40:49,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:40:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1571427843, now seen corresponding path program 1 times [2024-11-11 21:40:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:40:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533383723] [2024-11-11 21:40:49,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:40:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:50,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:40:50,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533383723] [2024-11-11 21:40:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533383723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:40:50,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241555734] [2024-11-11 21:40:50,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:40:50,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:40:50,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:40:50,538 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-11-11 21:40:50,539 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-11-11 21:40:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:40:50,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-11 21:40:50,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:40:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:56,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:40:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:40:57,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241555734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:40:57,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:40:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 17] total 43 [2024-11-11 21:40:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125413160] [2024-11-11 21:40:57,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:40:57,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-11 21:40:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:40:57,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-11 21:40:57,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1630, Unknown=0, NotChecked=0, Total=1806 [2024-11-11 21:40:57,865 INFO L87 Difference]: Start difference. First operand 194490 states and 262598 transitions. Second operand has 43 states, 43 states have (on average 5.116279069767442) internal successors, (220), 43 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)