./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.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 5692c849f4d89bdffd108b63efd7f8fc3dfb9eaa92d6e9ffe082f62ca54e1100 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:35:07,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:35:07,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:35:07,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:35:07,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:35:07,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:35:07,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:35:07,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:35:07,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:35:07,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:35:07,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:35:07,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:35:07,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:35:07,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:35:07,116 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:35:07,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:35:07,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:35:07,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:35:07,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:35:07,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:35:07,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:35:07,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:35:07,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:35:07,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:35:07,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:35:07,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:35:07,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:35:07,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:35:07,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:35:07,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:35:07,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:35:07,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:35:07,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:35:07,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:35:07,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:35:07,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:35:07,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:35:07,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:35:07,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:35:07,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:35:07,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:35:07,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:35:07,124 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 -> 5692c849f4d89bdffd108b63efd7f8fc3dfb9eaa92d6e9ffe082f62ca54e1100 [2024-11-09 23:35:07,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:35:07,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:35:07,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:35:07,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:35:07,388 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:35:07,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2024-11-09 23:35:08,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:35:08,889 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:35:08,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2024-11-09 23:35:08,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ff0a697/059e28884ab2489bbf711508f7822177/FLAG92a8457bb [2024-11-09 23:35:08,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ff0a697/059e28884ab2489bbf711508f7822177 [2024-11-09 23:35:08,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:35:08,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:35:08,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:35:08,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:35:08,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:35:08,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:35:08" (1/1) ... [2024-11-09 23:35:08,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1817912f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:08, skipping insertion in model container [2024-11-09 23:35:08,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:35:08" (1/1) ... [2024-11-09 23:35:08,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:35:09,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c[16964,16977] [2024-11-09 23:35:09,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:35:09,216 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:35:09,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c[16964,16977] [2024-11-09 23:35:09,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:35:09,323 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:35:09,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09 WrapperNode [2024-11-09 23:35:09,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:35:09,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:35:09,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:35:09,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:35:09,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,381 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 452 [2024-11-09 23:35:09,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:35:09,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:35:09,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:35:09,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:35:09,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,431 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 23:35:09,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:35:09,445 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:35:09,445 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:35:09,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:35:09,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (1/1) ... [2024-11-09 23:35:09,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:35:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:35:09,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:35:09,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:35:09,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:35:09,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:35:09,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:35:09,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:35:09,607 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:35:09,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:35:10,069 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-09 23:35:10,070 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:35:10,088 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:35:10,088 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:35:10,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:35:10 BoogieIcfgContainer [2024-11-09 23:35:10,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:35:10,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:35:10,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:35:10,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:35:10,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:35:08" (1/3) ... [2024-11-09 23:35:10,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1141e80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:35:10, skipping insertion in model container [2024-11-09 23:35:10,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:35:09" (2/3) ... [2024-11-09 23:35:10,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1141e80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:35:10, skipping insertion in model container [2024-11-09 23:35:10,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:35:10" (3/3) ... [2024-11-09 23:35:10,099 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2024-11-09 23:35:10,114 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:35:10,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:35:10,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:35:10,171 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;@68a62a26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:35:10,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:35:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 125 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:35:10,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:10,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:10,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:10,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash -769910749, now seen corresponding path program 1 times [2024-11-09 23:35:10,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931190696] [2024-11-09 23:35:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:10,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:10,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931190696] [2024-11-09 23:35:10,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931190696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:10,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:10,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:35:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019940086] [2024-11-09 23:35:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:10,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:35:10,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:10,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:35:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:35:10,556 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 125 states have internal predecessors, (216), 0 states have call successors, (0), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:10,586 INFO L93 Difference]: Finished difference Result 201 states and 340 transitions. [2024-11-09 23:35:10,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:35:10,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-09 23:35:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:10,600 INFO L225 Difference]: With dead ends: 201 [2024-11-09 23:35:10,601 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 23:35:10,604 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-11-09 23:35:10,608 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:10,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 23:35:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 23:35:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.7333333333333334) internal successors, (208), 120 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 208 transitions. [2024-11-09 23:35:10,648 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 208 transitions. Word has length 39 [2024-11-09 23:35:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:10,648 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 208 transitions. [2024-11-09 23:35:10,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 208 transitions. [2024-11-09 23:35:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:35:10,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:10,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:10,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:35:10,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:10,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash 255581250, now seen corresponding path program 1 times [2024-11-09 23:35:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:10,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492824305] [2024-11-09 23:35:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:10,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:10,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492824305] [2024-11-09 23:35:10,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492824305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:10,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:10,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:35:10,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44708265] [2024-11-09 23:35:10,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:10,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:35:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:10,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:35:10,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:35:10,825 INFO L87 Difference]: Start difference. First operand 121 states and 208 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:10,915 INFO L93 Difference]: Finished difference Result 199 states and 332 transitions. [2024-11-09 23:35:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:35:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-09 23:35:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:10,917 INFO L225 Difference]: With dead ends: 199 [2024-11-09 23:35:10,917 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 23:35:10,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:35:10,918 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:10,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 778 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:35:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 23:35:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 23:35:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 167 transitions. [2024-11-09 23:35:10,925 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 167 transitions. Word has length 39 [2024-11-09 23:35:10,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:10,925 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 167 transitions. [2024-11-09 23:35:10,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 167 transitions. [2024-11-09 23:35:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:35:10,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:10,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:10,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:35:10,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:10,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1158671770, now seen corresponding path program 1 times [2024-11-09 23:35:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879591549] [2024-11-09 23:35:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:11,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:11,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879591549] [2024-11-09 23:35:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879591549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77959725] [2024-11-09 23:35:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:11,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:11,088 INFO L87 Difference]: Start difference. First operand 121 states and 167 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:11,115 INFO L93 Difference]: Finished difference Result 261 states and 393 transitions. [2024-11-09 23:35:11,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:11,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:35:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:11,117 INFO L225 Difference]: With dead ends: 261 [2024-11-09 23:35:11,117 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 23:35:11,118 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-11-09 23:35:11,118 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 103 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:11,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 369 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 23:35:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-11-09 23:35:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.4754098360655739) internal successors, (270), 183 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 270 transitions. [2024-11-09 23:35:11,127 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 270 transitions. Word has length 79 [2024-11-09 23:35:11,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:11,127 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 270 transitions. [2024-11-09 23:35:11,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 270 transitions. [2024-11-09 23:35:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:35:11,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:11,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:11,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:35:11,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:11,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1261937651, now seen corresponding path program 1 times [2024-11-09 23:35:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:11,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625805288] [2024-11-09 23:35:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:11,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:11,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:11,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625805288] [2024-11-09 23:35:11,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625805288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:11,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:11,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443796971] [2024-11-09 23:35:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:11,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:11,233 INFO L87 Difference]: Start difference. First operand 184 states and 270 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:11,259 INFO L93 Difference]: Finished difference Result 442 states and 688 transitions. [2024-11-09 23:35:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:11,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:35:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:11,263 INFO L225 Difference]: With dead ends: 442 [2024-11-09 23:35:11,263 INFO L226 Difference]: Without dead ends: 305 [2024-11-09 23:35:11,263 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-11-09 23:35:11,264 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 99 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:11,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 366 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-09 23:35:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2024-11-09 23:35:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.5315614617940199) internal successors, (461), 301 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 461 transitions. [2024-11-09 23:35:11,279 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 461 transitions. Word has length 79 [2024-11-09 23:35:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:11,280 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 461 transitions. [2024-11-09 23:35:11,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 461 transitions. [2024-11-09 23:35:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:35:11,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:11,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:11,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:35:11,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:11,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash 235404288, now seen corresponding path program 1 times [2024-11-09 23:35:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:11,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263885256] [2024-11-09 23:35:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263885256] [2024-11-09 23:35:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263885256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:11,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:11,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914410679] [2024-11-09 23:35:11,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:11,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:11,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:11,392 INFO L87 Difference]: Start difference. First operand 302 states and 461 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:11,417 INFO L93 Difference]: Finished difference Result 780 states and 1233 transitions. [2024-11-09 23:35:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:35:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:11,419 INFO L225 Difference]: With dead ends: 780 [2024-11-09 23:35:11,420 INFO L226 Difference]: Without dead ends: 525 [2024-11-09 23:35:11,421 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-11-09 23:35:11,425 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 95 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:11,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 363 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-09 23:35:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 522. [2024-11-09 23:35:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.5604606525911708) internal successors, (813), 521 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 813 transitions. [2024-11-09 23:35:11,467 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 813 transitions. Word has length 79 [2024-11-09 23:35:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:11,468 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 813 transitions. [2024-11-09 23:35:11,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 813 transitions. [2024-11-09 23:35:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:35:11,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:11,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:11,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:35:11,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:11,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1797492083, now seen corresponding path program 1 times [2024-11-09 23:35:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395672493] [2024-11-09 23:35:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:11,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395672493] [2024-11-09 23:35:11,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395672493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:11,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:11,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822126268] [2024-11-09 23:35:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:11,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:11,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:11,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:11,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:11,610 INFO L87 Difference]: Start difference. First operand 522 states and 813 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:11,639 INFO L93 Difference]: Finished difference Result 1408 states and 2233 transitions. [2024-11-09 23:35:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:11,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:35:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:11,647 INFO L225 Difference]: With dead ends: 1408 [2024-11-09 23:35:11,647 INFO L226 Difference]: Without dead ends: 933 [2024-11-09 23:35:11,649 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-11-09 23:35:11,650 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 91 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:11,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-09 23:35:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 930. [2024-11-09 23:35:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 1.5683530678148547) internal successors, (1457), 929 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1457 transitions. [2024-11-09 23:35:11,698 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1457 transitions. Word has length 79 [2024-11-09 23:35:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:11,699 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1457 transitions. [2024-11-09 23:35:11,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1457 transitions. [2024-11-09 23:35:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:35:11,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:11,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:11,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:35:11,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:11,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash -825241498, now seen corresponding path program 1 times [2024-11-09 23:35:11,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:11,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349870853] [2024-11-09 23:35:11,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:11,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:11,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349870853] [2024-11-09 23:35:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349870853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:11,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:11,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626572491] [2024-11-09 23:35:11,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:11,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:11,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:11,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:11,915 INFO L87 Difference]: Start difference. First operand 930 states and 1457 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:12,146 INFO L93 Difference]: Finished difference Result 7111 states and 11327 transitions. [2024-11-09 23:35:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:35:12,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:35:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:12,165 INFO L225 Difference]: With dead ends: 7111 [2024-11-09 23:35:12,165 INFO L226 Difference]: Without dead ends: 6228 [2024-11-09 23:35:12,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:35:12,170 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1893 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1893 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:12,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1893 Valid, 1899 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:35:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6228 states. [2024-11-09 23:35:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6228 to 1810. [2024-11-09 23:35:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 1.5660585959093423) internal successors, (2833), 1809 states have internal predecessors, (2833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2833 transitions. [2024-11-09 23:35:12,251 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2833 transitions. Word has length 79 [2024-11-09 23:35:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:12,252 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2833 transitions. [2024-11-09 23:35:12,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2833 transitions. [2024-11-09 23:35:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:35:12,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:12,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:12,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:35:12,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:12,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:12,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1105357792, now seen corresponding path program 1 times [2024-11-09 23:35:12,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:12,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635287972] [2024-11-09 23:35:12,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:12,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:12,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:12,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635287972] [2024-11-09 23:35:12,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635287972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:12,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:12,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:35:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976240992] [2024-11-09 23:35:12,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:12,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:35:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:35:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:35:12,500 INFO L87 Difference]: Start difference. First operand 1810 states and 2833 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:12,537 INFO L93 Difference]: Finished difference Result 1909 states and 2963 transitions. [2024-11-09 23:35:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:35:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-09 23:35:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:12,543 INFO L225 Difference]: With dead ends: 1909 [2024-11-09 23:35:12,543 INFO L226 Difference]: Without dead ends: 1906 [2024-11-09 23:35:12,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:35:12,546 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:12,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 648 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2024-11-09 23:35:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1906. [2024-11-09 23:35:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1905 states have (on average 1.5375328083989501) internal successors, (2929), 1905 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2929 transitions. [2024-11-09 23:35:12,589 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2929 transitions. Word has length 80 [2024-11-09 23:35:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:12,589 INFO L471 AbstractCegarLoop]: Abstraction has 1906 states and 2929 transitions. [2024-11-09 23:35:12,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2929 transitions. [2024-11-09 23:35:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 23:35:12,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:12,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:12,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:35:12,590 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:12,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1638307994, now seen corresponding path program 1 times [2024-11-09 23:35:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911365058] [2024-11-09 23:35:12,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:12,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:12,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911365058] [2024-11-09 23:35:12,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911365058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:12,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:12,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257083856] [2024-11-09 23:35:12,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:12,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:12,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:12,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:12,681 INFO L87 Difference]: Start difference. First operand 1906 states and 2929 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:12,744 INFO L93 Difference]: Finished difference Result 5384 states and 8293 transitions. [2024-11-09 23:35:12,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:12,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-09 23:35:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:12,754 INFO L225 Difference]: With dead ends: 5384 [2024-11-09 23:35:12,755 INFO L226 Difference]: Without dead ends: 3525 [2024-11-09 23:35:12,759 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-11-09 23:35:12,761 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 79 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:12,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 279 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2024-11-09 23:35:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3490. [2024-11-09 23:35:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3489 states have (on average 1.5227858985382632) internal successors, (5313), 3489 states have internal predecessors, (5313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5313 transitions. [2024-11-09 23:35:12,863 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5313 transitions. Word has length 81 [2024-11-09 23:35:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:12,863 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 5313 transitions. [2024-11-09 23:35:12,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5313 transitions. [2024-11-09 23:35:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 23:35:12,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:12,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:12,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:35:12,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:12,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1508183117, now seen corresponding path program 1 times [2024-11-09 23:35:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:12,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122123379] [2024-11-09 23:35:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:12,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122123379] [2024-11-09 23:35:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122123379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:12,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:12,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919863417] [2024-11-09 23:35:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:12,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:12,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:12,922 INFO L87 Difference]: Start difference. First operand 3490 states and 5313 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:13,000 INFO L93 Difference]: Finished difference Result 9864 states and 14949 transitions. [2024-11-09 23:35:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:13,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-09 23:35:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:13,018 INFO L225 Difference]: With dead ends: 9864 [2024-11-09 23:35:13,019 INFO L226 Difference]: Without dead ends: 6421 [2024-11-09 23:35:13,023 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-11-09 23:35:13,024 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 87 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:13,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6421 states. [2024-11-09 23:35:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6421 to 6418. [2024-11-09 23:35:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6418 states, 6417 states have (on average 1.4986753934860526) internal successors, (9617), 6417 states have internal predecessors, (9617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6418 states to 6418 states and 9617 transitions. [2024-11-09 23:35:13,208 INFO L78 Accepts]: Start accepts. Automaton has 6418 states and 9617 transitions. Word has length 82 [2024-11-09 23:35:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:13,208 INFO L471 AbstractCegarLoop]: Abstraction has 6418 states and 9617 transitions. [2024-11-09 23:35:13,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6418 states and 9617 transitions. [2024-11-09 23:35:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 23:35:13,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:13,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:13,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:35:13,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:13,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:13,213 INFO L85 PathProgramCache]: Analyzing trace with hash -631118960, now seen corresponding path program 1 times [2024-11-09 23:35:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:13,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960095619] [2024-11-09 23:35:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:13,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:13,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960095619] [2024-11-09 23:35:13,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960095619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:13,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:13,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:13,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712969486] [2024-11-09 23:35:13,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:13,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:13,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:13,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:13,273 INFO L87 Difference]: Start difference. First operand 6418 states and 9617 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:13,381 INFO L93 Difference]: Finished difference Result 12700 states and 19098 transitions. [2024-11-09 23:35:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-09 23:35:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:13,415 INFO L225 Difference]: With dead ends: 12700 [2024-11-09 23:35:13,415 INFO L226 Difference]: Without dead ends: 9240 [2024-11-09 23:35:13,421 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-11-09 23:35:13,422 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 104 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:13,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 379 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9240 states. [2024-11-09 23:35:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9240 to 9237. [2024-11-09 23:35:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9237 states, 9236 states have (on average 1.4885231702035513) internal successors, (13748), 9236 states have internal predecessors, (13748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9237 states to 9237 states and 13748 transitions. [2024-11-09 23:35:13,634 INFO L78 Accepts]: Start accepts. Automaton has 9237 states and 13748 transitions. Word has length 83 [2024-11-09 23:35:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:13,635 INFO L471 AbstractCegarLoop]: Abstraction has 9237 states and 13748 transitions. [2024-11-09 23:35:13,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 9237 states and 13748 transitions. [2024-11-09 23:35:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:35:13,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:13,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:13,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:35:13,641 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:13,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash 670903923, now seen corresponding path program 1 times [2024-11-09 23:35:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761604833] [2024-11-09 23:35:13,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:35:13,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:13,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761604833] [2024-11-09 23:35:13,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761604833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:13,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:13,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425346719] [2024-11-09 23:35:13,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:13,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:13,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:13,848 INFO L87 Difference]: Start difference. First operand 9237 states and 13748 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:14,273 INFO L93 Difference]: Finished difference Result 35498 states and 53362 transitions. [2024-11-09 23:35:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:35:14,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 114 [2024-11-09 23:35:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:14,331 INFO L225 Difference]: With dead ends: 35498 [2024-11-09 23:35:14,332 INFO L226 Difference]: Without dead ends: 30855 [2024-11-09 23:35:14,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:35:14,344 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1235 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:14,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 1811 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:35:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30855 states. [2024-11-09 23:35:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30855 to 13781. [2024-11-09 23:35:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13781 states, 13780 states have (on average 1.4888243831640058) internal successors, (20516), 13780 states have internal predecessors, (20516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13781 states to 13781 states and 20516 transitions. [2024-11-09 23:35:14,898 INFO L78 Accepts]: Start accepts. Automaton has 13781 states and 20516 transitions. Word has length 114 [2024-11-09 23:35:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:14,898 INFO L471 AbstractCegarLoop]: Abstraction has 13781 states and 20516 transitions. [2024-11-09 23:35:14,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 13781 states and 20516 transitions. [2024-11-09 23:35:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:35:14,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:14,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:14,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:35:14,904 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:14,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1636370759, now seen corresponding path program 1 times [2024-11-09 23:35:14,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:14,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414621196] [2024-11-09 23:35:14,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:14,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:35:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414621196] [2024-11-09 23:35:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414621196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:15,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:15,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:15,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113538676] [2024-11-09 23:35:15,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:15,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:15,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:15,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:15,063 INFO L87 Difference]: Start difference. First operand 13781 states and 20516 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:15,587 INFO L93 Difference]: Finished difference Result 40042 states and 60130 transitions. [2024-11-09 23:35:15,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:35:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 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 114 [2024-11-09 23:35:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:15,639 INFO L225 Difference]: With dead ends: 40042 [2024-11-09 23:35:15,639 INFO L226 Difference]: Without dead ends: 35399 [2024-11-09 23:35:15,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:35:15,651 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 1274 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:15,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1637 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:35:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35399 states. [2024-11-09 23:35:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35399 to 18325. [2024-11-09 23:35:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18325 states, 18324 states have (on average 1.488976206068544) internal successors, (27284), 18324 states have internal predecessors, (27284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18325 states to 18325 states and 27284 transitions. [2024-11-09 23:35:16,257 INFO L78 Accepts]: Start accepts. Automaton has 18325 states and 27284 transitions. Word has length 114 [2024-11-09 23:35:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:16,258 INFO L471 AbstractCegarLoop]: Abstraction has 18325 states and 27284 transitions. [2024-11-09 23:35:16,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 18325 states and 27284 transitions. [2024-11-09 23:35:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:35:16,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:16,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:16,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:35:16,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:16,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:16,273 INFO L85 PathProgramCache]: Analyzing trace with hash 926641691, now seen corresponding path program 1 times [2024-11-09 23:35:16,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:16,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229080454] [2024-11-09 23:35:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:16,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:35:16,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:16,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229080454] [2024-11-09 23:35:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229080454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:16,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:16,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929252145] [2024-11-09 23:35:16,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:16,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:16,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:16,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:16,497 INFO L87 Difference]: Start difference. First operand 18325 states and 27284 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:17,167 INFO L93 Difference]: Finished difference Result 44586 states and 66898 transitions. [2024-11-09 23:35:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:35:17,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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 114 [2024-11-09 23:35:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:17,241 INFO L225 Difference]: With dead ends: 44586 [2024-11-09 23:35:17,241 INFO L226 Difference]: Without dead ends: 39943 [2024-11-09 23:35:17,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:35:17,263 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1337 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:17,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 1591 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:35:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39943 states. [2024-11-09 23:35:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39943 to 22869. [2024-11-09 23:35:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22869 states, 22868 states have (on average 1.4890676928458981) internal successors, (34052), 22868 states have internal predecessors, (34052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22869 states to 22869 states and 34052 transitions. [2024-11-09 23:35:17,854 INFO L78 Accepts]: Start accepts. Automaton has 22869 states and 34052 transitions. Word has length 114 [2024-11-09 23:35:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:17,855 INFO L471 AbstractCegarLoop]: Abstraction has 22869 states and 34052 transitions. [2024-11-09 23:35:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22869 states and 34052 transitions. [2024-11-09 23:35:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:35:17,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:17,863 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:17,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:35:17,864 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:17,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:17,864 INFO L85 PathProgramCache]: Analyzing trace with hash 99179759, now seen corresponding path program 1 times [2024-11-09 23:35:17,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:17,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125202823] [2024-11-09 23:35:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:17,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 23:35:18,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:18,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125202823] [2024-11-09 23:35:18,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125202823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:18,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:18,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:18,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833262858] [2024-11-09 23:35:18,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:18,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:18,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:18,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:18,043 INFO L87 Difference]: Start difference. First operand 22869 states and 34052 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:18,779 INFO L93 Difference]: Finished difference Result 49130 states and 73666 transitions. [2024-11-09 23:35:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:35:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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 114 [2024-11-09 23:35:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:18,846 INFO L225 Difference]: With dead ends: 49130 [2024-11-09 23:35:18,846 INFO L226 Difference]: Without dead ends: 44487 [2024-11-09 23:35:18,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:35:18,859 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1417 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:18,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 1602 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:35:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44487 states. [2024-11-09 23:35:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44487 to 27413. [2024-11-09 23:35:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27413 states, 27412 states have (on average 1.4891288486794105) internal successors, (40820), 27412 states have internal predecessors, (40820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27413 states to 27413 states and 40820 transitions. [2024-11-09 23:35:19,859 INFO L78 Accepts]: Start accepts. Automaton has 27413 states and 40820 transitions. Word has length 114 [2024-11-09 23:35:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:19,859 INFO L471 AbstractCegarLoop]: Abstraction has 27413 states and 40820 transitions. [2024-11-09 23:35:19,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 27413 states and 40820 transitions. [2024-11-09 23:35:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:35:19,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:19,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:19,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:35:19,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:19,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1469456720, now seen corresponding path program 1 times [2024-11-09 23:35:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624633035] [2024-11-09 23:35:19,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 23:35:20,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624633035] [2024-11-09 23:35:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624633035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:20,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359387239] [2024-11-09 23:35:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:20,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:20,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:20,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:20,043 INFO L87 Difference]: Start difference. First operand 27413 states and 40820 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:20,706 INFO L93 Difference]: Finished difference Result 53674 states and 80434 transitions. [2024-11-09 23:35:20,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:35:20,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 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 114 [2024-11-09 23:35:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:20,765 INFO L225 Difference]: With dead ends: 53674 [2024-11-09 23:35:20,765 INFO L226 Difference]: Without dead ends: 49031 [2024-11-09 23:35:20,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:35:20,784 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 1262 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:20,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1746 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:35:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49031 states. [2024-11-09 23:35:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49031 to 31957. [2024-11-09 23:35:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31957 states, 31956 states have (on average 1.4891726123419702) internal successors, (47588), 31956 states have internal predecessors, (47588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31957 states to 31957 states and 47588 transitions. [2024-11-09 23:35:21,631 INFO L78 Accepts]: Start accepts. Automaton has 31957 states and 47588 transitions. Word has length 114 [2024-11-09 23:35:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:21,632 INFO L471 AbstractCegarLoop]: Abstraction has 31957 states and 47588 transitions. [2024-11-09 23:35:21,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 31957 states and 47588 transitions. [2024-11-09 23:35:21,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:35:21,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:21,642 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:21,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:35:21,642 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:21,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1295230611, now seen corresponding path program 1 times [2024-11-09 23:35:21,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:21,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130716407] [2024-11-09 23:35:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:21,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:21,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:21,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130716407] [2024-11-09 23:35:21,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130716407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:21,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:21,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:21,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383811142] [2024-11-09 23:35:21,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:21,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:21,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:21,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:21,783 INFO L87 Difference]: Start difference. First operand 31957 states and 47588 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:22,393 INFO L93 Difference]: Finished difference Result 63867 states and 95128 transitions. [2024-11-09 23:35:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:22,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-09 23:35:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:22,433 INFO L225 Difference]: With dead ends: 63867 [2024-11-09 23:35:22,434 INFO L226 Difference]: Without dead ends: 31960 [2024-11-09 23:35:22,450 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-11-09 23:35:22,451 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 82 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:22,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 362 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31960 states. [2024-11-09 23:35:22,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31960 to 31957. [2024-11-09 23:35:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31957 states, 31956 states have (on average 1.4786581549630742) internal successors, (47252), 31956 states have internal predecessors, (47252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31957 states to 31957 states and 47252 transitions. [2024-11-09 23:35:23,062 INFO L78 Accepts]: Start accepts. Automaton has 31957 states and 47252 transitions. Word has length 115 [2024-11-09 23:35:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:23,062 INFO L471 AbstractCegarLoop]: Abstraction has 31957 states and 47252 transitions. [2024-11-09 23:35:23,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31957 states and 47252 transitions. [2024-11-09 23:35:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:35:23,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:23,068 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:23,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:35:23,069 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:23,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:23,069 INFO L85 PathProgramCache]: Analyzing trace with hash -713211168, now seen corresponding path program 1 times [2024-11-09 23:35:23,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:23,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354237380] [2024-11-09 23:35:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:23,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:24,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:24,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354237380] [2024-11-09 23:35:24,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354237380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:35:24,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135803353] [2024-11-09 23:35:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:24,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:35:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:35:24,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:35:24,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:35:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:24,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 23:35:24,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:35:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:24,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:35:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:25,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135803353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:35:25,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:35:25,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 8] total 23 [2024-11-09 23:35:25,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159105581] [2024-11-09 23:35:25,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:35:25,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 23:35:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:25,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 23:35:25,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:35:25,272 INFO L87 Difference]: Start difference. First operand 31957 states and 47252 transitions. Second operand has 23 states, 23 states have (on average 14.608695652173912) internal successors, (336), 23 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:40,977 INFO L93 Difference]: Finished difference Result 458970 states and 681450 transitions. [2024-11-09 23:35:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2024-11-09 23:35:40,978 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 14.608695652173912) internal successors, (336), 23 states have internal predecessors, (336), 0 states have call successors, (0), 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 115 [2024-11-09 23:35:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:41,773 INFO L225 Difference]: With dead ends: 458970 [2024-11-09 23:35:41,773 INFO L226 Difference]: Without dead ends: 437015 [2024-11-09 23:35:41,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18238 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=5305, Invalid=38167, Unknown=0, NotChecked=0, Total=43472 [2024-11-09 23:35:41,875 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 10708 mSDsluCounter, 3805 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10708 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:41,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10708 Valid, 4116 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 23:35:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437015 states. [2024-11-09 23:35:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437015 to 289061. [2024-11-09 23:35:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289061 states, 289060 states have (on average 1.4560160520307204) internal successors, (420876), 289060 states have internal predecessors, (420876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289061 states to 289061 states and 420876 transitions. [2024-11-09 23:35:51,328 INFO L78 Accepts]: Start accepts. Automaton has 289061 states and 420876 transitions. Word has length 115 [2024-11-09 23:35:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:51,329 INFO L471 AbstractCegarLoop]: Abstraction has 289061 states and 420876 transitions. [2024-11-09 23:35:51,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.608695652173912) internal successors, (336), 23 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 289061 states and 420876 transitions. [2024-11-09 23:35:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 23:35:51,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:51,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:35:51,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:35:51,539 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,SelfDestructingSolverStorable17 [2024-11-09 23:35:51,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:51,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1780243966, now seen corresponding path program 1 times [2024-11-09 23:35:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:51,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473631304] [2024-11-09 23:35:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:51,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:35:51,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:51,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473631304] [2024-11-09 23:35:51,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473631304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:51,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:51,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059088834] [2024-11-09 23:35:51,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:51,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:51,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:51,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:51,705 INFO L87 Difference]: Start difference. First operand 289061 states and 420876 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)