./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:30:29,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:30:29,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:30:29,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:30:29,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:30:29,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:30:29,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:30:29,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:30:29,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:30:29,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:30:29,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:30:29,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:30:29,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:30:29,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:30:29,141 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:30:29,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:30:29,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:30:29,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:30:29,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:30:29,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:30:29,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:30:29,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:30:29,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:30:29,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:30:29,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:30:29,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:30:29,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:30:29,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:30:29,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:30:29,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:30:29,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:30:29,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:30:29,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:30:29,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:30:29,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:30:29,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:30:29,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:30:29,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:30:29,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:30:29,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:30:29,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:30:29,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:30:29,152 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 -> 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc [2024-10-14 03:30:29,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:30:29,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:30:29,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:30:29,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:30:29,460 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:30:29,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2024-10-14 03:30:30,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:30:31,149 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:30:31,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2024-10-14 03:30:31,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1053c90d/3b9aa8e878504baf8724619156283f2f/FLAGe1a94db3f [2024-10-14 03:30:31,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1053c90d/3b9aa8e878504baf8724619156283f2f [2024-10-14 03:30:31,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:30:31,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:30:31,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:30:31,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:30:31,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:30:31,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fc3c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31, skipping insertion in model container [2024-10-14 03:30:31,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:30:31,779 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2024-10-14 03:30:31,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:30:31,798 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:30:31,842 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2024-10-14 03:30:31,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:30:31,864 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:30:31,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31 WrapperNode [2024-10-14 03:30:31,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:30:31,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:30:31,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:30:31,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:30:31,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,913 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 313 [2024-10-14 03:30:31,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:30:31,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:30:31,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:30:31,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:30:31,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,956 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:30:31,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:31,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:30:31,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:30:31,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:30:31,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:30:31,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (1/1) ... [2024-10-14 03:30:32,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:30:32,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:30:32,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:30:32,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:30:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:30:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:30:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:30:32,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:30:32,187 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:30:32,188 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:30:32,606 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-14 03:30:32,606 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:30:32,667 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:30:32,668 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:30:32,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:30:32 BoogieIcfgContainer [2024-10-14 03:30:32,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:30:32,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:30:32,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:30:32,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:30:32,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:30:31" (1/3) ... [2024-10-14 03:30:32,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57193a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:30:32, skipping insertion in model container [2024-10-14 03:30:32,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:31" (2/3) ... [2024-10-14 03:30:32,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57193a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:30:32, skipping insertion in model container [2024-10-14 03:30:32,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:30:32" (3/3) ... [2024-10-14 03:30:32,693 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2024-10-14 03:30:32,709 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:30:32,709 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:30:32,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:30:32,786 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;@725d8c0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:30:32,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:30:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 79 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:30:32,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:32,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:32,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1507217479, now seen corresponding path program 1 times [2024-10-14 03:30:32,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:32,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972870806] [2024-10-14 03:30:32,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:32,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:33,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:33,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972870806] [2024-10-14 03:30:33,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972870806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:33,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:33,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:30:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660097016] [2024-10-14 03:30:33,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:33,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:30:33,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:33,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:30:33,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:30:33,102 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 79 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:33,134 INFO L93 Difference]: Finished difference Result 131 states and 223 transitions. [2024-10-14 03:30:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:30:33,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-14 03:30:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:33,146 INFO L225 Difference]: With dead ends: 131 [2024-10-14 03:30:33,146 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 03:30:33,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:30:33,152 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:33,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 03:30:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 03:30:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 77 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 133 transitions. [2024-10-14 03:30:33,185 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 133 transitions. Word has length 26 [2024-10-14 03:30:33,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:33,187 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 133 transitions. [2024-10-14 03:30:33,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 133 transitions. [2024-10-14 03:30:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:30:33,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:33,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:33,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:30:33,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:33,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:33,191 INFO L85 PathProgramCache]: Analyzing trace with hash -298220855, now seen corresponding path program 1 times [2024-10-14 03:30:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:33,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886582772] [2024-10-14 03:30:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:33,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886582772] [2024-10-14 03:30:33,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886582772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:33,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:33,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:30:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394015261] [2024-10-14 03:30:33,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:33,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:30:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:33,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:30:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:33,392 INFO L87 Difference]: Start difference. First operand 78 states and 133 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:33,467 INFO L93 Difference]: Finished difference Result 131 states and 217 transitions. [2024-10-14 03:30:33,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:30:33,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-14 03:30:33,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:33,475 INFO L225 Difference]: With dead ends: 131 [2024-10-14 03:30:33,475 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 03:30:33,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:33,477 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:33,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 03:30:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 03:30:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-10-14 03:30:33,488 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 26 [2024-10-14 03:30:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:33,489 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-10-14 03:30:33,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-10-14 03:30:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:30:33,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:33,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:33,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:30:33,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:33,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1362711976, now seen corresponding path program 1 times [2024-10-14 03:30:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:33,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060646744] [2024-10-14 03:30:33,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:33,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060646744] [2024-10-14 03:30:33,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060646744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:33,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:33,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:33,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561435220] [2024-10-14 03:30:33,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:33,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:33,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:33,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:33,632 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:33,664 INFO L93 Difference]: Finished difference Result 170 states and 257 transitions. [2024-10-14 03:30:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:33,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 03:30:33,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:33,667 INFO L225 Difference]: With dead ends: 170 [2024-10-14 03:30:33,669 INFO L226 Difference]: Without dead ends: 120 [2024-10-14 03:30:33,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:33,671 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 61 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:33,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 218 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-14 03:30:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-14 03:30:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4871794871794872) internal successors, (174), 117 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-14 03:30:33,689 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 49 [2024-10-14 03:30:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:33,690 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-14 03:30:33,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-14 03:30:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:30:33,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:33,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:33,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:30:33,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:33,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash -451507977, now seen corresponding path program 1 times [2024-10-14 03:30:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045177920] [2024-10-14 03:30:33,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:33,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:33,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045177920] [2024-10-14 03:30:33,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045177920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:33,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:33,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:33,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33885812] [2024-10-14 03:30:33,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:33,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:33,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:33,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:33,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:33,918 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:34,081 INFO L93 Difference]: Finished difference Result 568 states and 904 transitions. [2024-10-14 03:30:34,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:34,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 03:30:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:34,088 INFO L225 Difference]: With dead ends: 568 [2024-10-14 03:30:34,088 INFO L226 Difference]: Without dead ends: 478 [2024-10-14 03:30:34,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:34,092 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 709 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:34,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 570 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-14 03:30:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 206. [2024-10-14 03:30:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.5365853658536586) internal successors, (315), 205 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 315 transitions. [2024-10-14 03:30:34,127 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 315 transitions. Word has length 49 [2024-10-14 03:30:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:34,127 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 315 transitions. [2024-10-14 03:30:34,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 315 transitions. [2024-10-14 03:30:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:30:34,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:34,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:34,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:30:34,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:34,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1124876253, now seen corresponding path program 1 times [2024-10-14 03:30:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427131612] [2024-10-14 03:30:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:34,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427131612] [2024-10-14 03:30:34,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427131612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:34,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:34,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:30:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340192545] [2024-10-14 03:30:34,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:34,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:30:34,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:34,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:30:34,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:34,359 INFO L87 Difference]: Start difference. First operand 206 states and 315 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:34,396 INFO L93 Difference]: Finished difference Result 216 states and 328 transitions. [2024-10-14 03:30:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:30:34,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-14 03:30:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:34,400 INFO L225 Difference]: With dead ends: 216 [2024-10-14 03:30:34,400 INFO L226 Difference]: Without dead ends: 214 [2024-10-14 03:30:34,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:34,401 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:34,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-14 03:30:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-10-14 03:30:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.516431924882629) internal successors, (323), 213 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 323 transitions. [2024-10-14 03:30:34,419 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 323 transitions. Word has length 50 [2024-10-14 03:30:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:34,420 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 323 transitions. [2024-10-14 03:30:34,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 323 transitions. [2024-10-14 03:30:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:30:34,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:34,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:34,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:30:34,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:34,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:34,422 INFO L85 PathProgramCache]: Analyzing trace with hash -510394977, now seen corresponding path program 1 times [2024-10-14 03:30:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560978802] [2024-10-14 03:30:34,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:34,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:34,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560978802] [2024-10-14 03:30:34,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560978802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:34,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:34,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:34,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877861650] [2024-10-14 03:30:34,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:34,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:34,564 INFO L87 Difference]: Start difference. First operand 214 states and 323 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:34,590 INFO L93 Difference]: Finished difference Result 558 states and 865 transitions. [2024-10-14 03:30:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:34,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 03:30:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:34,593 INFO L225 Difference]: With dead ends: 558 [2024-10-14 03:30:34,596 INFO L226 Difference]: Without dead ends: 372 [2024-10-14 03:30:34,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:34,597 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:34,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 178 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-14 03:30:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 366. [2024-10-14 03:30:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.526027397260274) internal successors, (557), 365 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 557 transitions. [2024-10-14 03:30:34,613 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 557 transitions. Word has length 51 [2024-10-14 03:30:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:34,613 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 557 transitions. [2024-10-14 03:30:34,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 557 transitions. [2024-10-14 03:30:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:30:34,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:34,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:34,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:30:34,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1323600906, now seen corresponding path program 1 times [2024-10-14 03:30:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:34,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289684934] [2024-10-14 03:30:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:34,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289684934] [2024-10-14 03:30:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289684934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:34,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011012559] [2024-10-14 03:30:34,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:34,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:34,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:34,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:34,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:34,701 INFO L87 Difference]: Start difference. First operand 366 states and 557 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:34,737 INFO L93 Difference]: Finished difference Result 978 states and 1503 transitions. [2024-10-14 03:30:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:34,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-14 03:30:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:34,740 INFO L225 Difference]: With dead ends: 978 [2024-10-14 03:30:34,740 INFO L226 Difference]: Without dead ends: 640 [2024-10-14 03:30:34,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:34,745 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 57 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:34,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 216 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-14 03:30:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 638. [2024-10-14 03:30:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 1.5149136577708007) internal successors, (965), 637 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 965 transitions. [2024-10-14 03:30:34,777 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 965 transitions. Word has length 52 [2024-10-14 03:30:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:34,778 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 965 transitions. [2024-10-14 03:30:34,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 965 transitions. [2024-10-14 03:30:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:30:34,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:34,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:34,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:30:34,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:34,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 667545162, now seen corresponding path program 1 times [2024-10-14 03:30:34,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:34,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495780449] [2024-10-14 03:30:34,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:34,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:34,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:34,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495780449] [2024-10-14 03:30:34,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495780449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:34,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:34,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480365331] [2024-10-14 03:30:34,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:34,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:34,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:34,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:34,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:34,852 INFO L87 Difference]: Start difference. First operand 638 states and 965 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:34,898 INFO L93 Difference]: Finished difference Result 1730 states and 2615 transitions. [2024-10-14 03:30:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:34,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-14 03:30:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:34,905 INFO L225 Difference]: With dead ends: 1730 [2024-10-14 03:30:34,906 INFO L226 Difference]: Without dead ends: 1120 [2024-10-14 03:30:34,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:34,908 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:34,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 232 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-10-14 03:30:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1118. [2024-10-14 03:30:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1117 states have (on average 1.487018800358102) internal successors, (1661), 1117 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1661 transitions. [2024-10-14 03:30:34,944 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1661 transitions. Word has length 52 [2024-10-14 03:30:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:34,945 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1661 transitions. [2024-10-14 03:30:34,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1661 transitions. [2024-10-14 03:30:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:30:34,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:34,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:34,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:30:34,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:34,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 716454880, now seen corresponding path program 1 times [2024-10-14 03:30:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200021813] [2024-10-14 03:30:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:35,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:35,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200021813] [2024-10-14 03:30:35,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200021813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:35,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:35,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:35,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526836131] [2024-10-14 03:30:35,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:35,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:35,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:35,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:35,025 INFO L87 Difference]: Start difference. First operand 1118 states and 1661 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:35,097 INFO L93 Difference]: Finished difference Result 2197 states and 3299 transitions. [2024-10-14 03:30:35,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:35,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 03:30:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:35,104 INFO L225 Difference]: With dead ends: 2197 [2024-10-14 03:30:35,105 INFO L226 Difference]: Without dead ends: 1586 [2024-10-14 03:30:35,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:35,106 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:35,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 243 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-10-14 03:30:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1584. [2024-10-14 03:30:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 1.4801010739102969) internal successors, (2343), 1583 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2343 transitions. [2024-10-14 03:30:35,162 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2343 transitions. Word has length 53 [2024-10-14 03:30:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:35,162 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2343 transitions. [2024-10-14 03:30:35,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2343 transitions. [2024-10-14 03:30:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:35,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:35,164 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:35,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:30:35,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:35,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:35,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1948917228, now seen corresponding path program 1 times [2024-10-14 03:30:35,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:35,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355429977] [2024-10-14 03:30:35,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:35,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 03:30:35,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:35,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355429977] [2024-10-14 03:30:35,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355429977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:35,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:35,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:35,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107106476] [2024-10-14 03:30:35,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:35,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:35,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:35,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:35,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:35,344 INFO L87 Difference]: Start difference. First operand 1584 states and 2343 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:35,506 INFO L93 Difference]: Finished difference Result 4466 states and 6712 transitions. [2024-10-14 03:30:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:35,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-14 03:30:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:35,520 INFO L225 Difference]: With dead ends: 4466 [2024-10-14 03:30:35,521 INFO L226 Difference]: Without dead ends: 3680 [2024-10-14 03:30:35,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:35,524 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 509 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:35,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 590 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2024-10-14 03:30:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2352. [2024-10-14 03:30:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2351 states have (on average 1.4814972352190556) internal successors, (3483), 2351 states have internal predecessors, (3483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3483 transitions. [2024-10-14 03:30:35,652 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3483 transitions. Word has length 74 [2024-10-14 03:30:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:35,652 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3483 transitions. [2024-10-14 03:30:35,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3483 transitions. [2024-10-14 03:30:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:35,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:35,655 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:35,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:30:35,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:35,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:35,656 INFO L85 PathProgramCache]: Analyzing trace with hash 937622475, now seen corresponding path program 1 times [2024-10-14 03:30:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:35,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856190859] [2024-10-14 03:30:35,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:35,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:30:35,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:35,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856190859] [2024-10-14 03:30:35,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856190859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:35,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:35,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:35,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719678775] [2024-10-14 03:30:35,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:35,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:35,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:35,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:35,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:35,808 INFO L87 Difference]: Start difference. First operand 2352 states and 3483 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:35,981 INFO L93 Difference]: Finished difference Result 5234 states and 7852 transitions. [2024-10-14 03:30:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:35,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-14 03:30:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:35,998 INFO L225 Difference]: With dead ends: 5234 [2024-10-14 03:30:35,998 INFO L226 Difference]: Without dead ends: 4448 [2024-10-14 03:30:36,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:36,002 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 501 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:36,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 597 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2024-10-14 03:30:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 3120. [2024-10-14 03:30:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 3119 states have (on average 1.482205835203591) internal successors, (4623), 3119 states have internal predecessors, (4623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 4623 transitions. [2024-10-14 03:30:36,136 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 4623 transitions. Word has length 74 [2024-10-14 03:30:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:36,136 INFO L471 AbstractCegarLoop]: Abstraction has 3120 states and 4623 transitions. [2024-10-14 03:30:36,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 4623 transitions. [2024-10-14 03:30:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:36,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:36,139 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:36,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:30:36,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:36,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash 855386221, now seen corresponding path program 1 times [2024-10-14 03:30:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436490080] [2024-10-14 03:30:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:30:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:36,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436490080] [2024-10-14 03:30:36,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436490080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123838685] [2024-10-14 03:30:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:36,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:36,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:36,301 INFO L87 Difference]: Start difference. First operand 3120 states and 4623 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:36,458 INFO L93 Difference]: Finished difference Result 6002 states and 8992 transitions. [2024-10-14 03:30:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-14 03:30:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:36,476 INFO L225 Difference]: With dead ends: 6002 [2024-10-14 03:30:36,476 INFO L226 Difference]: Without dead ends: 5216 [2024-10-14 03:30:36,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:36,482 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 467 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:36,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 649 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2024-10-14 03:30:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 3888. [2024-10-14 03:30:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 3887 states have (on average 1.4826344224337535) internal successors, (5763), 3887 states have internal predecessors, (5763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 5763 transitions. [2024-10-14 03:30:36,645 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 5763 transitions. Word has length 74 [2024-10-14 03:30:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:36,645 INFO L471 AbstractCegarLoop]: Abstraction has 3888 states and 5763 transitions. [2024-10-14 03:30:36,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 5763 transitions. [2024-10-14 03:30:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:30:36,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:36,648 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:36,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:30:36,648 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:36,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash 933398655, now seen corresponding path program 1 times [2024-10-14 03:30:36,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:36,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968846110] [2024-10-14 03:30:36,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:36,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:36,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968846110] [2024-10-14 03:30:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968846110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:36,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:36,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768276521] [2024-10-14 03:30:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:36,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:36,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:36,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:36,751 INFO L87 Difference]: Start difference. First operand 3888 states and 5763 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:36,834 INFO L93 Difference]: Finished difference Result 7748 states and 11497 transitions. [2024-10-14 03:30:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:36,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-14 03:30:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:36,848 INFO L225 Difference]: With dead ends: 7748 [2024-10-14 03:30:36,848 INFO L226 Difference]: Without dead ends: 3890 [2024-10-14 03:30:36,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:36,855 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 53 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:36,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 230 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2024-10-14 03:30:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3888. [2024-10-14 03:30:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 3887 states have (on average 1.467198353485979) internal successors, (5703), 3887 states have internal predecessors, (5703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 5703 transitions. [2024-10-14 03:30:36,971 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 5703 transitions. Word has length 75 [2024-10-14 03:30:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:36,971 INFO L471 AbstractCegarLoop]: Abstraction has 3888 states and 5703 transitions. [2024-10-14 03:30:36,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 5703 transitions. [2024-10-14 03:30:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:30:36,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:36,973 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:36,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:30:36,974 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:36,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1238213344, now seen corresponding path program 1 times [2024-10-14 03:30:36,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:36,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810759081] [2024-10-14 03:30:36,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810759081] [2024-10-14 03:30:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810759081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:37,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703305057] [2024-10-14 03:30:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:37,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:37,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:37,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:37,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:37,097 INFO L87 Difference]: Start difference. First operand 3888 states and 5703 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:37,157 INFO L93 Difference]: Finished difference Result 5820 states and 8541 transitions. [2024-10-14 03:30:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:37,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-14 03:30:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:37,165 INFO L225 Difference]: With dead ends: 5820 [2024-10-14 03:30:37,165 INFO L226 Difference]: Without dead ends: 1962 [2024-10-14 03:30:37,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:37,170 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:37,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-10-14 03:30:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1960. [2024-10-14 03:30:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 1.4481878509443593) internal successors, (2837), 1959 states have internal predecessors, (2837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2837 transitions. [2024-10-14 03:30:37,226 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2837 transitions. Word has length 75 [2024-10-14 03:30:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:37,227 INFO L471 AbstractCegarLoop]: Abstraction has 1960 states and 2837 transitions. [2024-10-14 03:30:37,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2837 transitions. [2024-10-14 03:30:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:30:37,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:37,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:37,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:30:37,228 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:37,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:37,229 INFO L85 PathProgramCache]: Analyzing trace with hash 713908929, now seen corresponding path program 1 times [2024-10-14 03:30:37,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:37,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453789223] [2024-10-14 03:30:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453789223] [2024-10-14 03:30:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453789223] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:30:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266327666] [2024-10-14 03:30:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:39,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:30:39,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:30:39,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:30:39,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:30:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:39,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 03:30:39,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:30:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:40,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:30:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266327666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:30:41,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:30:41,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2024-10-14 03:30:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724734111] [2024-10-14 03:30:41,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:30:41,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 03:30:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:41,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 03:30:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:30:41,170 INFO L87 Difference]: Start difference. First operand 1960 states and 2837 transitions. Second operand has 27 states, 27 states have (on average 8.037037037037036) internal successors, (217), 27 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:01,838 INFO L93 Difference]: Finished difference Result 23434 states and 33123 transitions. [2024-10-14 03:31:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2024-10-14 03:31:01,839 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.037037037037036) internal successors, (217), 27 states have internal predecessors, (217), 0 states have call successors, (0), 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 75 [2024-10-14 03:31:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:01,894 INFO L225 Difference]: With dead ends: 23434 [2024-10-14 03:31:01,894 INFO L226 Difference]: Without dead ends: 21504 [2024-10-14 03:31:01,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19533 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=6652, Invalid=39358, Unknown=0, NotChecked=0, Total=46010 [2024-10-14 03:31:01,911 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 6746 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6746 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:01,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6746 Valid, 1204 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 03:31:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21504 states. [2024-10-14 03:31:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21504 to 15146. [2024-10-14 03:31:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15146 states, 15145 states have (on average 1.4001320567844173) internal successors, (21205), 15145 states have internal predecessors, (21205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15146 states to 15146 states and 21205 transitions. [2024-10-14 03:31:02,742 INFO L78 Accepts]: Start accepts. Automaton has 15146 states and 21205 transitions. Word has length 75 [2024-10-14 03:31:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:02,742 INFO L471 AbstractCegarLoop]: Abstraction has 15146 states and 21205 transitions. [2024-10-14 03:31:02,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.037037037037036) internal successors, (217), 27 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 15146 states and 21205 transitions. [2024-10-14 03:31:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:31:02,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:02,744 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:02,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 03:31:02,945 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,SelfDestructingSolverStorable14 [2024-10-14 03:31:02,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:02,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2131820310, now seen corresponding path program 1 times [2024-10-14 03:31:02,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:02,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623455123] [2024-10-14 03:31:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:02,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:31:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623455123] [2024-10-14 03:31:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623455123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:31:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833054171] [2024-10-14 03:31:03,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:03,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:31:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:03,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:31:03,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:31:03,075 INFO L87 Difference]: Start difference. First operand 15146 states and 21205 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:03,880 INFO L93 Difference]: Finished difference Result 27463 states and 38851 transitions. [2024-10-14 03:31:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:31:03,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-14 03:31:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:03,926 INFO L225 Difference]: With dead ends: 27463 [2024-10-14 03:31:03,927 INFO L226 Difference]: Without dead ends: 24364 [2024-10-14 03:31:03,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:31:03,935 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 450 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:03,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 761 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:31:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24364 states. [2024-10-14 03:31:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24364 to 18151. [2024-10-14 03:31:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18151 states, 18150 states have (on average 1.3988429752066116) internal successors, (25389), 18150 states have internal predecessors, (25389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18151 states to 18151 states and 25389 transitions. [2024-10-14 03:31:04,703 INFO L78 Accepts]: Start accepts. Automaton has 18151 states and 25389 transitions. Word has length 76 [2024-10-14 03:31:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:04,703 INFO L471 AbstractCegarLoop]: Abstraction has 18151 states and 25389 transitions. [2024-10-14 03:31:04,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 18151 states and 25389 transitions. [2024-10-14 03:31:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:31:04,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:04,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:04,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:31:04,707 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:04,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1272060996, now seen corresponding path program 1 times [2024-10-14 03:31:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:04,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491134369] [2024-10-14 03:31:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:05,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:05,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491134369] [2024-10-14 03:31:05,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491134369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:31:05,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063562515] [2024-10-14 03:31:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:05,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:31:05,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:31:05,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:31:05,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:31:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:05,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 03:31:05,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:31:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:06,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:31:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063562515] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:31:07,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:31:07,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-14 03:31:07,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72107339] [2024-10-14 03:31:07,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:31:07,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:31:07,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:07,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:31:07,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:31:07,260 INFO L87 Difference]: Start difference. First operand 18151 states and 25389 transitions. Second operand has 29 states, 29 states have (on average 7.344827586206897) internal successors, (213), 28 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:16,953 INFO L93 Difference]: Finished difference Result 188111 states and 266319 transitions. [2024-10-14 03:31:16,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2024-10-14 03:31:16,954 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.344827586206897) internal successors, (213), 28 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:31:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:17,465 INFO L225 Difference]: With dead ends: 188111 [2024-10-14 03:31:17,466 INFO L226 Difference]: Without dead ends: 170161 [2024-10-14 03:31:17,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9435 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4259, Invalid=21823, Unknown=0, NotChecked=0, Total=26082 [2024-10-14 03:31:17,558 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 6226 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6226 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:17,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6226 Valid, 2490 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:31:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170161 states. [2024-10-14 03:31:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170161 to 49830. [2024-10-14 03:31:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49830 states, 49829 states have (on average 1.3894117883160408) internal successors, (69233), 49829 states have internal predecessors, (69233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49830 states to 49830 states and 69233 transitions. [2024-10-14 03:31:20,394 INFO L78 Accepts]: Start accepts. Automaton has 49830 states and 69233 transitions. Word has length 79 [2024-10-14 03:31:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:20,394 INFO L471 AbstractCegarLoop]: Abstraction has 49830 states and 69233 transitions. [2024-10-14 03:31:20,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.344827586206897) internal successors, (213), 28 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 49830 states and 69233 transitions. [2024-10-14 03:31:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:31:20,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:20,397 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:20,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:31:20,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 03:31:20,598 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:20,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1205456060, now seen corresponding path program 1 times [2024-10-14 03:31:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:20,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497955321] [2024-10-14 03:31:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:20,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497955321] [2024-10-14 03:31:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497955321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:20,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:20,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:31:20,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479368533] [2024-10-14 03:31:20,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:20,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:31:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:20,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:31:20,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:20,664 INFO L87 Difference]: Start difference. First operand 49830 states and 69233 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:22,611 INFO L93 Difference]: Finished difference Result 122809 states and 170450 transitions. [2024-10-14 03:31:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:31:22,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:31:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:22,734 INFO L225 Difference]: With dead ends: 122809 [2024-10-14 03:31:22,734 INFO L226 Difference]: Without dead ends: 73152 [2024-10-14 03:31:22,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:22,776 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 49 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:22,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 250 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73152 states. [2024-10-14 03:31:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73152 to 54672. [2024-10-14 03:31:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54672 states, 54671 states have (on average 1.383969563388268) internal successors, (75663), 54671 states have internal predecessors, (75663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54672 states to 54672 states and 75663 transitions. [2024-10-14 03:31:25,231 INFO L78 Accepts]: Start accepts. Automaton has 54672 states and 75663 transitions. Word has length 79 [2024-10-14 03:31:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:25,231 INFO L471 AbstractCegarLoop]: Abstraction has 54672 states and 75663 transitions. [2024-10-14 03:31:25,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 54672 states and 75663 transitions. [2024-10-14 03:31:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:31:25,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:25,234 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:25,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:31:25,234 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:25,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash 471651673, now seen corresponding path program 1 times [2024-10-14 03:31:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:25,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629532888] [2024-10-14 03:31:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:25,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:25,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629532888] [2024-10-14 03:31:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629532888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:31:25,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331595517] [2024-10-14 03:31:25,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:25,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:31:25,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:31:25,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:31:25,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:31:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:25,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 03:31:25,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:31:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:26,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:31:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:28,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331595517] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:31:28,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:31:28,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-14 03:31:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501971619] [2024-10-14 03:31:28,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:31:28,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:31:28,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:28,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:31:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:31:28,106 INFO L87 Difference]: Start difference. First operand 54672 states and 75663 transitions. Second operand has 29 states, 29 states have (on average 7.758620689655173) internal successors, (225), 28 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)