./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.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 16d5feefc85136540ef4669433de80b700c3a57c51c2b65f22ef098d8e79a29f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:42:02,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:42:02,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:42:02,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:42:02,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:42:02,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:42:02,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:42:02,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:42:02,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:42:02,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:42:02,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:42:02,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:42:02,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:42:02,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:42:02,516 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:42:02,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:42:02,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:42:02,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:42:02,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:42:02,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:42:02,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:42:02,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:42:02,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:42:02,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:42:02,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:42:02,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:42:02,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:42:02,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:42:02,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:42:02,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:42:02,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:42:02,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:42:02,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:42:02,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:42:02,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:42:02,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:42:02,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:42:02,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:42:02,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:42:02,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:42:02,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:42:02,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:42:02,522 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 -> 16d5feefc85136540ef4669433de80b700c3a57c51c2b65f22ef098d8e79a29f [2024-10-24 01:42:02,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:42:02,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:42:02,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:42:02,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:42:02,745 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:42:02,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:42:03,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:42:04,151 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:42:04,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:42:04,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285963823/c5474cbd7cc54ccbb5185fd9636b5347/FLAGcbf84eeb0 [2024-10-24 01:42:04,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285963823/c5474cbd7cc54ccbb5185fd9636b5347 [2024-10-24 01:42:04,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:42:04,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:42:04,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:42:04,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:42:04,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:42:04,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7948b590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04, skipping insertion in model container [2024-10-24 01:42:04,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:42:04,751 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2024-10-24 01:42:04,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:42:04,802 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:42:04,836 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2024-10-24 01:42:04,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:42:04,880 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:42:04,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04 WrapperNode [2024-10-24 01:42:04,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:42:04,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:42:04,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:42:04,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:42:04,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,925 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 466 [2024-10-24 01:42:04,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:42:04,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:42:04,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:42:04,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:42:04,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,949 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 01:42:04,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:42:04,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:42:04,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:42:04,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:42:04,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (1/1) ... [2024-10-24 01:42:04,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:42:04,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:42:05,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:42:05,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:42:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:42:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:42:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:42:05,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:42:05,159 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:42:05,161 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:42:05,547 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-24 01:42:05,548 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:42:05,605 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:42:05,608 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:42:05,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:42:05 BoogieIcfgContainer [2024-10-24 01:42:05,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:42:05,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:42:05,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:42:05,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:42:05,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:42:04" (1/3) ... [2024-10-24 01:42:05,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c734b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:42:05, skipping insertion in model container [2024-10-24 01:42:05,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:42:04" (2/3) ... [2024-10-24 01:42:05,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c734b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:42:05, skipping insertion in model container [2024-10-24 01:42:05,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:42:05" (3/3) ... [2024-10-24 01:42:05,618 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:42:05,630 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:42:05,630 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:42:05,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:42:05,679 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;@1d4ba4fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:42:05,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:42:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 109 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 01:42:05,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:05,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:05,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:05,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:05,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1500294558, now seen corresponding path program 1 times [2024-10-24 01:42:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848385234] [2024-10-24 01:42:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:06,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:06,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848385234] [2024-10-24 01:42:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848385234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:06,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:06,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:42:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169117025] [2024-10-24 01:42:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:06,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:42:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:06,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:42:06,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:06,034 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 109 states have internal predecessors, (183), 0 states have call successors, (0), 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 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-10-24 01:42:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:06,079 INFO L93 Difference]: Finished difference Result 262 states and 421 transitions. [2024-10-24 01:42:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:42:06,084 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-10-24 01:42:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:06,094 INFO L225 Difference]: With dead ends: 262 [2024-10-24 01:42:06,094 INFO L226 Difference]: Without dead ends: 174 [2024-10-24 01:42:06,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:06,101 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 129 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:06,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 376 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-24 01:42:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2024-10-24 01:42:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.5087719298245614) internal successors, (258), 171 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 258 transitions. [2024-10-24 01:42:06,132 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 258 transitions. Word has length 48 [2024-10-24 01:42:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:06,133 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 258 transitions. [2024-10-24 01:42:06,133 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-10-24 01:42:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 258 transitions. [2024-10-24 01:42:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:42:06,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:06,135 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:06,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:42:06,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:06,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1904231256, now seen corresponding path program 1 times [2024-10-24 01:42:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:06,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659602891] [2024-10-24 01:42:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:06,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:06,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:06,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659602891] [2024-10-24 01:42:06,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659602891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:06,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:06,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:42:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521637367] [2024-10-24 01:42:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:06,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:42:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:06,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:42:06,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:06,266 INFO L87 Difference]: Start difference. First operand 172 states and 258 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-10-24 01:42:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:06,297 INFO L93 Difference]: Finished difference Result 432 states and 670 transitions. [2024-10-24 01:42:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:42:06,299 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-10-24 01:42:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:06,300 INFO L225 Difference]: With dead ends: 432 [2024-10-24 01:42:06,301 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 01:42:06,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:06,302 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 108 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:06,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 327 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 01:42:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2024-10-24 01:42:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.5371024734982333) internal successors, (435), 283 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 435 transitions. [2024-10-24 01:42:06,330 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 435 transitions. Word has length 49 [2024-10-24 01:42:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:06,331 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 435 transitions. [2024-10-24 01:42:06,331 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-10-24 01:42:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 435 transitions. [2024-10-24 01:42:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 01:42:06,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:06,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:06,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:42:06,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:06,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:06,335 INFO L85 PathProgramCache]: Analyzing trace with hash -583215553, now seen corresponding path program 1 times [2024-10-24 01:42:06,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:06,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674847795] [2024-10-24 01:42:06,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:06,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:06,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:06,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674847795] [2024-10-24 01:42:06,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674847795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:42:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496909396] [2024-10-24 01:42:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:06,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:42:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:06,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:42:06,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:06,477 INFO L87 Difference]: Start difference. First operand 284 states and 435 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-10-24 01:42:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:06,508 INFO L93 Difference]: Finished difference Result 736 states and 1149 transitions. [2024-10-24 01:42:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:42:06,509 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-10-24 01:42:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:06,511 INFO L225 Difference]: With dead ends: 736 [2024-10-24 01:42:06,514 INFO L226 Difference]: Without dead ends: 478 [2024-10-24 01:42:06,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:06,516 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 103 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:06,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-24 01:42:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 476. [2024-10-24 01:42:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.5473684210526315) internal successors, (735), 475 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 735 transitions. [2024-10-24 01:42:06,540 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 735 transitions. Word has length 50 [2024-10-24 01:42:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:06,541 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 735 transitions. [2024-10-24 01:42:06,541 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-10-24 01:42:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 735 transitions. [2024-10-24 01:42:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 01:42:06,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:06,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:06,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:42:06,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:06,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1140177137, now seen corresponding path program 1 times [2024-10-24 01:42:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:06,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278100138] [2024-10-24 01:42:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:06,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:06,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278100138] [2024-10-24 01:42:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278100138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:06,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:06,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:42:06,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954101] [2024-10-24 01:42:06,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:06,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:42:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:42:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:42:06,682 INFO L87 Difference]: Start difference. First operand 476 states and 735 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-10-24 01:42:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:06,788 INFO L93 Difference]: Finished difference Result 2726 states and 4280 transitions. [2024-10-24 01:42:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:42:06,789 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-10-24 01:42:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:06,796 INFO L225 Difference]: With dead ends: 2726 [2024-10-24 01:42:06,796 INFO L226 Difference]: Without dead ends: 2276 [2024-10-24 01:42:06,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:42:06,799 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1016 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:06,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 1216 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2024-10-24 01:42:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 924. [2024-10-24 01:42:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.5460455037919827) internal successors, (1427), 923 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1427 transitions. [2024-10-24 01:42:06,822 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1427 transitions. Word has length 51 [2024-10-24 01:42:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:06,822 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1427 transitions. [2024-10-24 01:42:06,822 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-10-24 01:42:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1427 transitions. [2024-10-24 01:42:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 01:42:06,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:06,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:06,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:42:06,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:06,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:06,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1005209156, now seen corresponding path program 1 times [2024-10-24 01:42:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368796666] [2024-10-24 01:42:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368796666] [2024-10-24 01:42:06,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368796666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:06,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:42:06,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302107575] [2024-10-24 01:42:06,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:06,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:42:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:42:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:42:06,971 INFO L87 Difference]: Start difference. First operand 924 states and 1427 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:07,048 INFO L93 Difference]: Finished difference Result 4028 states and 6231 transitions. [2024-10-24 01:42:07,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:42:07,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-24 01:42:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:07,057 INFO L225 Difference]: With dead ends: 4028 [2024-10-24 01:42:07,057 INFO L226 Difference]: Without dead ends: 3130 [2024-10-24 01:42:07,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:42:07,061 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 425 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:07,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 741 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:42:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2024-10-24 01:42:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 3124. [2024-10-24 01:42:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.5405059237912264) internal successors, (4811), 3123 states have internal predecessors, (4811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4811 transitions. [2024-10-24 01:42:07,118 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4811 transitions. Word has length 52 [2024-10-24 01:42:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:07,118 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4811 transitions. [2024-10-24 01:42:07,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4811 transitions. [2024-10-24 01:42:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:42:07,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:07,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:07,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:42:07,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:07,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1230800526, now seen corresponding path program 1 times [2024-10-24 01:42:07,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:07,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160125137] [2024-10-24 01:42:07,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:07,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:07,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160125137] [2024-10-24 01:42:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160125137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:42:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643514658] [2024-10-24 01:42:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:07,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:42:07,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:07,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:42:07,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:07,186 INFO L87 Difference]: Start difference. First operand 3124 states and 4811 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-10-24 01:42:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:07,224 INFO L93 Difference]: Finished difference Result 8248 states and 12653 transitions. [2024-10-24 01:42:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:42:07,225 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-10-24 01:42:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:07,248 INFO L225 Difference]: With dead ends: 8248 [2024-10-24 01:42:07,248 INFO L226 Difference]: Without dead ends: 5150 [2024-10-24 01:42:07,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:07,256 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 115 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:07,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 367 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2024-10-24 01:42:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 5148. [2024-10-24 01:42:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5147 states have (on average 1.5160287546143385) internal successors, (7803), 5147 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 7803 transitions. [2024-10-24 01:42:07,353 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 7803 transitions. Word has length 53 [2024-10-24 01:42:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:07,353 INFO L471 AbstractCegarLoop]: Abstraction has 5148 states and 7803 transitions. [2024-10-24 01:42:07,353 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-10-24 01:42:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 7803 transitions. [2024-10-24 01:42:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 01:42:07,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:07,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:07,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:42:07,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:07,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1165128050, now seen corresponding path program 1 times [2024-10-24 01:42:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:07,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775072823] [2024-10-24 01:42:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:07,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:07,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775072823] [2024-10-24 01:42:07,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775072823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:07,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:07,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:42:07,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657722283] [2024-10-24 01:42:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:07,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:42:07,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:07,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:42:07,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:42:07,551 INFO L87 Difference]: Start difference. First operand 5148 states and 7803 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-10-24 01:42:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:07,587 INFO L93 Difference]: Finished difference Result 5406 states and 8188 transitions. [2024-10-24 01:42:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:42:07,587 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-10-24 01:42:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:07,602 INFO L225 Difference]: With dead ends: 5406 [2024-10-24 01:42:07,602 INFO L226 Difference]: Without dead ends: 5404 [2024-10-24 01:42:07,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:42:07,605 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:07,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2024-10-24 01:42:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 5404. [2024-10-24 01:42:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5404 states, 5403 states have (on average 1.4915787525448825) internal successors, (8059), 5403 states have internal predecessors, (8059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 8059 transitions. [2024-10-24 01:42:07,701 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 8059 transitions. Word has length 54 [2024-10-24 01:42:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:07,702 INFO L471 AbstractCegarLoop]: Abstraction has 5404 states and 8059 transitions. [2024-10-24 01:42:07,703 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-10-24 01:42:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 8059 transitions. [2024-10-24 01:42:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:42:07,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:07,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:07,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:42:07,704 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:07,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:07,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1748658131, now seen corresponding path program 1 times [2024-10-24 01:42:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:07,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655734201] [2024-10-24 01:42:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:07,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:07,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655734201] [2024-10-24 01:42:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655734201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:07,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:07,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:42:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757937017] [2024-10-24 01:42:07,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:07,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:42:07,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:07,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:42:07,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:07,783 INFO L87 Difference]: Start difference. First operand 5404 states and 8059 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:07,841 INFO L93 Difference]: Finished difference Result 13258 states and 19787 transitions. [2024-10-24 01:42:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:42:07,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-24 01:42:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:07,870 INFO L225 Difference]: With dead ends: 13258 [2024-10-24 01:42:07,870 INFO L226 Difference]: Without dead ends: 7880 [2024-10-24 01:42:07,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:07,883 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 92 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:07,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 279 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2024-10-24 01:42:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 7822. [2024-10-24 01:42:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7822 states, 7821 states have (on average 1.4812683800025572) internal successors, (11585), 7821 states have internal predecessors, (11585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7822 states to 7822 states and 11585 transitions. [2024-10-24 01:42:08,031 INFO L78 Accepts]: Start accepts. Automaton has 7822 states and 11585 transitions. Word has length 55 [2024-10-24 01:42:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:08,032 INFO L471 AbstractCegarLoop]: Abstraction has 7822 states and 11585 transitions. [2024-10-24 01:42:08,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 7822 states and 11585 transitions. [2024-10-24 01:42:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:42:08,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:08,037 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:08,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:42:08,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:08,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash -88776474, now seen corresponding path program 1 times [2024-10-24 01:42:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:08,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873382100] [2024-10-24 01:42:08,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873382100] [2024-10-24 01:42:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873382100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:42:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646478787] [2024-10-24 01:42:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:08,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:42:08,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:42:08,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:42:08,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:42:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:08,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 01:42:08,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:42:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:08,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:42:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:09,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646478787] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:42:09,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:42:09,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-10-24 01:42:09,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676354083] [2024-10-24 01:42:09,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:42:09,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 01:42:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:09,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 01:42:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:42:09,338 INFO L87 Difference]: Start difference. First operand 7822 states and 11585 transitions. Second operand has 20 states, 20 states have (on average 11.3) internal successors, (226), 20 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:16,778 INFO L93 Difference]: Finished difference Result 101625 states and 149995 transitions. [2024-10-24 01:42:16,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2024-10-24 01:42:16,779 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.3) internal successors, (226), 20 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:42:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:16,960 INFO L225 Difference]: With dead ends: 101625 [2024-10-24 01:42:16,960 INFO L226 Difference]: Without dead ends: 93831 [2024-10-24 01:42:16,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12177 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4534, Invalid=24536, Unknown=0, NotChecked=0, Total=29070 [2024-10-24 01:42:17,001 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 15914 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 3585 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15914 SdHoareTripleChecker+Valid, 3546 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 3585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:17,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15914 Valid, 3546 Invalid, 3786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 3585 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 01:42:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93831 states. [2024-10-24 01:42:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93831 to 66049. [2024-10-24 01:42:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66049 states, 66048 states have (on average 1.4464934593023255) internal successors, (95538), 66048 states have internal predecessors, (95538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66049 states to 66049 states and 95538 transitions. [2024-10-24 01:42:18,354 INFO L78 Accepts]: Start accepts. Automaton has 66049 states and 95538 transitions. Word has length 78 [2024-10-24 01:42:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:18,354 INFO L471 AbstractCegarLoop]: Abstraction has 66049 states and 95538 transitions. [2024-10-24 01:42:18,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.3) internal successors, (226), 20 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 66049 states and 95538 transitions. [2024-10-24 01:42:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:42:18,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:18,362 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:18,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:42:18,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:42:18,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:18,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2021495991, now seen corresponding path program 1 times [2024-10-24 01:42:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:18,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979574628] [2024-10-24 01:42:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:18,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979574628] [2024-10-24 01:42:18,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979574628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:18,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:18,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:42:18,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979890720] [2024-10-24 01:42:18,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:18,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:42:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:18,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:42:18,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:18,613 INFO L87 Difference]: Start difference. First operand 66049 states and 95538 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-10-24 01:42:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:19,031 INFO L93 Difference]: Finished difference Result 156905 states and 226449 transitions. [2024-10-24 01:42:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:42:19,031 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-10-24 01:42:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:19,191 INFO L225 Difference]: With dead ends: 156905 [2024-10-24 01:42:19,191 INFO L226 Difference]: Without dead ends: 103640 [2024-10-24 01:42:19,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:19,236 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 91 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:19,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 342 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103640 states. [2024-10-24 01:42:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103640 to 99778. [2024-10-24 01:42:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99778 states, 99777 states have (on average 1.430449903284324) internal successors, (142726), 99777 states have internal predecessors, (142726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99778 states to 99778 states and 142726 transitions. [2024-10-24 01:42:20,711 INFO L78 Accepts]: Start accepts. Automaton has 99778 states and 142726 transitions. Word has length 79 [2024-10-24 01:42:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:20,711 INFO L471 AbstractCegarLoop]: Abstraction has 99778 states and 142726 transitions. [2024-10-24 01:42:20,712 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-10-24 01:42:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 99778 states and 142726 transitions. [2024-10-24 01:42:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:42:20,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:20,721 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:20,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:42:20,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:20,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:20,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1614660175, now seen corresponding path program 1 times [2024-10-24 01:42:20,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:20,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616097290] [2024-10-24 01:42:20,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:20,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:20,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:20,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616097290] [2024-10-24 01:42:20,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616097290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:20,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:20,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:42:20,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631491070] [2024-10-24 01:42:20,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:20,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:42:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:42:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:20,777 INFO L87 Difference]: Start difference. First operand 99778 states and 142726 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-10-24 01:42:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:21,408 INFO L93 Difference]: Finished difference Result 210702 states and 299934 transitions. [2024-10-24 01:42:21,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:42:21,409 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-10-24 01:42:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:21,599 INFO L225 Difference]: With dead ends: 210702 [2024-10-24 01:42:21,599 INFO L226 Difference]: Without dead ends: 142079 [2024-10-24 01:42:21,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:21,856 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 92 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:21,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 334 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142079 states. [2024-10-24 01:42:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142079 to 135831. [2024-10-24 01:42:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135831 states, 135830 states have (on average 1.4112051829492749) internal successors, (191684), 135830 states have internal predecessors, (191684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135831 states to 135831 states and 191684 transitions. [2024-10-24 01:42:23,502 INFO L78 Accepts]: Start accepts. Automaton has 135831 states and 191684 transitions. Word has length 79 [2024-10-24 01:42:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:23,502 INFO L471 AbstractCegarLoop]: Abstraction has 135831 states and 191684 transitions. [2024-10-24 01:42:23,502 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-10-24 01:42:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 135831 states and 191684 transitions. [2024-10-24 01:42:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:42:23,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:23,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:23,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:42:23,511 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:23,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash -262022602, now seen corresponding path program 1 times [2024-10-24 01:42:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:23,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062544462] [2024-10-24 01:42:23,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:23,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:23,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062544462] [2024-10-24 01:42:23,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062544462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:23,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:23,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:42:23,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750855558] [2024-10-24 01:42:23,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:23,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:42:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:23,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:42:23,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:23,569 INFO L87 Difference]: Start difference. First operand 135831 states and 191684 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-10-24 01:42:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:24,395 INFO L93 Difference]: Finished difference Result 223138 states and 312854 transitions. [2024-10-24 01:42:24,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:42:24,396 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-10-24 01:42:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:24,581 INFO L225 Difference]: With dead ends: 223138 [2024-10-24 01:42:24,581 INFO L226 Difference]: Without dead ends: 141446 [2024-10-24 01:42:24,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:24,655 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 93 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:24,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 353 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141446 states. [2024-10-24 01:42:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141446 to 134183. [2024-10-24 01:42:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134183 states, 134182 states have (on average 1.3898734554560224) internal successors, (186496), 134182 states have internal predecessors, (186496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134183 states to 134183 states and 186496 transitions. [2024-10-24 01:42:26,798 INFO L78 Accepts]: Start accepts. Automaton has 134183 states and 186496 transitions. Word has length 79 [2024-10-24 01:42:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:26,799 INFO L471 AbstractCegarLoop]: Abstraction has 134183 states and 186496 transitions. [2024-10-24 01:42:26,799 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-10-24 01:42:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 134183 states and 186496 transitions. [2024-10-24 01:42:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:42:26,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:26,817 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:26,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:42:26,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:26,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash 663150994, now seen corresponding path program 1 times [2024-10-24 01:42:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:26,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378239169] [2024-10-24 01:42:26,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:42:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378239169] [2024-10-24 01:42:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378239169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:42:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026997011] [2024-10-24 01:42:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:26,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:42:26,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:42:26,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:42:26,946 INFO L87 Difference]: Start difference. First operand 134183 states and 186496 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:27,745 INFO L93 Difference]: Finished difference Result 331806 states and 465670 transitions. [2024-10-24 01:42:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:42:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-24 01:42:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:28,653 INFO L225 Difference]: With dead ends: 331806 [2024-10-24 01:42:28,656 INFO L226 Difference]: Without dead ends: 272378 [2024-10-24 01:42:28,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:42:28,693 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 737 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:28,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1159 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272378 states. [2024-10-24 01:42:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272378 to 190802. [2024-10-24 01:42:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190802 states, 190801 states have (on average 1.3875398975896354) internal successors, (264744), 190801 states have internal predecessors, (264744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190802 states to 190802 states and 264744 transitions. [2024-10-24 01:42:31,033 INFO L78 Accepts]: Start accepts. Automaton has 190802 states and 264744 transitions. Word has length 79 [2024-10-24 01:42:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:31,033 INFO L471 AbstractCegarLoop]: Abstraction has 190802 states and 264744 transitions. [2024-10-24 01:42:31,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 190802 states and 264744 transitions. [2024-10-24 01:42:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:42:31,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:31,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:31,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:42:31,042 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:31,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:31,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1442337281, now seen corresponding path program 1 times [2024-10-24 01:42:31,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:31,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82223199] [2024-10-24 01:42:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:31,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:42:31,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:31,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82223199] [2024-10-24 01:42:31,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82223199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:31,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:31,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:42:31,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027625966] [2024-10-24 01:42:31,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:31,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:42:31,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:42:31,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:31,556 INFO L87 Difference]: Start difference. First operand 190802 states and 264744 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-10-24 01:42:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:32,709 INFO L93 Difference]: Finished difference Result 445736 states and 618640 transitions. [2024-10-24 01:42:32,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:42:32,709 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-10-24 01:42:32,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:33,100 INFO L225 Difference]: With dead ends: 445736 [2024-10-24 01:42:33,100 INFO L226 Difference]: Without dead ends: 271204 [2024-10-24 01:42:33,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:42:33,922 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:33,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 322 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:34,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271204 states. [2024-10-24 01:42:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271204 to 259362. [2024-10-24 01:42:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259362 states, 259361 states have (on average 1.375480507863557) internal successors, (356746), 259361 states have internal predecessors, (356746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259362 states to 259362 states and 356746 transitions. [2024-10-24 01:42:37,475 INFO L78 Accepts]: Start accepts. Automaton has 259362 states and 356746 transitions. Word has length 79 [2024-10-24 01:42:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:37,475 INFO L471 AbstractCegarLoop]: Abstraction has 259362 states and 356746 transitions. [2024-10-24 01:42:37,475 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-10-24 01:42:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 259362 states and 356746 transitions. [2024-10-24 01:42:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:42:37,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:37,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:37,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:42:37,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:37,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:37,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1953488543, now seen corresponding path program 1 times [2024-10-24 01:42:37,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:37,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958121312] [2024-10-24 01:42:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:37,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:42:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:37,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958121312] [2024-10-24 01:42:37,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958121312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:37,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:37,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:42:37,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478929291] [2024-10-24 01:42:37,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:37,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:42:37,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:37,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:42:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:42:37,721 INFO L87 Difference]: Start difference. First operand 259362 states and 356746 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:39,666 INFO L93 Difference]: Finished difference Result 506441 states and 703468 transitions. [2024-10-24 01:42:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:42:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-24 01:42:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:40,371 INFO L225 Difference]: With dead ends: 506441 [2024-10-24 01:42:40,371 INFO L226 Difference]: Without dead ends: 437508 [2024-10-24 01:42:40,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:42:40,471 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 773 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:40,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1001 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:42:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437508 states. [2024-10-24 01:42:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437508 to 315245. [2024-10-24 01:42:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315245 states, 315244 states have (on average 1.3756201545469542) internal successors, (433656), 315244 states have internal predecessors, (433656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315245 states to 315245 states and 433656 transitions. [2024-10-24 01:42:45,532 INFO L78 Accepts]: Start accepts. Automaton has 315245 states and 433656 transitions. Word has length 79 [2024-10-24 01:42:45,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:42:45,532 INFO L471 AbstractCegarLoop]: Abstraction has 315245 states and 433656 transitions. [2024-10-24 01:42:45,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:42:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 315245 states and 433656 transitions. [2024-10-24 01:42:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:42:45,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:42:45,548 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:42:45,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:42:45,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:42:45,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:42:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1314733110, now seen corresponding path program 1 times [2024-10-24 01:42:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:42:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162774433] [2024-10-24 01:42:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:42:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:42:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:42:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:42:45,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:42:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162774433] [2024-10-24 01:42:45,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162774433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:42:45,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:42:45,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:42:45,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356817529] [2024-10-24 01:42:45,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:42:45,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:42:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:42:45,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:42:45,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:42:45,696 INFO L87 Difference]: Start difference. First operand 315245 states and 433656 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-10-24 01:42:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:42:47,540 INFO L93 Difference]: Finished difference Result 527982 states and 731630 transitions. [2024-10-24 01:42:47,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:42:47,540 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 79 [2024-10-24 01:42:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:42:48,309 INFO L225 Difference]: With dead ends: 527982 [2024-10-24 01:42:48,309 INFO L226 Difference]: Without dead ends: 481904 [2024-10-24 01:42:48,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:42:48,420 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 752 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:42:48,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1046 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:42:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481904 states.