./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d49205c4ffe20d5beac0ad3125002385f97f5ba1191dc9c85bce9eb1aba82790 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:52:53,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:52:53,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:52:53,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:52:53,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:52:53,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:52:53,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:52:53,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:52:53,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:52:53,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:52:53,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:52:53,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:52:53,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:52:53,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:52:53,618 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:52:53,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:52:53,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:52:53,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:52:53,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:52:53,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:52:53,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:52:53,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:52:53,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:52:53,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:52:53,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:52:53,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:52:53,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:52:53,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:52:53,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:52:53,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:52:53,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:52:53,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:52:53,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:52:53,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:52:53,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:52:53,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:52:53,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:52:53,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:52:53,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:52:53,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:52:53,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:52:53,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:52:53,633 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 -> d49205c4ffe20d5beac0ad3125002385f97f5ba1191dc9c85bce9eb1aba82790 [2024-10-14 03:52:53,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:52:53,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:52:53,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:52:53,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:52:53,880 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:52:53,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2024-10-14 03:52:55,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:52:55,404 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:52:55,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2024-10-14 03:52:55,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead0cb891/feb01bce3e3b4778bc4c230f91f70cd8/FLAG58970ee66 [2024-10-14 03:52:55,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead0cb891/feb01bce3e3b4778bc4c230f91f70cd8 [2024-10-14 03:52:55,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:52:55,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:52:55,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:52:55,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:52:55,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:52:55,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:52:55" (1/1) ... [2024-10-14 03:52:55,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c33e633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:55, skipping insertion in model container [2024-10-14 03:52:55,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:52:55" (1/1) ... [2024-10-14 03:52:55,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:52:56,017 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[7365,7378] [2024-10-14 03:52:56,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:52:56,084 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:52:56,151 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[7365,7378] [2024-10-14 03:52:56,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:52:56,234 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:52:56,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56 WrapperNode [2024-10-14 03:52:56,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:52:56,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:52:56,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:52:56,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:52:56,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,304 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 688 [2024-10-14 03:52:56,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:52:56,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:52:56,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:52:56,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:52:56,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,345 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:52:56,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:52:56,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:52:56,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:52:56,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:52:56,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (1/1) ... [2024-10-14 03:52:56,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:52:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:52:56,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:52:56,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:52:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:52:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:52:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:52:56,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:52:56,686 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:52:56,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:52:57,448 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-10-14 03:52:57,448 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:52:57,520 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:52:57,520 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:52:57,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:52:57 BoogieIcfgContainer [2024-10-14 03:52:57,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:52:57,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:52:57,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:52:57,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:52:57,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:52:55" (1/3) ... [2024-10-14 03:52:57,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76853368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:52:57, skipping insertion in model container [2024-10-14 03:52:57,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:52:56" (2/3) ... [2024-10-14 03:52:57,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76853368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:52:57, skipping insertion in model container [2024-10-14 03:52:57,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:52:57" (3/3) ... [2024-10-14 03:52:57,535 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2024-10-14 03:52:57,562 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:52:57,562 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:52:57,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:52:57,675 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;@294b04b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:52:57,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:52:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 159 states have (on average 1.7169811320754718) internal successors, (273), 160 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:52:57,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:52:57,707 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] [2024-10-14 03:52:57,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:52:57,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:52:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash -334794023, now seen corresponding path program 1 times [2024-10-14 03:52:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:52:57,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150434359] [2024-10-14 03:52:57,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:52:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:52:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:52:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:52:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:52:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150434359] [2024-10-14 03:52:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150434359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:52:58,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:52:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:52:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601925321] [2024-10-14 03:52:58,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:52:58,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:52:58,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:52:58,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:52:58,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:58,181 INFO L87 Difference]: Start difference. First operand has 161 states, 159 states have (on average 1.7169811320754718) internal successors, (273), 160 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:52:58,271 INFO L93 Difference]: Finished difference Result 381 states and 623 transitions. [2024-10-14 03:52:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:52:58,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-14 03:52:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:52:58,286 INFO L225 Difference]: With dead ends: 381 [2024-10-14 03:52:58,286 INFO L226 Difference]: Without dead ends: 259 [2024-10-14 03:52:58,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:58,292 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 211 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:52:58,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 601 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:52:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-14 03:52:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2024-10-14 03:52:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.50390625) internal successors, (385), 256 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2024-10-14 03:52:58,340 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 72 [2024-10-14 03:52:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:52:58,340 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2024-10-14 03:52:58,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2024-10-14 03:52:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 03:52:58,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:52:58,343 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] [2024-10-14 03:52:58,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:52:58,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:52:58,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:52:58,344 INFO L85 PathProgramCache]: Analyzing trace with hash 848511110, now seen corresponding path program 1 times [2024-10-14 03:52:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:52:58,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430124118] [2024-10-14 03:52:58,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:52:58,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:52:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:52:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:52:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:52:58,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430124118] [2024-10-14 03:52:58,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430124118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:52:58,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:52:58,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:52:58,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423832525] [2024-10-14 03:52:58,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:52:58,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:52:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:52:58,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:52:58,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:58,525 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:52:58,557 INFO L93 Difference]: Finished difference Result 653 states and 1017 transitions. [2024-10-14 03:52:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:52:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-14 03:52:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:52:58,561 INFO L225 Difference]: With dead ends: 653 [2024-10-14 03:52:58,561 INFO L226 Difference]: Without dead ends: 439 [2024-10-14 03:52:58,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:58,563 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 168 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:52:58,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 537 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:52:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-14 03:52:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2024-10-14 03:52:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 672 transitions. [2024-10-14 03:52:58,588 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 672 transitions. Word has length 73 [2024-10-14 03:52:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:52:58,588 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 672 transitions. [2024-10-14 03:52:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 672 transitions. [2024-10-14 03:52:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:52:58,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:52:58,591 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] [2024-10-14 03:52:58,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:52:58,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:52:58,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:52:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1828009384, now seen corresponding path program 1 times [2024-10-14 03:52:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:52:58,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127684945] [2024-10-14 03:52:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:52:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:52:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:52:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:52:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:52:58,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127684945] [2024-10-14 03:52:58,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127684945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:52:58,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:52:58,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:52:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614439293] [2024-10-14 03:52:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:52:58,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:52:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:52:58,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:52:58,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:58,676 INFO L87 Difference]: Start difference. First operand 437 states and 672 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:52:58,694 INFO L93 Difference]: Finished difference Result 1161 states and 1826 transitions. [2024-10-14 03:52:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:52:58,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-14 03:52:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:52:58,698 INFO L225 Difference]: With dead ends: 1161 [2024-10-14 03:52:58,698 INFO L226 Difference]: Without dead ends: 767 [2024-10-14 03:52:58,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:58,702 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 163 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:52:58,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 522 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:52:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-10-14 03:52:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 765. [2024-10-14 03:52:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.5602094240837696) internal successors, (1192), 764 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1192 transitions. [2024-10-14 03:52:58,723 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1192 transitions. Word has length 74 [2024-10-14 03:52:58,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:52:58,723 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1192 transitions. [2024-10-14 03:52:58,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1192 transitions. [2024-10-14 03:52:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:52:58,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:52:58,725 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] [2024-10-14 03:52:58,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:52:58,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:52:58,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:52:58,726 INFO L85 PathProgramCache]: Analyzing trace with hash 158292751, now seen corresponding path program 1 times [2024-10-14 03:52:58,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:52:58,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646480496] [2024-10-14 03:52:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:52:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:52:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:52:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:52:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:52:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646480496] [2024-10-14 03:52:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646480496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:52:58,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:52:58,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:52:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487104148] [2024-10-14 03:52:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:52:58,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:52:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:52:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:52:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:58,830 INFO L87 Difference]: Start difference. First operand 765 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:52:58,856 INFO L93 Difference]: Finished difference Result 2081 states and 3282 transitions. [2024-10-14 03:52:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:52:58,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-14 03:52:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:52:58,862 INFO L225 Difference]: With dead ends: 2081 [2024-10-14 03:52:58,862 INFO L226 Difference]: Without dead ends: 1359 [2024-10-14 03:52:58,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:58,865 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 158 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:52:58,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 507 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:52:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2024-10-14 03:52:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1357. [2024-10-14 03:52:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1356 states have (on average 1.5663716814159292) internal successors, (2124), 1356 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 2124 transitions. [2024-10-14 03:52:58,889 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 2124 transitions. Word has length 75 [2024-10-14 03:52:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:52:58,890 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 2124 transitions. [2024-10-14 03:52:58,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 2124 transitions. [2024-10-14 03:52:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:52:58,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:52:58,895 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] [2024-10-14 03:52:58,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:52:58,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:52:58,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:52:58,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2027632149, now seen corresponding path program 1 times [2024-10-14 03:52:58,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:52:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053157378] [2024-10-14 03:52:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:52:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:52:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:52:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:52:58,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:52:58,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053157378] [2024-10-14 03:52:58,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053157378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:52:58,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:52:58,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:52:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781639911] [2024-10-14 03:52:58,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:52:58,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:52:58,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:52:58,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:52:58,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:58,996 INFO L87 Difference]: Start difference. First operand 1357 states and 2124 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:52:59,023 INFO L93 Difference]: Finished difference Result 3729 states and 5870 transitions. [2024-10-14 03:52:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:52:59,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-14 03:52:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:52:59,030 INFO L225 Difference]: With dead ends: 3729 [2024-10-14 03:52:59,030 INFO L226 Difference]: Without dead ends: 2415 [2024-10-14 03:52:59,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:59,033 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 153 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:52:59,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 492 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:52:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2024-10-14 03:52:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2413. [2024-10-14 03:52:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2413 states, 2412 states have (on average 1.5638474295190714) internal successors, (3772), 2412 states have internal predecessors, (3772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 3772 transitions. [2024-10-14 03:52:59,102 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 3772 transitions. Word has length 76 [2024-10-14 03:52:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:52:59,103 INFO L471 AbstractCegarLoop]: Abstraction has 2413 states and 3772 transitions. [2024-10-14 03:52:59,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3772 transitions. [2024-10-14 03:52:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:52:59,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:52:59,104 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] [2024-10-14 03:52:59,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:52:59,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:52:59,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:52:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash -113675860, now seen corresponding path program 1 times [2024-10-14 03:52:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:52:59,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655947822] [2024-10-14 03:52:59,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:52:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:52:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:52:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:52:59,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:52:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655947822] [2024-10-14 03:52:59,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655947822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:52:59,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:52:59,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:52:59,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221875244] [2024-10-14 03:52:59,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:52:59,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:52:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:52:59,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:52:59,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:59,220 INFO L87 Difference]: Start difference. First operand 2413 states and 3772 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:52:59,294 INFO L93 Difference]: Finished difference Result 6641 states and 10398 transitions. [2024-10-14 03:52:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:52:59,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-14 03:52:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:52:59,314 INFO L225 Difference]: With dead ends: 6641 [2024-10-14 03:52:59,317 INFO L226 Difference]: Without dead ends: 4271 [2024-10-14 03:52:59,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:52:59,324 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 148 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:52:59,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 477 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:52:59,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2024-10-14 03:52:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 4269. [2024-10-14 03:52:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4269 states, 4268 states have (on average 1.5548266166822868) internal successors, (6636), 4268 states have internal predecessors, (6636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4269 states to 4269 states and 6636 transitions. [2024-10-14 03:52:59,389 INFO L78 Accepts]: Start accepts. Automaton has 4269 states and 6636 transitions. Word has length 77 [2024-10-14 03:52:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:52:59,389 INFO L471 AbstractCegarLoop]: Abstraction has 4269 states and 6636 transitions. [2024-10-14 03:52:59,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4269 states and 6636 transitions. [2024-10-14 03:52:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:52:59,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:52:59,391 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] [2024-10-14 03:52:59,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:52:59,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:52:59,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:52:59,392 INFO L85 PathProgramCache]: Analyzing trace with hash 530651538, now seen corresponding path program 1 times [2024-10-14 03:52:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:52:59,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310087617] [2024-10-14 03:52:59,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:52:59,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:52:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:52:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:52:59,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:52:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310087617] [2024-10-14 03:52:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310087617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:52:59,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:52:59,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:52:59,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884108805] [2024-10-14 03:52:59,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:52:59,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:52:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:52:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:52:59,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:52:59,609 INFO L87 Difference]: Start difference. First operand 4269 states and 6636 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:52:59,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:52:59,970 INFO L93 Difference]: Finished difference Result 33851 states and 52787 transitions. [2024-10-14 03:52:59,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:52:59,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 03:52:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:00,084 INFO L225 Difference]: With dead ends: 33851 [2024-10-14 03:53:00,085 INFO L226 Difference]: Without dead ends: 29625 [2024-10-14 03:53:00,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:53:00,110 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 2559 mSDsluCounter, 2249 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 2472 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:00,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2559 Valid, 2472 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:53:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29625 states. [2024-10-14 03:53:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29625 to 8493. [2024-10-14 03:53:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 8492 states have (on average 1.5426283560998586) internal successors, (13100), 8492 states have internal predecessors, (13100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 13100 transitions. [2024-10-14 03:53:00,658 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 13100 transitions. Word has length 78 [2024-10-14 03:53:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:00,658 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 13100 transitions. [2024-10-14 03:53:00,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 13100 transitions. [2024-10-14 03:53:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:53:00,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:00,660 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-10-14 03:53:00,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:53:00,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:00,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash -749127703, now seen corresponding path program 1 times [2024-10-14 03:53:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732115420] [2024-10-14 03:53:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732115420] [2024-10-14 03:53:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732115420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:00,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:00,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:53:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448510728] [2024-10-14 03:53:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:00,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:53:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:00,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:53:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:53:00,867 INFO L87 Difference]: Start difference. First operand 8493 states and 13100 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-10-14 03:53:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:01,131 INFO L93 Difference]: Finished difference Result 51513 states and 78770 transitions. [2024-10-14 03:53:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:53:01,135 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-10-14 03:53:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:01,208 INFO L225 Difference]: With dead ends: 51513 [2024-10-14 03:53:01,208 INFO L226 Difference]: Without dead ends: 43063 [2024-10-14 03:53:01,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:53:01,234 INFO L432 NwaCegarLoop]: 739 mSDtfsCounter, 895 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:01,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 1956 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:53:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43063 states. [2024-10-14 03:53:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43063 to 43053. [2024-10-14 03:53:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43053 states, 43052 states have (on average 1.5232741800613212) internal successors, (65580), 43052 states have internal predecessors, (65580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43053 states to 43053 states and 65580 transitions. [2024-10-14 03:53:02,248 INFO L78 Accepts]: Start accepts. Automaton has 43053 states and 65580 transitions. Word has length 79 [2024-10-14 03:53:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:02,248 INFO L471 AbstractCegarLoop]: Abstraction has 43053 states and 65580 transitions. [2024-10-14 03:53:02,249 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-10-14 03:53:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 43053 states and 65580 transitions. [2024-10-14 03:53:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:53:02,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:02,249 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-10-14 03:53:02,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:53:02,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:02,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:02,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1290801728, now seen corresponding path program 1 times [2024-10-14 03:53:02,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244551284] [2024-10-14 03:53:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:02,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244551284] [2024-10-14 03:53:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244551284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:02,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:02,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:53:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047929150] [2024-10-14 03:53:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:02,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:53:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:53:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:02,335 INFO L87 Difference]: Start difference. First operand 43053 states and 65580 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 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-10-14 03:53:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:03,227 INFO L93 Difference]: Finished difference Result 129073 states and 196654 transitions. [2024-10-14 03:53:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:53:03,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 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-10-14 03:53:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:03,579 INFO L225 Difference]: With dead ends: 129073 [2024-10-14 03:53:03,579 INFO L226 Difference]: Without dead ends: 86063 [2024-10-14 03:53:03,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:53:03,657 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 991 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:03,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 252 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:53:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86063 states. [2024-10-14 03:53:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86063 to 86061. [2024-10-14 03:53:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86061 states, 86060 states have (on average 1.5153613757843365) internal successors, (130412), 86060 states have internal predecessors, (130412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86061 states to 86061 states and 130412 transitions. [2024-10-14 03:53:05,307 INFO L78 Accepts]: Start accepts. Automaton has 86061 states and 130412 transitions. Word has length 81 [2024-10-14 03:53:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:05,307 INFO L471 AbstractCegarLoop]: Abstraction has 86061 states and 130412 transitions. [2024-10-14 03:53:05,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 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-10-14 03:53:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 86061 states and 130412 transitions. [2024-10-14 03:53:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:53:05,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:05,310 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-10-14 03:53:05,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:53:05,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:05,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1861218309, now seen corresponding path program 1 times [2024-10-14 03:53:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:05,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250253366] [2024-10-14 03:53:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:05,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:05,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250253366] [2024-10-14 03:53:05,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250253366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:05,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:05,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:53:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114039349] [2024-10-14 03:53:05,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:05,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:53:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:05,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:53:05,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:05,829 INFO L87 Difference]: Start difference. First operand 86061 states and 130412 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-10-14 03:53:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:06,150 INFO L93 Difference]: Finished difference Result 89135 states and 135021 transitions. [2024-10-14 03:53:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:53:06,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-10-14 03:53:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:06,274 INFO L225 Difference]: With dead ends: 89135 [2024-10-14 03:53:06,275 INFO L226 Difference]: Without dead ends: 89133 [2024-10-14 03:53:06,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:06,300 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:06,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89133 states. [2024-10-14 03:53:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89133 to 89133. [2024-10-14 03:53:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89133 states, 89132 states have (on average 1.4975990665529777) internal successors, (133484), 89132 states have internal predecessors, (133484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89133 states to 89133 states and 133484 transitions. [2024-10-14 03:53:07,878 INFO L78 Accepts]: Start accepts. Automaton has 89133 states and 133484 transitions. Word has length 81 [2024-10-14 03:53:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:07,878 INFO L471 AbstractCegarLoop]: Abstraction has 89133 states and 133484 transitions. [2024-10-14 03:53:07,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-10-14 03:53:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 89133 states and 133484 transitions. [2024-10-14 03:53:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:53:07,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:07,879 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-10-14 03:53:07,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:53:07,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:07,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1852619600, now seen corresponding path program 1 times [2024-10-14 03:53:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:07,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77069769] [2024-10-14 03:53:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:08,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:08,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77069769] [2024-10-14 03:53:08,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77069769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:08,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:08,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:08,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360935616] [2024-10-14 03:53:08,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:08,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:08,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:08,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:08,039 INFO L87 Difference]: Start difference. First operand 89133 states and 133484 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-10-14 03:53:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:08,910 INFO L93 Difference]: Finished difference Result 199123 states and 297728 transitions. [2024-10-14 03:53:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:08,911 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-10-14 03:53:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:09,133 INFO L225 Difference]: With dead ends: 199123 [2024-10-14 03:53:09,133 INFO L226 Difference]: Without dead ends: 110033 [2024-10-14 03:53:09,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:09,186 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 136 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:09,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 460 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110033 states. [2024-10-14 03:53:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110033 to 110031. [2024-10-14 03:53:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110031 states, 110030 states have (on average 1.4899027537944196) internal successors, (163934), 110030 states have internal predecessors, (163934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110031 states to 110031 states and 163934 transitions. [2024-10-14 03:53:11,115 INFO L78 Accepts]: Start accepts. Automaton has 110031 states and 163934 transitions. Word has length 82 [2024-10-14 03:53:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:11,115 INFO L471 AbstractCegarLoop]: Abstraction has 110031 states and 163934 transitions. [2024-10-14 03:53:11,115 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-10-14 03:53:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 110031 states and 163934 transitions. [2024-10-14 03:53:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:53:11,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:11,156 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:11,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:53:11,157 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:11,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1688420547, now seen corresponding path program 1 times [2024-10-14 03:53:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133039446] [2024-10-14 03:53:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:53:11,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:11,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133039446] [2024-10-14 03:53:11,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133039446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:53:11,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499026016] [2024-10-14 03:53:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:11,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:53:11,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:53:11,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:53:11,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:53:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:11,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 03:53:11,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:53:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:12,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:53:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:13,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499026016] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:53:13,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:53:13,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-10-14 03:53:13,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42126616] [2024-10-14 03:53:13,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:53:13,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 03:53:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:13,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 03:53:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:53:13,291 INFO L87 Difference]: Start difference. First operand 110031 states and 163934 transitions. Second operand has 14 states, 14 states have (on average 21.285714285714285) internal successors, (298), 14 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:16,094 INFO L93 Difference]: Finished difference Result 536407 states and 801683 transitions. [2024-10-14 03:53:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:53:16,095 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 21.285714285714285) internal successors, (298), 14 states have internal predecessors, (298), 0 states have call successors, (0), 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 111 [2024-10-14 03:53:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:16,888 INFO L225 Difference]: With dead ends: 536407 [2024-10-14 03:53:16,888 INFO L226 Difference]: Without dead ends: 426421 [2024-10-14 03:53:17,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:53:17,036 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 5124 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5124 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:17,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5124 Valid, 2530 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426421 states. [2024-10-14 03:53:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426421 to 383001. [2024-10-14 03:53:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383001 states, 383000 states have (on average 1.4859451697127937) internal successors, (569117), 383000 states have internal predecessors, (569117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383001 states to 383001 states and 569117 transitions. [2024-10-14 03:53:25,513 INFO L78 Accepts]: Start accepts. Automaton has 383001 states and 569117 transitions. Word has length 111 [2024-10-14 03:53:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:25,513 INFO L471 AbstractCegarLoop]: Abstraction has 383001 states and 569117 transitions. [2024-10-14 03:53:25,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.285714285714285) internal successors, (298), 14 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 383001 states and 569117 transitions. [2024-10-14 03:53:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 03:53:25,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:25,537 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:53:25,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:53:25,738 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,SelfDestructingSolverStorable11 [2024-10-14 03:53:25,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:25,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1587790688, now seen corresponding path program 1 times [2024-10-14 03:53:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:25,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185878624] [2024-10-14 03:53:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:25,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185878624] [2024-10-14 03:53:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185878624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:25,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866636339] [2024-10-14 03:53:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:25,894 INFO L87 Difference]: Start difference. First operand 383001 states and 569117 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:30,884 INFO L93 Difference]: Finished difference Result 992708 states and 1473245 transitions. [2024-10-14 03:53:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-10-14 03:53:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:33,068 INFO L225 Difference]: With dead ends: 992708 [2024-10-14 03:53:33,068 INFO L226 Difference]: Without dead ends: 654594 [2024-10-14 03:53:33,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:33,430 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 138 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:33,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 459 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654594 states. [2024-10-14 03:53:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654594 to 639876. [2024-10-14 03:53:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639876 states, 639875 states have (on average 1.4741207267044345) internal successors, (943253), 639875 states have internal predecessors, (943253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639876 states to 639876 states and 943253 transitions. [2024-10-14 03:53:47,108 INFO L78 Accepts]: Start accepts. Automaton has 639876 states and 943253 transitions. Word has length 112 [2024-10-14 03:53:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:47,108 INFO L471 AbstractCegarLoop]: Abstraction has 639876 states and 943253 transitions. [2024-10-14 03:53:47,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 639876 states and 943253 transitions. [2024-10-14 03:53:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 03:53:47,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:47,138 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:53:47,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:53:47,139 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:47,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:47,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1811453927, now seen corresponding path program 1 times [2024-10-14 03:53:47,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459759792] [2024-10-14 03:53:47,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459759792] [2024-10-14 03:53:47,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459759792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:47,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245342638] [2024-10-14 03:53:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:47,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:47,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:47,273 INFO L87 Difference]: Start difference. First operand 639876 states and 943253 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)