./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:14:41,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:14:41,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:14:41,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:14:41,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:14:41,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:14:41,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:14:41,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:14:41,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:14:41,747 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:14:41,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:14:41,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:14:41,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:14:41,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:14:41,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:14:41,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:14:41,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:14:41,751 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:14:41,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:14:41,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:14:41,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:14:41,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:14:41,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:14:41,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:14:41,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:14:41,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:14:41,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:14:41,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:14:41,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:14:41,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:14:41,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:14:41,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:14:41,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:14:41,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:14:41,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:14:41,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:14:41,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:14:41,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:14:41,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:14:41,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:14:41,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:14:41,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:14:41,762 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 -> a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b [2024-11-11 21:14:42,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:14:42,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:14:42,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:14:42,076 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:14:42,077 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:14:42,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2024-11-11 21:14:43,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:14:43,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:14:43,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2024-11-11 21:14:43,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94d7503b/72caa9c7682c47dda7d7e9fbdd014f7f/FLAG472aa8f0c [2024-11-11 21:14:43,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94d7503b/72caa9c7682c47dda7d7e9fbdd014f7f [2024-11-11 21:14:43,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:14:43,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:14:43,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:14:43,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:14:43,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:14:43,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:14:43" (1/1) ... [2024-11-11 21:14:43,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a3e0475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:43, skipping insertion in model container [2024-11-11 21:14:43,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:14:43" (1/1) ... [2024-11-11 21:14:43,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:14:44,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2024-11-11 21:14:44,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:14:44,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:14:44,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2024-11-11 21:14:44,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:14:44,252 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:14:44,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44 WrapperNode [2024-11-11 21:14:44,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:14:44,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:14:44,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:14:44,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:14:44,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,310 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2024-11-11 21:14:44,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:14:44,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:14:44,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:14:44,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:14:44,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,349 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:14:44,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:14:44,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:14:44,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:14:44,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:14:44,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (1/1) ... [2024-11-11 21:14:44,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:14:44,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:14:44,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:14:44,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:14:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:14:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:14:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:14:44,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:14:44,541 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:14:44,543 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:14:44,907 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-11 21:14:44,907 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:14:44,920 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:14:44,920 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:14:44,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:14:44 BoogieIcfgContainer [2024-11-11 21:14:44,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:14:44,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:14:44,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:14:44,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:14:44,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:14:43" (1/3) ... [2024-11-11 21:14:44,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e437104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:14:44, skipping insertion in model container [2024-11-11 21:14:44,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:44" (2/3) ... [2024-11-11 21:14:44,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e437104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:14:44, skipping insertion in model container [2024-11-11 21:14:44,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:14:44" (3/3) ... [2024-11-11 21:14:44,933 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2024-11-11 21:14:44,951 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:14:44,951 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:14:45,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:14:45,016 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;@3d2925a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:14:45,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:14:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 66 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 21:14:45,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:45,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:45,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:45,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:45,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1570955630, now seen corresponding path program 1 times [2024-11-11 21:14:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37443922] [2024-11-11 21:14:45,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:45,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:45,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37443922] [2024-11-11 21:14:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37443922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:45,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:45,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:14:45,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934814265] [2024-11-11 21:14:45,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:45,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:14:45,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:45,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:14:45,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:45,600 INFO L87 Difference]: Start difference. First operand has 67 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 66 states have internal predecessors, (111), 0 states have call successors, (0), 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 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:45,715 INFO L93 Difference]: Finished difference Result 155 states and 253 transitions. [2024-11-11 21:14:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:14:45,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-11 21:14:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:45,731 INFO L225 Difference]: With dead ends: 155 [2024-11-11 21:14:45,731 INFO L226 Difference]: Without dead ends: 103 [2024-11-11 21:14:45,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:45,740 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 63 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:45,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 391 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:14:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-11 21:14:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 63. [2024-11-11 21:14:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2024-11-11 21:14:45,777 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 25 [2024-11-11 21:14:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:45,778 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2024-11-11 21:14:45,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2024-11-11 21:14:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 21:14:45,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:45,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:45,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:14:45,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:45,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:45,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1519282340, now seen corresponding path program 1 times [2024-11-11 21:14:45,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:45,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200452753] [2024-11-11 21:14:45,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200452753] [2024-11-11 21:14:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200452753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:45,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:45,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:14:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727330235] [2024-11-11 21:14:45,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:45,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:14:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:45,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:14:45,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:45,997 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:46,109 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2024-11-11 21:14:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:14:46,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-11 21:14:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:46,112 INFO L225 Difference]: With dead ends: 223 [2024-11-11 21:14:46,113 INFO L226 Difference]: Without dead ends: 183 [2024-11-11 21:14:46,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:14:46,115 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 362 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:46,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 323 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:14:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-11 21:14:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 101. [2024-11-11 21:14:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.48) internal successors, (148), 100 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2024-11-11 21:14:46,129 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 41 [2024-11-11 21:14:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:46,129 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2024-11-11 21:14:46,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2024-11-11 21:14:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 21:14:46,131 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:46,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:46,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:14:46,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:46,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash -530211178, now seen corresponding path program 1 times [2024-11-11 21:14:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:46,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523154904] [2024-11-11 21:14:46,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:46,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:46,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523154904] [2024-11-11 21:14:46,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523154904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:14:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176971997] [2024-11-11 21:14:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:14:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:14:46,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:46,427 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:46,459 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2024-11-11 21:14:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:14:46,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-11 21:14:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:46,464 INFO L225 Difference]: With dead ends: 109 [2024-11-11 21:14:46,464 INFO L226 Difference]: Without dead ends: 107 [2024-11-11 21:14:46,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:46,466 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:46,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-11 21:14:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-11 21:14:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.4528301886792452) internal successors, (154), 106 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2024-11-11 21:14:46,481 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 42 [2024-11-11 21:14:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:46,481 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2024-11-11 21:14:46,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-11 21:14:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 21:14:46,483 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:46,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:46,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:14:46,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 795901116, now seen corresponding path program 1 times [2024-11-11 21:14:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:46,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610233425] [2024-11-11 21:14:46,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:46,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610233425] [2024-11-11 21:14:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610233425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:46,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:46,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277476702] [2024-11-11 21:14:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:46,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:46,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:46,592 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:46,616 INFO L93 Difference]: Finished difference Result 260 states and 391 transitions. [2024-11-11 21:14:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-11 21:14:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:46,620 INFO L225 Difference]: With dead ends: 260 [2024-11-11 21:14:46,621 INFO L226 Difference]: Without dead ends: 176 [2024-11-11 21:14:46,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:46,623 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 37 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:46,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-11 21:14:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-11-11 21:14:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.4855491329479769) internal successors, (257), 173 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 257 transitions. [2024-11-11 21:14:46,634 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 257 transitions. Word has length 43 [2024-11-11 21:14:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:46,634 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 257 transitions. [2024-11-11 21:14:46,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 257 transitions. [2024-11-11 21:14:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 21:14:46,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:46,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:46,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:14:46,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:46,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2099561413, now seen corresponding path program 1 times [2024-11-11 21:14:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:46,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741010439] [2024-11-11 21:14:46,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:46,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:46,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741010439] [2024-11-11 21:14:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741010439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:46,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245703228] [2024-11-11 21:14:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:46,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:46,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:46,706 INFO L87 Difference]: Start difference. First operand 174 states and 257 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:46,726 INFO L93 Difference]: Finished difference Result 328 states and 494 transitions. [2024-11-11 21:14:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:46,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-11 21:14:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:46,730 INFO L225 Difference]: With dead ends: 328 [2024-11-11 21:14:46,730 INFO L226 Difference]: Without dead ends: 244 [2024-11-11 21:14:46,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:46,731 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:46,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-11 21:14:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2024-11-11 21:14:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4896265560165975) internal successors, (359), 241 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2024-11-11 21:14:46,760 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 43 [2024-11-11 21:14:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:46,763 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2024-11-11 21:14:46,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2024-11-11 21:14:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 21:14:46,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:46,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:46,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:14:46,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:46,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2130979889, now seen corresponding path program 1 times [2024-11-11 21:14:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:46,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757415381] [2024-11-11 21:14:46,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:46,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:46,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757415381] [2024-11-11 21:14:46,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757415381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:46,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:46,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131464955] [2024-11-11 21:14:46,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:46,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:46,862 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:46,886 INFO L93 Difference]: Finished difference Result 628 states and 943 transitions. [2024-11-11 21:14:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:46,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-11 21:14:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:46,890 INFO L225 Difference]: With dead ends: 628 [2024-11-11 21:14:46,892 INFO L226 Difference]: Without dead ends: 411 [2024-11-11 21:14:46,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:46,894 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 44 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:46,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-11 21:14:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2024-11-11 21:14:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 1.4754901960784315) internal successors, (602), 408 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 602 transitions. [2024-11-11 21:14:46,914 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 602 transitions. Word has length 44 [2024-11-11 21:14:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:46,915 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 602 transitions. [2024-11-11 21:14:46,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 602 transitions. [2024-11-11 21:14:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 21:14:46,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:46,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:46,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:14:46,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:46,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash 363298479, now seen corresponding path program 1 times [2024-11-11 21:14:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069312274] [2024-11-11 21:14:46,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069312274] [2024-11-11 21:14:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069312274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:47,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:47,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:47,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955268395] [2024-11-11 21:14:47,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:47,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:47,005 INFO L87 Difference]: Start difference. First operand 409 states and 602 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:47,035 INFO L93 Difference]: Finished difference Result 1081 states and 1588 transitions. [2024-11-11 21:14:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:47,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-11 21:14:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:47,039 INFO L225 Difference]: With dead ends: 1081 [2024-11-11 21:14:47,039 INFO L226 Difference]: Without dead ends: 697 [2024-11-11 21:14:47,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:47,042 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:47,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-11 21:14:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2024-11-11 21:14:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.4380403458213256) internal successors, (998), 694 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 998 transitions. [2024-11-11 21:14:47,072 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 998 transitions. Word has length 44 [2024-11-11 21:14:47,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:47,072 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 998 transitions. [2024-11-11 21:14:47,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 998 transitions. [2024-11-11 21:14:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 21:14:47,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:47,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:47,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:14:47,076 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:47,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2103986451, now seen corresponding path program 1 times [2024-11-11 21:14:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:47,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924946300] [2024-11-11 21:14:47,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:47,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:47,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924946300] [2024-11-11 21:14:47,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924946300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:47,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:47,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:47,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358616802] [2024-11-11 21:14:47,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:47,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:47,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:47,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:47,261 INFO L87 Difference]: Start difference. First operand 695 states and 998 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:47,295 INFO L93 Difference]: Finished difference Result 1367 states and 1972 transitions. [2024-11-11 21:14:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:47,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-11 21:14:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:47,300 INFO L225 Difference]: With dead ends: 1367 [2024-11-11 21:14:47,300 INFO L226 Difference]: Without dead ends: 697 [2024-11-11 21:14:47,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:47,303 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:47,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-11 21:14:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2024-11-11 21:14:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.420749279538905) internal successors, (986), 694 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 986 transitions. [2024-11-11 21:14:47,334 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 986 transitions. Word has length 62 [2024-11-11 21:14:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:47,334 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 986 transitions. [2024-11-11 21:14:47,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 986 transitions. [2024-11-11 21:14:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 21:14:47,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:47,336 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:47,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:14:47,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:47,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash 618962962, now seen corresponding path program 1 times [2024-11-11 21:14:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:47,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228234033] [2024-11-11 21:14:47,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:47,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228234033] [2024-11-11 21:14:47,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228234033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504374781] [2024-11-11 21:14:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:47,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:47,488 INFO L87 Difference]: Start difference. First operand 695 states and 986 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:47,508 INFO L93 Difference]: Finished difference Result 1033 states and 1468 transitions. [2024-11-11 21:14:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:47,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-11 21:14:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:47,513 INFO L225 Difference]: With dead ends: 1033 [2024-11-11 21:14:47,513 INFO L226 Difference]: Without dead ends: 363 [2024-11-11 21:14:47,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:47,515 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:47,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-11 21:14:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2024-11-11 21:14:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.3888888888888888) internal successors, (500), 360 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 500 transitions. [2024-11-11 21:14:47,531 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 500 transitions. Word has length 62 [2024-11-11 21:14:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:47,531 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 500 transitions. [2024-11-11 21:14:47,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 500 transitions. [2024-11-11 21:14:47,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 21:14:47,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:47,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:47,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:14:47,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:47,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1005211281, now seen corresponding path program 1 times [2024-11-11 21:14:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:47,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215535529] [2024-11-11 21:14:47,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:14:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215535529] [2024-11-11 21:14:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215535529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:14:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421873962] [2024-11-11 21:14:47,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:14:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:14:47,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:14:47,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:14:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:47,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 21:14:47,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:14:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:48,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:14:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421873962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:14:48,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:14:48,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 8] total 14 [2024-11-11 21:14:48,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984876611] [2024-11-11 21:14:48,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:14:48,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 21:14:48,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:48,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 21:14:48,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:14:48,683 INFO L87 Difference]: Start difference. First operand 361 states and 500 transitions. Second operand has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:49,503 INFO L93 Difference]: Finished difference Result 1621 states and 2280 transitions. [2024-11-11 21:14:49,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 21:14:49,504 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-11 21:14:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:49,509 INFO L225 Difference]: With dead ends: 1621 [2024-11-11 21:14:49,509 INFO L226 Difference]: Without dead ends: 1387 [2024-11-11 21:14:49,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=400, Invalid=1492, Unknown=0, NotChecked=0, Total=1892 [2024-11-11 21:14:49,511 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 633 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:49,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1041 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:14:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-11 21:14:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1271. [2024-11-11 21:14:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 1.3937007874015748) internal successors, (1770), 1270 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1770 transitions. [2024-11-11 21:14:49,548 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1770 transitions. Word has length 62 [2024-11-11 21:14:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:49,548 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1770 transitions. [2024-11-11 21:14:49,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1770 transitions. [2024-11-11 21:14:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:14:49,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:49,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:49,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:14:49,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 21:14:49,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:49,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash 538897112, now seen corresponding path program 1 times [2024-11-11 21:14:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:49,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783131008] [2024-11-11 21:14:49,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:14:49,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:49,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783131008] [2024-11-11 21:14:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783131008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:14:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223250814] [2024-11-11 21:14:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:49,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:14:49,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:14:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:49,870 INFO L87 Difference]: Start difference. First operand 1271 states and 1770 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:49,964 INFO L93 Difference]: Finished difference Result 3149 states and 4422 transitions. [2024-11-11 21:14:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:14:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 21:14:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:49,976 INFO L225 Difference]: With dead ends: 3149 [2024-11-11 21:14:49,976 INFO L226 Difference]: Without dead ends: 2489 [2024-11-11 21:14:49,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:14:49,978 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 225 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:49,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 365 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2024-11-11 21:14:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 1887. [2024-11-11 21:14:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1886 states have (on average 1.3902439024390243) internal successors, (2622), 1886 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2622 transitions. [2024-11-11 21:14:50,068 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2622 transitions. Word has length 63 [2024-11-11 21:14:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:50,068 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2622 transitions. [2024-11-11 21:14:50,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2622 transitions. [2024-11-11 21:14:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:14:50,069 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:50,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:50,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:14:50,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:50,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1576448234, now seen corresponding path program 1 times [2024-11-11 21:14:50,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:50,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142961292] [2024-11-11 21:14:50,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:14:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142961292] [2024-11-11 21:14:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142961292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:50,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:14:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797740643] [2024-11-11 21:14:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:50,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:14:50,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:14:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:50,166 INFO L87 Difference]: Start difference. First operand 1887 states and 2622 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:50,258 INFO L93 Difference]: Finished difference Result 3765 states and 5274 transitions. [2024-11-11 21:14:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:14:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 21:14:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:50,271 INFO L225 Difference]: With dead ends: 3765 [2024-11-11 21:14:50,271 INFO L226 Difference]: Without dead ends: 3105 [2024-11-11 21:14:50,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:14:50,274 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 223 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:50,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 394 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2024-11-11 21:14:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2503. [2024-11-11 21:14:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2503 states, 2502 states have (on average 1.3884892086330936) internal successors, (3474), 2502 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 3474 transitions. [2024-11-11 21:14:50,360 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 3474 transitions. Word has length 63 [2024-11-11 21:14:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:50,361 INFO L471 AbstractCegarLoop]: Abstraction has 2503 states and 3474 transitions. [2024-11-11 21:14:50,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 3474 transitions. [2024-11-11 21:14:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:14:50,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:50,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:50,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:14:50,362 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:50,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1116171083, now seen corresponding path program 1 times [2024-11-11 21:14:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:50,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417972283] [2024-11-11 21:14:50,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:50,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:14:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:50,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417972283] [2024-11-11 21:14:50,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417972283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:50,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:50,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:14:50,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132689735] [2024-11-11 21:14:50,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:50,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:14:50,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:50,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:14:50,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:50,481 INFO L87 Difference]: Start difference. First operand 2503 states and 3474 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:50,609 INFO L93 Difference]: Finished difference Result 4225 states and 5898 transitions. [2024-11-11 21:14:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:14:50,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 21:14:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:50,625 INFO L225 Difference]: With dead ends: 4225 [2024-11-11 21:14:50,625 INFO L226 Difference]: Without dead ends: 3665 [2024-11-11 21:14:50,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:14:50,628 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 218 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:50,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 373 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2024-11-11 21:14:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 3063. [2024-11-11 21:14:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 3062 states have (on average 1.3860222077073807) internal successors, (4244), 3062 states have internal predecessors, (4244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4244 transitions. [2024-11-11 21:14:50,746 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4244 transitions. Word has length 63 [2024-11-11 21:14:50,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:50,746 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4244 transitions. [2024-11-11 21:14:50,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4244 transitions. [2024-11-11 21:14:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:14:50,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:50,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:50,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:14:50,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:50,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash -296558916, now seen corresponding path program 1 times [2024-11-11 21:14:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954030273] [2024-11-11 21:14:50,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:50,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954030273] [2024-11-11 21:14:50,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954030273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:50,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:50,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198720389] [2024-11-11 21:14:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:50,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:50,825 INFO L87 Difference]: Start difference. First operand 3063 states and 4244 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:50,869 INFO L93 Difference]: Finished difference Result 4448 states and 6139 transitions. [2024-11-11 21:14:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-11 21:14:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:50,875 INFO L225 Difference]: With dead ends: 4448 [2024-11-11 21:14:50,876 INFO L226 Difference]: Without dead ends: 1410 [2024-11-11 21:14:50,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:50,880 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 21 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:50,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-11-11 21:14:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1128. [2024-11-11 21:14:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.3744454303460514) internal successors, (1549), 1127 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1549 transitions. [2024-11-11 21:14:50,919 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1549 transitions. Word has length 66 [2024-11-11 21:14:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:50,919 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1549 transitions. [2024-11-11 21:14:50,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:14:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1549 transitions. [2024-11-11 21:14:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:14:50,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:50,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:50,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:14:50,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:50,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2010529603, now seen corresponding path program 1 times [2024-11-11 21:14:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:50,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338262240] [2024-11-11 21:14:50,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338262240] [2024-11-11 21:14:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338262240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:14:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122175138] [2024-11-11 21:14:51,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:51,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:14:51,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:14:51,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:14:51,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:14:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:51,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-11 21:14:51,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:14:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:55,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:14:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:57,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122175138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:14:57,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:14:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 18] total 39 [2024-11-11 21:14:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169426558] [2024-11-11 21:14:57,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:14:57,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-11 21:14:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-11 21:14:57,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2024-11-11 21:14:57,180 INFO L87 Difference]: Start difference. First operand 1128 states and 1549 transitions. Second operand has 39 states, 39 states have (on average 4.512820512820513) internal successors, (176), 39 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:06,531 INFO L93 Difference]: Finished difference Result 20016 states and 27502 transitions. [2024-11-11 21:15:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-11-11 21:15:06,531 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.512820512820513) internal successors, (176), 39 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-11 21:15:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:06,601 INFO L225 Difference]: With dead ends: 20016 [2024-11-11 21:15:06,602 INFO L226 Difference]: Without dead ends: 18915 [2024-11-11 21:15:06,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9077 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=4786, Invalid=19706, Unknown=0, NotChecked=0, Total=24492 [2024-11-11 21:15:06,619 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 6371 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6371 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:06,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6371 Valid, 2136 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 21:15:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18915 states. [2024-11-11 21:15:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18915 to 9957. [2024-11-11 21:15:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9957 states, 9956 states have (on average 1.3536560867818401) internal successors, (13477), 9956 states have internal predecessors, (13477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9957 states to 9957 states and 13477 transitions. [2024-11-11 21:15:07,117 INFO L78 Accepts]: Start accepts. Automaton has 9957 states and 13477 transitions. Word has length 66 [2024-11-11 21:15:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:07,118 INFO L471 AbstractCegarLoop]: Abstraction has 9957 states and 13477 transitions. [2024-11-11 21:15:07,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.512820512820513) internal successors, (176), 39 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 9957 states and 13477 transitions. [2024-11-11 21:15:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:15:07,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:07,120 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:07,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:15:07,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 21:15:07,321 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:07,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash 169092347, now seen corresponding path program 1 times [2024-11-11 21:15:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:07,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848890619] [2024-11-11 21:15:07,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:07,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:07,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848890619] [2024-11-11 21:15:07,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848890619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678473628] [2024-11-11 21:15:07,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:07,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:07,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:15:07,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:15:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:07,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 21:15:07,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:08,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:09,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678473628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:09,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:09,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-11 21:15:09,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103725938] [2024-11-11 21:15:09,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:09,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-11 21:15:09,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:09,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-11 21:15:09,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-11-11 21:15:09,274 INFO L87 Difference]: Start difference. First operand 9957 states and 13477 transitions. Second operand has 32 states, 32 states have (on average 5.59375) internal successors, (179), 32 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:18,854 INFO L93 Difference]: Finished difference Result 37922 states and 51913 transitions. [2024-11-11 21:15:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2024-11-11 21:15:18,856 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.59375) internal successors, (179), 32 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-11 21:15:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:18,914 INFO L225 Difference]: With dead ends: 37922 [2024-11-11 21:15:18,914 INFO L226 Difference]: Without dead ends: 28622 [2024-11-11 21:15:18,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15621 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=6327, Invalid=32679, Unknown=0, NotChecked=0, Total=39006 [2024-11-11 21:15:18,942 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 7086 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7086 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:18,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7086 Valid, 2320 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 21:15:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28622 states. [2024-11-11 21:15:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28622 to 17008. [2024-11-11 21:15:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17008 states, 17007 states have (on average 1.3454459928264833) internal successors, (22882), 17007 states have internal predecessors, (22882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17008 states to 17008 states and 22882 transitions. [2024-11-11 21:15:19,704 INFO L78 Accepts]: Start accepts. Automaton has 17008 states and 22882 transitions. Word has length 66 [2024-11-11 21:15:19,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:19,704 INFO L471 AbstractCegarLoop]: Abstraction has 17008 states and 22882 transitions. [2024-11-11 21:15:19,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.59375) internal successors, (179), 32 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17008 states and 22882 transitions. [2024-11-11 21:15:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 21:15:19,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:19,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:19,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 21:15:19,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:19,911 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:19,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:19,911 INFO L85 PathProgramCache]: Analyzing trace with hash -367044543, now seen corresponding path program 1 times [2024-11-11 21:15:19,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:19,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834239914] [2024-11-11 21:15:19,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:19,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:19,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834239914] [2024-11-11 21:15:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834239914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:19,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:19,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744389813] [2024-11-11 21:15:19,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:19,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:19,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:19,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:19,960 INFO L87 Difference]: Start difference. First operand 17008 states and 22882 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:20,310 INFO L93 Difference]: Finished difference Result 31722 states and 42428 transitions. [2024-11-11 21:15:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:20,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-11 21:15:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:20,337 INFO L225 Difference]: With dead ends: 31722 [2024-11-11 21:15:20,337 INFO L226 Difference]: Without dead ends: 15721 [2024-11-11 21:15:20,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:20,358 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 36 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:20,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 213 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15721 states. [2024-11-11 21:15:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15721 to 13729. [2024-11-11 21:15:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13729 states, 13728 states have (on average 1.3080565268065267) internal successors, (17957), 13728 states have internal predecessors, (17957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13729 states to 13729 states and 17957 transitions. [2024-11-11 21:15:20,891 INFO L78 Accepts]: Start accepts. Automaton has 13729 states and 17957 transitions. Word has length 68 [2024-11-11 21:15:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:20,893 INFO L471 AbstractCegarLoop]: Abstraction has 13729 states and 17957 transitions. [2024-11-11 21:15:20,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 13729 states and 17957 transitions. [2024-11-11 21:15:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 21:15:20,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:20,905 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:20,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:15:20,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:20,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash -428020768, now seen corresponding path program 1 times [2024-11-11 21:15:20,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:20,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311095285] [2024-11-11 21:15:20,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:20,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 21:15:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311095285] [2024-11-11 21:15:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311095285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:20,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:20,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677405468] [2024-11-11 21:15:20,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:20,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:20,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:20,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:20,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:20,971 INFO L87 Difference]: Start difference. First operand 13729 states and 17957 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:21,291 INFO L93 Difference]: Finished difference Result 29150 states and 37935 transitions. [2024-11-11 21:15:21,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-11-11 21:15:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:21,318 INFO L225 Difference]: With dead ends: 29150 [2024-11-11 21:15:21,319 INFO L226 Difference]: Without dead ends: 16104 [2024-11-11 21:15:21,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:21,337 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 37 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 173 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-11-11 21:15:21,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 173 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2024-11-11 21:15:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 15294. [2024-11-11 21:15:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15294 states, 15293 states have (on average 1.272346825344929) internal successors, (19458), 15293 states have internal predecessors, (19458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15294 states to 15294 states and 19458 transitions. [2024-11-11 21:15:21,941 INFO L78 Accepts]: Start accepts. Automaton has 15294 states and 19458 transitions. Word has length 107 [2024-11-11 21:15:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:21,941 INFO L471 AbstractCegarLoop]: Abstraction has 15294 states and 19458 transitions. [2024-11-11 21:15:21,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 15294 states and 19458 transitions. [2024-11-11 21:15:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 21:15:21,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:21,950 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:21,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:15:21,950 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:21,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1114315502, now seen corresponding path program 1 times [2024-11-11 21:15:21,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:21,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673211732] [2024-11-11 21:15:21,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:21,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 21:15:22,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673211732] [2024-11-11 21:15:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673211732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:22,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:22,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665420277] [2024-11-11 21:15:22,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:22,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:22,014 INFO L87 Difference]: Start difference. First operand 15294 states and 19458 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:22,412 INFO L93 Difference]: Finished difference Result 20712 states and 26238 transitions. [2024-11-11 21:15:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:22,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-11-11 21:15:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:22,430 INFO L225 Difference]: With dead ends: 20712 [2024-11-11 21:15:22,430 INFO L226 Difference]: Without dead ends: 11988 [2024-11-11 21:15:22,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:22,441 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 27 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 176 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-11-11 21:15:22,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 176 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11988 states. [2024-11-11 21:15:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11988 to 11116. [2024-11-11 21:15:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11116 states, 11115 states have (on average 1.256050382366172) internal successors, (13961), 11115 states have internal predecessors, (13961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11116 states to 11116 states and 13961 transitions. [2024-11-11 21:15:22,913 INFO L78 Accepts]: Start accepts. Automaton has 11116 states and 13961 transitions. Word has length 107 [2024-11-11 21:15:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:22,913 INFO L471 AbstractCegarLoop]: Abstraction has 11116 states and 13961 transitions. [2024-11-11 21:15:22,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 11116 states and 13961 transitions. [2024-11-11 21:15:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 21:15:22,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:22,921 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:22,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:15:22,922 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:22,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:22,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1816074562, now seen corresponding path program 1 times [2024-11-11 21:15:22,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:22,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346983072] [2024-11-11 21:15:22,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:22,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 21:15:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346983072] [2024-11-11 21:15:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346983072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:23,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:23,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248421363] [2024-11-11 21:15:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:23,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:23,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:23,007 INFO L87 Difference]: Start difference. First operand 11116 states and 13961 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:23,416 INFO L93 Difference]: Finished difference Result 16181 states and 20228 transitions. [2024-11-11 21:15:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-11 21:15:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:23,433 INFO L225 Difference]: With dead ends: 16181 [2024-11-11 21:15:23,433 INFO L226 Difference]: Without dead ends: 9878 [2024-11-11 21:15:23,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:23,445 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:23,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9878 states. [2024-11-11 21:15:23,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9878 to 9691. [2024-11-11 21:15:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9691 states, 9690 states have (on average 1.236016511867905) internal successors, (11977), 9690 states have internal predecessors, (11977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9691 states to 9691 states and 11977 transitions. [2024-11-11 21:15:23,710 INFO L78 Accepts]: Start accepts. Automaton has 9691 states and 11977 transitions. Word has length 108 [2024-11-11 21:15:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:23,710 INFO L471 AbstractCegarLoop]: Abstraction has 9691 states and 11977 transitions. [2024-11-11 21:15:23,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 9691 states and 11977 transitions. [2024-11-11 21:15:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 21:15:23,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:23,717 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:23,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:15:23,717 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:23,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1146161838, now seen corresponding path program 1 times [2024-11-11 21:15:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:23,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951058677] [2024-11-11 21:15:23,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:23,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 21:15:24,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:24,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951058677] [2024-11-11 21:15:24,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951058677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:24,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75099873] [2024-11-11 21:15:24,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:24,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:24,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:24,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:15:24,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 21:15:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:24,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 21:15:24,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 37 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:24,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:26,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75099873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:26,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 26 [2024-11-11 21:15:26,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062786241] [2024-11-11 21:15:26,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:26,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 21:15:26,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:26,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 21:15:26,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2024-11-11 21:15:26,882 INFO L87 Difference]: Start difference. First operand 9691 states and 11977 transitions. Second operand has 27 states, 27 states have (on average 9.37037037037037) internal successors, (253), 26 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:28,439 INFO L93 Difference]: Finished difference Result 38536 states and 47398 transitions. [2024-11-11 21:15:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 21:15:28,440 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.37037037037037) internal successors, (253), 26 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-11 21:15:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:28,477 INFO L225 Difference]: With dead ends: 38536 [2024-11-11 21:15:28,478 INFO L226 Difference]: Without dead ends: 29956 [2024-11-11 21:15:28,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=683, Invalid=2073, Unknown=0, NotChecked=0, Total=2756 [2024-11-11 21:15:28,488 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1121 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:28,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 941 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:15:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29956 states. [2024-11-11 21:15:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29956 to 20607. [2024-11-11 21:15:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20607 states, 20606 states have (on average 1.2252741919829175) internal successors, (25248), 20606 states have internal predecessors, (25248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20607 states to 20607 states and 25248 transitions. [2024-11-11 21:15:29,281 INFO L78 Accepts]: Start accepts. Automaton has 20607 states and 25248 transitions. Word has length 108 [2024-11-11 21:15:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:29,282 INFO L471 AbstractCegarLoop]: Abstraction has 20607 states and 25248 transitions. [2024-11-11 21:15:29,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.37037037037037) internal successors, (253), 26 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 20607 states and 25248 transitions. [2024-11-11 21:15:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 21:15:29,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:29,294 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:29,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 21:15:29,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:29,495 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:29,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:29,495 INFO L85 PathProgramCache]: Analyzing trace with hash -424166440, now seen corresponding path program 1 times [2024-11-11 21:15:29,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488881093] [2024-11-11 21:15:29,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:29,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 21:15:29,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:29,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488881093] [2024-11-11 21:15:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488881093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:29,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:29,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:29,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091772641] [2024-11-11 21:15:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:29,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:29,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:29,567 INFO L87 Difference]: Start difference. First operand 20607 states and 25248 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:30,557 INFO L93 Difference]: Finished difference Result 47276 states and 57406 transitions. [2024-11-11 21:15:30,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:30,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-11 21:15:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:30,600 INFO L225 Difference]: With dead ends: 47276 [2024-11-11 21:15:30,600 INFO L226 Difference]: Without dead ends: 27655 [2024-11-11 21:15:30,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:30,621 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 39 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 188 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-11-11 21:15:30,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27655 states. [2024-11-11 21:15:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27655 to 27380. [2024-11-11 21:15:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27380 states, 27379 states have (on average 1.178275320501114) internal successors, (32260), 27379 states have internal predecessors, (32260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27380 states to 27380 states and 32260 transitions. [2024-11-11 21:15:31,501 INFO L78 Accepts]: Start accepts. Automaton has 27380 states and 32260 transitions. Word has length 108 [2024-11-11 21:15:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:31,502 INFO L471 AbstractCegarLoop]: Abstraction has 27380 states and 32260 transitions. [2024-11-11 21:15:31,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 27380 states and 32260 transitions. [2024-11-11 21:15:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 21:15:31,513 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:31,513 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:31,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:15:31,514 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:31,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash 325031386, now seen corresponding path program 1 times [2024-11-11 21:15:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:31,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881012500] [2024-11-11 21:15:31,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 24 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:32,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:32,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881012500] [2024-11-11 21:15:32,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881012500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:32,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443364025] [2024-11-11 21:15:32,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:32,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:32,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:15:32,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 21:15:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-11 21:15:33,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 48 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:33,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:35,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443364025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:35,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:35,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 15] total 44 [2024-11-11 21:15:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947304758] [2024-11-11 21:15:35,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:35,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-11 21:15:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-11 21:15:35,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1729, Unknown=0, NotChecked=0, Total=1892 [2024-11-11 21:15:35,807 INFO L87 Difference]: Start difference. First operand 27380 states and 32260 transitions. Second operand has 44 states, 44 states have (on average 6.931818181818182) internal successors, (305), 44 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:53,727 INFO L93 Difference]: Finished difference Result 89787 states and 105830 transitions. [2024-11-11 21:15:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-11-11 21:15:53,728 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.931818181818182) internal successors, (305), 44 states have internal predecessors, (305), 0 states have call successors, (0), 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 109 [2024-11-11 21:15:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:53,794 INFO L225 Difference]: With dead ends: 89787 [2024-11-11 21:15:53,794 INFO L226 Difference]: Without dead ends: 66428 [2024-11-11 21:15:53,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11782 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=5386, Invalid=29396, Unknown=0, NotChecked=0, Total=34782 [2024-11-11 21:15:53,816 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 4252 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4252 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:53,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4252 Valid, 2067 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 21:15:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66428 states. [2024-11-11 21:15:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66428 to 46847. [2024-11-11 21:15:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46847 states, 46846 states have (on average 1.1803355676044913) internal successors, (55294), 46846 states have internal predecessors, (55294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46847 states to 46847 states and 55294 transitions. [2024-11-11 21:15:56,044 INFO L78 Accepts]: Start accepts. Automaton has 46847 states and 55294 transitions. Word has length 109 [2024-11-11 21:15:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:56,044 INFO L471 AbstractCegarLoop]: Abstraction has 46847 states and 55294 transitions. [2024-11-11 21:15:56,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.931818181818182) internal successors, (305), 44 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 46847 states and 55294 transitions. [2024-11-11 21:15:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 21:15:56,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:56,057 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:56,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 21:15:56,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-11 21:15:56,258 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1495967852, now seen corresponding path program 1 times [2024-11-11 21:15:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:56,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624828900] [2024-11-11 21:15:56,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 21:15:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624828900] [2024-11-11 21:15:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624828900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:56,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61461876] [2024-11-11 21:15:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:56,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:56,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:56,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:56,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:56,328 INFO L87 Difference]: Start difference. First operand 46847 states and 55294 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:57,989 INFO L93 Difference]: Finished difference Result 69248 states and 81548 transitions. [2024-11-11 21:15:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:57,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-11 21:15:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:58,039 INFO L225 Difference]: With dead ends: 69248 [2024-11-11 21:15:58,039 INFO L226 Difference]: Without dead ends: 40384 [2024-11-11 21:15:58,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:58,067 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 27 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:58,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 206 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40384 states. [2024-11-11 21:15:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40384 to 33745. [2024-11-11 21:15:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33745 states, 33744 states have (on average 1.1674371740161213) internal successors, (39394), 33744 states have internal predecessors, (39394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33745 states to 33745 states and 39394 transitions. [2024-11-11 21:15:59,503 INFO L78 Accepts]: Start accepts. Automaton has 33745 states and 39394 transitions. Word has length 109 [2024-11-11 21:15:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:59,503 INFO L471 AbstractCegarLoop]: Abstraction has 33745 states and 39394 transitions. [2024-11-11 21:15:59,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 33745 states and 39394 transitions. [2024-11-11 21:15:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 21:15:59,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:59,511 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:15:59,512 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1463366074, now seen corresponding path program 1 times [2024-11-11 21:15:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:59,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883383147] [2024-11-11 21:15:59,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat