./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_opt-floodmax.4.4.ufo.UNBOUNDED.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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7d273a09ef49b5374355f70a7c3526050d90f635e0e9c0c426afbe9f20d712a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:04:56,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:04:56,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:04:56,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:04:56,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:04:56,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:04:56,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:04:56,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:04:56,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:04:56,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:04:56,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:04:56,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:04:56,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:04:56,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:04:56,655 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:04:56,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:04:56,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:04:56,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:04:56,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:04:56,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:04:56,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:04:56,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:04:56,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:04:56,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:04:56,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:04:56,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:04:56,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:04:56,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:04:56,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:04:56,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:04:56,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:04:56,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:04:56,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:04:56,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:04:56,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:04:56,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:04:56,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:04:56,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:04:56,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:04:56,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:04:56,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:04:56,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:04:56,663 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 -> c7d273a09ef49b5374355f70a7c3526050d90f635e0e9c0c426afbe9f20d712a [2024-10-14 04:04:56,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:04:56,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:04:56,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:04:56,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:04:56,885 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:04:56,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 04:04:58,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:04:58,344 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:04:58,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 04:04:58,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7516e004/8516545485b7495eb490c16507a497ee/FLAGfe62cb810 [2024-10-14 04:04:58,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7516e004/8516545485b7495eb490c16507a497ee [2024-10-14 04:04:58,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:04:58,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:04:58,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:04:58,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:04:58,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:04:58,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:58,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302e5e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58, skipping insertion in model container [2024-10-14 04:04:58,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:58,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:04:58,725 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839] [2024-10-14 04:04:58,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:04:58,801 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:04:58,862 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839] [2024-10-14 04:04:58,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:04:58,915 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:04:58,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58 WrapperNode [2024-10-14 04:04:58,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:04:58,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:04:58,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:04:58,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:04:58,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:58,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:58,981 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1451 [2024-10-14 04:04:58,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:04:58,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:04:58,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:04:58,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:04:58,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:58,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:59,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:59,025 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 04:04:59,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:59,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:59,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:59,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:59,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:59,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:59,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:04:59,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:04:59,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:04:59,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:04:59,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (1/1) ... [2024-10-14 04:04:59,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:04:59,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:04:59,106 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 04:04:59,108 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 04:04:59,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:04:59,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:04:59,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:04:59,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:04:59,282 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:04:59,284 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:05:00,319 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-14 04:05:00,320 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:05:00,382 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:05:00,384 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 04:05:00,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:05:00 BoogieIcfgContainer [2024-10-14 04:05:00,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:05:00,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:05:00,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:05:00,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:05:00,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:04:58" (1/3) ... [2024-10-14 04:05:00,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba7da31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:05:00, skipping insertion in model container [2024-10-14 04:05:00,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:04:58" (2/3) ... [2024-10-14 04:05:00,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba7da31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:05:00, skipping insertion in model container [2024-10-14 04:05:00,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:05:00" (3/3) ... [2024-10-14 04:05:00,394 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 04:05:00,408 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:05:00,408 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 04:05:00,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:05:00,476 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;@3530968b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:05:00,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 04:05:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 346 states have (on average 1.7919075144508672) internal successors, (620), 347 states have internal predecessors, (620), 0 states have call successors, (0), 0 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 04:05:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 04:05:00,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:00,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:00,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:00,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1104503108, now seen corresponding path program 1 times [2024-10-14 04:05:00,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:00,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139444059] [2024-10-14 04:05:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:00,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:01,114 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 04:05:01,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139444059] [2024-10-14 04:05:01,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139444059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:01,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:01,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858538674] [2024-10-14 04:05:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:01,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:01,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:01,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:01,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:01,150 INFO L87 Difference]: Start difference. First operand has 348 states, 346 states have (on average 1.7919075144508672) internal successors, (620), 347 states have internal predecessors, (620), 0 states have call successors, (0), 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 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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 04:05:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:01,272 INFO L93 Difference]: Finished difference Result 648 states and 1120 transitions. [2024-10-14 04:05:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:01,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-10-14 04:05:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:01,291 INFO L225 Difference]: With dead ends: 648 [2024-10-14 04:05:01,291 INFO L226 Difference]: Without dead ends: 488 [2024-10-14 04:05:01,294 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 04:05:01,298 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 265 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:01,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1138 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:05:01,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-14 04:05:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 485. [2024-10-14 04:05:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.6528925619834711) internal successors, (800), 484 states have internal predecessors, (800), 0 states have call successors, (0), 0 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 04:05:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 800 transitions. [2024-10-14 04:05:01,356 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 800 transitions. Word has length 117 [2024-10-14 04:05:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:01,357 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 800 transitions. [2024-10-14 04:05:01,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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 04:05:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 800 transitions. [2024-10-14 04:05:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 04:05:01,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:01,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:01,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:05:01,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:01,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1038605622, now seen corresponding path program 1 times [2024-10-14 04:05:01,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:01,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94328889] [2024-10-14 04:05:01,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:01,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:01,629 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 04:05:01,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:01,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94328889] [2024-10-14 04:05:01,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94328889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:01,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:01,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263146983] [2024-10-14 04:05:01,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:01,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:01,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:01,635 INFO L87 Difference]: Start difference. First operand 485 states and 800 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 04:05:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:01,669 INFO L93 Difference]: Finished difference Result 1051 states and 1740 transitions. [2024-10-14 04:05:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:01,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-10-14 04:05:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:01,675 INFO L225 Difference]: With dead ends: 1051 [2024-10-14 04:05:01,676 INFO L226 Difference]: Without dead ends: 758 [2024-10-14 04:05:01,678 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 04:05:01,680 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 229 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:01,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1094 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-14 04:05:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2024-10-14 04:05:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.653386454183267) internal successors, (1245), 753 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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 04:05:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1245 transitions. [2024-10-14 04:05:01,717 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1245 transitions. Word has length 120 [2024-10-14 04:05:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:01,718 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1245 transitions. [2024-10-14 04:05:01,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 04:05:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1245 transitions. [2024-10-14 04:05:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 04:05:01,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:01,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:01,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:05:01,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:01,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1045683377, now seen corresponding path program 1 times [2024-10-14 04:05:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:01,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551546923] [2024-10-14 04:05:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:01,925 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 04:05:01,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:01,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551546923] [2024-10-14 04:05:01,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551546923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:01,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:01,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:01,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302612731] [2024-10-14 04:05:01,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:01,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:01,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:01,930 INFO L87 Difference]: Start difference. First operand 754 states and 1245 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 04:05:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:01,967 INFO L93 Difference]: Finished difference Result 1838 states and 3039 transitions. [2024-10-14 04:05:01,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:01,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-10-14 04:05:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:01,973 INFO L225 Difference]: With dead ends: 1838 [2024-10-14 04:05:01,974 INFO L226 Difference]: Without dead ends: 1276 [2024-10-14 04:05:01,975 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 04:05:01,978 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 222 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:01,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1095 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-10-14 04:05:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1270. [2024-10-14 04:05:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 1.649330181245075) internal successors, (2093), 1269 states have internal predecessors, (2093), 0 states have call successors, (0), 0 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 04:05:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2093 transitions. [2024-10-14 04:05:02,009 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2093 transitions. Word has length 123 [2024-10-14 04:05:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:02,010 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 2093 transitions. [2024-10-14 04:05:02,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 04:05:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2093 transitions. [2024-10-14 04:05:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 04:05:02,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:02,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:02,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:05:02,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:02,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1670401211, now seen corresponding path program 1 times [2024-10-14 04:05:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748795118] [2024-10-14 04:05:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:02,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:02,156 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 04:05:02,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748795118] [2024-10-14 04:05:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748795118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:02,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529992483] [2024-10-14 04:05:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:02,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:02,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:02,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:02,179 INFO L87 Difference]: Start difference. First operand 1270 states and 2093 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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 04:05:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:02,229 INFO L93 Difference]: Finished difference Result 3346 states and 5511 transitions. [2024-10-14 04:05:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:02,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-14 04:05:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:02,237 INFO L225 Difference]: With dead ends: 3346 [2024-10-14 04:05:02,237 INFO L226 Difference]: Without dead ends: 2268 [2024-10-14 04:05:02,240 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 04:05:02,240 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 215 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:02,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1096 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2024-10-14 04:05:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2258. [2024-10-14 04:05:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 1.6415595923792645) internal successors, (3705), 2257 states have internal predecessors, (3705), 0 states have call successors, (0), 0 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 04:05:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3705 transitions. [2024-10-14 04:05:02,284 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3705 transitions. Word has length 126 [2024-10-14 04:05:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:02,284 INFO L471 AbstractCegarLoop]: Abstraction has 2258 states and 3705 transitions. [2024-10-14 04:05:02,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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 04:05:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3705 transitions. [2024-10-14 04:05:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 04:05:02,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:02,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:02,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:05:02,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:02,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:02,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1229327834, now seen corresponding path program 1 times [2024-10-14 04:05:02,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653442397] [2024-10-14 04:05:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:02,477 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 04:05:02,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:02,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653442397] [2024-10-14 04:05:02,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653442397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:02,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:05:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620778309] [2024-10-14 04:05:02,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:02,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:05:02,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:02,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:05:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:05:02,479 INFO L87 Difference]: Start difference. First operand 2258 states and 3705 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 04:05:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:02,805 INFO L93 Difference]: Finished difference Result 11838 states and 19569 transitions. [2024-10-14 04:05:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 04:05:02,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-10-14 04:05:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:02,833 INFO L225 Difference]: With dead ends: 11838 [2024-10-14 04:05:02,833 INFO L226 Difference]: Without dead ends: 9772 [2024-10-14 04:05:02,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:05:02,839 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 2145 mSDsluCounter, 4278 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 4847 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:02,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 4847 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 04:05:02,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9772 states. [2024-10-14 04:05:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9772 to 4188. [2024-10-14 04:05:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 4187 states have (on average 1.6412705994745642) internal successors, (6872), 4187 states have internal predecessors, (6872), 0 states have call successors, (0), 0 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 04:05:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 6872 transitions. [2024-10-14 04:05:02,947 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 6872 transitions. Word has length 129 [2024-10-14 04:05:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:02,947 INFO L471 AbstractCegarLoop]: Abstraction has 4188 states and 6872 transitions. [2024-10-14 04:05:02,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 04:05:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 6872 transitions. [2024-10-14 04:05:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 04:05:02,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:02,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:05:02,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash 478480816, now seen corresponding path program 1 times [2024-10-14 04:05:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989159752] [2024-10-14 04:05:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:02,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:03,105 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 04:05:03,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:03,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989159752] [2024-10-14 04:05:03,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989159752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:03,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:03,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:05:03,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378693991] [2024-10-14 04:05:03,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:03,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:05:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:03,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:05:03,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:05:03,108 INFO L87 Difference]: Start difference. First operand 4188 states and 6872 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 04:05:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:03,213 INFO L93 Difference]: Finished difference Result 12286 states and 20260 transitions. [2024-10-14 04:05:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:05:03,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-14 04:05:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:03,249 INFO L225 Difference]: With dead ends: 12286 [2024-10-14 04:05:03,250 INFO L226 Difference]: Without dead ends: 8290 [2024-10-14 04:05:03,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:05:03,262 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 754 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:03,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1711 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8290 states. [2024-10-14 04:05:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 6222. [2024-10-14 04:05:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 6221 states have (on average 1.6436264266195146) internal successors, (10225), 6221 states have internal predecessors, (10225), 0 states have call successors, (0), 0 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 04:05:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 10225 transitions. [2024-10-14 04:05:03,369 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 10225 transitions. Word has length 130 [2024-10-14 04:05:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:03,370 INFO L471 AbstractCegarLoop]: Abstraction has 6222 states and 10225 transitions. [2024-10-14 04:05:03,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 04:05:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 10225 transitions. [2024-10-14 04:05:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:05:03,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:03,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:03,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:05:03,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:03,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1885499437, now seen corresponding path program 1 times [2024-10-14 04:05:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:03,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257677886] [2024-10-14 04:05:03,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:03,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:03,526 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 04:05:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:03,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257677886] [2024-10-14 04:05:03,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257677886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:03,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:03,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:05:03,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747510153] [2024-10-14 04:05:03,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:03,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:05:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:03,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:05:03,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:05:03,529 INFO L87 Difference]: Start difference. First operand 6222 states and 10225 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 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 04:05:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:03,653 INFO L93 Difference]: Finished difference Result 18284 states and 30120 transitions. [2024-10-14 04:05:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:05:03,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-10-14 04:05:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:03,679 INFO L225 Difference]: With dead ends: 18284 [2024-10-14 04:05:03,679 INFO L226 Difference]: Without dead ends: 12254 [2024-10-14 04:05:03,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:05:03,692 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 752 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:03,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1772 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2024-10-14 04:05:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 9214. [2024-10-14 04:05:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9214 states, 9213 states have (on average 1.6419190274611961) internal successors, (15127), 9213 states have internal predecessors, (15127), 0 states have call successors, (0), 0 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 04:05:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 15127 transitions. [2024-10-14 04:05:03,851 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 15127 transitions. Word has length 131 [2024-10-14 04:05:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:03,851 INFO L471 AbstractCegarLoop]: Abstraction has 9214 states and 15127 transitions. [2024-10-14 04:05:03,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 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 04:05:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 15127 transitions. [2024-10-14 04:05:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 04:05:03,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:03,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:03,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:05:03,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:03,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1737005545, now seen corresponding path program 1 times [2024-10-14 04:05:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480172228] [2024-10-14 04:05:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:04,027 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 04:05:04,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:04,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480172228] [2024-10-14 04:05:04,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480172228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:04,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:05:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711205441] [2024-10-14 04:05:04,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:04,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:05:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:04,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:05:04,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:05:04,031 INFO L87 Difference]: Start difference. First operand 9214 states and 15127 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 04:05:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:04,179 INFO L93 Difference]: Finished difference Result 27108 states and 44608 transitions. [2024-10-14 04:05:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:05:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-10-14 04:05:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:04,212 INFO L225 Difference]: With dead ends: 27108 [2024-10-14 04:05:04,212 INFO L226 Difference]: Without dead ends: 18086 [2024-10-14 04:05:04,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:05:04,227 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 750 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:04,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1894 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:05:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18086 states. [2024-10-14 04:05:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18086 to 13616. [2024-10-14 04:05:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13616 states, 13615 states have (on average 1.6401762761659935) internal successors, (22331), 13615 states have internal predecessors, (22331), 0 states have call successors, (0), 0 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 04:05:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13616 states to 13616 states and 22331 transitions. [2024-10-14 04:05:04,526 INFO L78 Accepts]: Start accepts. Automaton has 13616 states and 22331 transitions. Word has length 132 [2024-10-14 04:05:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:04,526 INFO L471 AbstractCegarLoop]: Abstraction has 13616 states and 22331 transitions. [2024-10-14 04:05:04,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 04:05:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 13616 states and 22331 transitions. [2024-10-14 04:05:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 04:05:04,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:04,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:04,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:05:04,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:04,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash -463645793, now seen corresponding path program 1 times [2024-10-14 04:05:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:04,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103854492] [2024-10-14 04:05:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:04,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:04,635 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 04:05:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:04,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103854492] [2024-10-14 04:05:04,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103854492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:04,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:04,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:04,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130572035] [2024-10-14 04:05:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:04,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:04,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:04,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:04,638 INFO L87 Difference]: Start difference. First operand 13616 states and 22331 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:04,817 INFO L93 Difference]: Finished difference Result 30204 states and 49578 transitions. [2024-10-14 04:05:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:04,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-14 04:05:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:04,848 INFO L225 Difference]: With dead ends: 30204 [2024-10-14 04:05:04,848 INFO L226 Difference]: Without dead ends: 20858 [2024-10-14 04:05:04,858 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 04:05:04,859 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 228 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1241 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 04:05:04,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1241 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20858 states. [2024-10-14 04:05:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20858 to 20856. [2024-10-14 04:05:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20856 states, 20855 states have (on average 1.6355789978422441) internal successors, (34110), 20855 states have internal predecessors, (34110), 0 states have call successors, (0), 0 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 04:05:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20856 states to 20856 states and 34110 transitions. [2024-10-14 04:05:05,182 INFO L78 Accepts]: Start accepts. Automaton has 20856 states and 34110 transitions. Word has length 133 [2024-10-14 04:05:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:05,183 INFO L471 AbstractCegarLoop]: Abstraction has 20856 states and 34110 transitions. [2024-10-14 04:05:05,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 20856 states and 34110 transitions. [2024-10-14 04:05:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 04:05:05,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:05,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:05,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:05:05,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:05,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:05,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1410705485, now seen corresponding path program 1 times [2024-10-14 04:05:05,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:05,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535042993] [2024-10-14 04:05:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:05,315 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 04:05:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:05,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535042993] [2024-10-14 04:05:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535042993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:05,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:05,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243110345] [2024-10-14 04:05:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:05,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:05,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:05,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:05,318 INFO L87 Difference]: Start difference. First operand 20856 states and 34110 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:05,456 INFO L93 Difference]: Finished difference Result 46074 states and 75424 transitions. [2024-10-14 04:05:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:05,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-14 04:05:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:05,515 INFO L225 Difference]: With dead ends: 46074 [2024-10-14 04:05:05,515 INFO L226 Difference]: Without dead ends: 31710 [2024-10-14 04:05:05,544 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 04:05:05,545 INFO L432 NwaCegarLoop]: 681 mSDtfsCounter, 221 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1208 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 04:05:05,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31710 states. [2024-10-14 04:05:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31710 to 31708. [2024-10-14 04:05:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31708 states, 31707 states have (on average 1.6303024568707225) internal successors, (51692), 31707 states have internal predecessors, (51692), 0 states have call successors, (0), 0 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 04:05:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31708 states to 31708 states and 51692 transitions. [2024-10-14 04:05:06,200 INFO L78 Accepts]: Start accepts. Automaton has 31708 states and 51692 transitions. Word has length 133 [2024-10-14 04:05:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:06,201 INFO L471 AbstractCegarLoop]: Abstraction has 31708 states and 51692 transitions. [2024-10-14 04:05:06,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 31708 states and 51692 transitions. [2024-10-14 04:05:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 04:05:06,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:06,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:06,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:05:06,202 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:06,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash -641806061, now seen corresponding path program 1 times [2024-10-14 04:05:06,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:06,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297344034] [2024-10-14 04:05:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:06,301 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 04:05:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297344034] [2024-10-14 04:05:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297344034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:06,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:06,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:06,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300562785] [2024-10-14 04:05:06,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:06,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:06,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:06,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:06,303 INFO L87 Difference]: Start difference. First operand 31708 states and 51692 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:06,509 INFO L93 Difference]: Finished difference Result 61884 states and 101018 transitions. [2024-10-14 04:05:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:06,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-14 04:05:06,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:06,587 INFO L225 Difference]: With dead ends: 61884 [2024-10-14 04:05:06,587 INFO L226 Difference]: Without dead ends: 44438 [2024-10-14 04:05:06,615 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 04:05:06,615 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 214 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1176 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 04:05:06,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44438 states. [2024-10-14 04:05:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44438 to 44436. [2024-10-14 04:05:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44436 states, 44435 states have (on average 1.6252503657027118) internal successors, (72218), 44435 states have internal predecessors, (72218), 0 states have call successors, (0), 0 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 04:05:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44436 states to 44436 states and 72218 transitions. [2024-10-14 04:05:07,504 INFO L78 Accepts]: Start accepts. Automaton has 44436 states and 72218 transitions. Word has length 133 [2024-10-14 04:05:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:07,504 INFO L471 AbstractCegarLoop]: Abstraction has 44436 states and 72218 transitions. [2024-10-14 04:05:07,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 44436 states and 72218 transitions. [2024-10-14 04:05:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 04:05:07,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:07,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:05:07,506 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:07,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1934015028, now seen corresponding path program 1 times [2024-10-14 04:05:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:07,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793355130] [2024-10-14 04:05:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:07,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:07,727 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 04:05:07,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:07,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793355130] [2024-10-14 04:05:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793355130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:07,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:07,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:05:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032521810] [2024-10-14 04:05:07,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:07,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:05:07,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:05:07,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:05:07,729 INFO L87 Difference]: Start difference. First operand 44436 states and 72218 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:08,336 INFO L93 Difference]: Finished difference Result 141592 states and 230509 transitions. [2024-10-14 04:05:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:05:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-14 04:05:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:08,666 INFO L225 Difference]: With dead ends: 141592 [2024-10-14 04:05:08,667 INFO L226 Difference]: Without dead ends: 97568 [2024-10-14 04:05:08,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:05:08,731 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 748 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:08,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1896 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97568 states. [2024-10-14 04:05:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97568 to 70868. [2024-10-14 04:05:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70868 states, 70867 states have (on average 1.6216010272764474) internal successors, (114918), 70867 states have internal predecessors, (114918), 0 states have call successors, (0), 0 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 04:05:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70868 states to 70868 states and 114918 transitions. [2024-10-14 04:05:09,778 INFO L78 Accepts]: Start accepts. Automaton has 70868 states and 114918 transitions. Word has length 133 [2024-10-14 04:05:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:09,779 INFO L471 AbstractCegarLoop]: Abstraction has 70868 states and 114918 transitions. [2024-10-14 04:05:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 70868 states and 114918 transitions. [2024-10-14 04:05:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 04:05:09,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:09,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:09,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:05:09,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1383459367, now seen corresponding path program 1 times [2024-10-14 04:05:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:09,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246654178] [2024-10-14 04:05:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:10,088 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 04:05:10,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:10,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246654178] [2024-10-14 04:05:10,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246654178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:10,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:10,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:10,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359553468] [2024-10-14 04:05:10,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:10,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:10,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:10,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:10,091 INFO L87 Difference]: Start difference. First operand 70868 states and 114918 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:10,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:10,673 INFO L93 Difference]: Finished difference Result 156081 states and 254328 transitions. [2024-10-14 04:05:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:10,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-14 04:05:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:10,871 INFO L225 Difference]: With dead ends: 156081 [2024-10-14 04:05:10,871 INFO L226 Difference]: Without dead ends: 105866 [2024-10-14 04:05:10,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:10,909 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 235 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1287 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 04:05:10,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1287 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105866 states. [2024-10-14 04:05:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105866 to 105864. [2024-10-14 04:05:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105864 states, 105863 states have (on average 1.618771431000444) internal successors, (171368), 105863 states have internal predecessors, (171368), 0 states have call successors, (0), 0 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 04:05:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105864 states to 105864 states and 171368 transitions. [2024-10-14 04:05:12,633 INFO L78 Accepts]: Start accepts. Automaton has 105864 states and 171368 transitions. Word has length 133 [2024-10-14 04:05:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:12,633 INFO L471 AbstractCegarLoop]: Abstraction has 105864 states and 171368 transitions. [2024-10-14 04:05:12,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 105864 states and 171368 transitions. [2024-10-14 04:05:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 04:05:12,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:12,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:12,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:05:12,634 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:12,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:12,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1645265701, now seen corresponding path program 1 times [2024-10-14 04:05:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216273864] [2024-10-14 04:05:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:12,913 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 04:05:12,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:12,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216273864] [2024-10-14 04:05:12,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216273864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:12,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:12,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:05:12,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223531502] [2024-10-14 04:05:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:12,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:05:12,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:12,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:05:12,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:05:12,915 INFO L87 Difference]: Start difference. First operand 105864 states and 171368 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 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 04:05:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:13,749 INFO L93 Difference]: Finished difference Result 211470 states and 342321 transitions. [2024-10-14 04:05:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:05:13,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-10-14 04:05:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:13,881 INFO L225 Difference]: With dead ends: 211470 [2024-10-14 04:05:13,881 INFO L226 Difference]: Without dead ends: 105866 [2024-10-14 04:05:13,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:05:13,931 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 654 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:13,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 2171 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:05:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105866 states. [2024-10-14 04:05:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105866 to 105864. [2024-10-14 04:05:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105864 states, 105863 states have (on average 1.612867574128827) internal successors, (170743), 105863 states have internal predecessors, (170743), 0 states have call successors, (0), 0 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 04:05:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105864 states to 105864 states and 170743 transitions. [2024-10-14 04:05:15,835 INFO L78 Accepts]: Start accepts. Automaton has 105864 states and 170743 transitions. Word has length 135 [2024-10-14 04:05:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:15,835 INFO L471 AbstractCegarLoop]: Abstraction has 105864 states and 170743 transitions. [2024-10-14 04:05:15,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 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 04:05:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 105864 states and 170743 transitions. [2024-10-14 04:05:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 04:05:15,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:15,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:15,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:05:15,836 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:15,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:15,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2104616215, now seen corresponding path program 1 times [2024-10-14 04:05:15,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:15,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968961171] [2024-10-14 04:05:15,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:15,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:16,096 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 04:05:16,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:16,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968961171] [2024-10-14 04:05:16,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968961171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:16,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:16,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:05:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696101361] [2024-10-14 04:05:16,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:16,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:05:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:05:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:05:16,098 INFO L87 Difference]: Start difference. First operand 105864 states and 170743 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:17,201 INFO L93 Difference]: Finished difference Result 309468 states and 499581 transitions. [2024-10-14 04:05:17,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:05:17,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-10-14 04:05:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:17,521 INFO L225 Difference]: With dead ends: 309468 [2024-10-14 04:05:17,521 INFO L226 Difference]: Without dead ends: 203864 [2024-10-14 04:05:17,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:05:17,578 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 863 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:17,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2182 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:05:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203864 states. [2024-10-14 04:05:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203864 to 203862. [2024-10-14 04:05:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203862 states, 203861 states have (on average 1.6051917728256018) internal successors, (327236), 203861 states have internal predecessors, (327236), 0 states have call successors, (0), 0 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 04:05:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203862 states to 203862 states and 327236 transitions. [2024-10-14 04:05:21,013 INFO L78 Accepts]: Start accepts. Automaton has 203862 states and 327236 transitions. Word has length 138 [2024-10-14 04:05:21,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:21,013 INFO L471 AbstractCegarLoop]: Abstraction has 203862 states and 327236 transitions. [2024-10-14 04:05:21,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 203862 states and 327236 transitions. [2024-10-14 04:05:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 04:05:21,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:21,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:21,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 04:05:21,015 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:21,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash -820502302, now seen corresponding path program 1 times [2024-10-14 04:05:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100089102] [2024-10-14 04:05:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:21,479 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 04:05:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100089102] [2024-10-14 04:05:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100089102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:21,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:21,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:05:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697915878] [2024-10-14 04:05:21,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:21,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:05:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:21,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:05:21,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:05:21,481 INFO L87 Difference]: Start difference. First operand 203862 states and 327236 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 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 04:05:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:21,994 INFO L93 Difference]: Finished difference Result 207736 states and 333045 transitions. [2024-10-14 04:05:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:05:22,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-10-14 04:05:22,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:22,777 INFO L225 Difference]: With dead ends: 207736 [2024-10-14 04:05:22,778 INFO L226 Difference]: Without dead ends: 207734 [2024-10-14 04:05:22,804 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 04:05:22,804 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:22,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2254 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207734 states. [2024-10-14 04:05:25,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207734 to 207734. [2024-10-14 04:05:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207734 states, 207733 states have (on average 1.5937814405992308) internal successors, (331081), 207733 states have internal predecessors, (331081), 0 states have call successors, (0), 0 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 04:05:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207734 states to 207734 states and 331081 transitions. [2024-10-14 04:05:25,613 INFO L78 Accepts]: Start accepts. Automaton has 207734 states and 331081 transitions. Word has length 139 [2024-10-14 04:05:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:25,613 INFO L471 AbstractCegarLoop]: Abstraction has 207734 states and 331081 transitions. [2024-10-14 04:05:25,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 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 04:05:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 207734 states and 331081 transitions. [2024-10-14 04:05:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 04:05:25,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:25,618 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:25,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 04:05:25,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1542140681, now seen corresponding path program 1 times [2024-10-14 04:05:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507068232] [2024-10-14 04:05:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 04:05:25,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507068232] [2024-10-14 04:05:25,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507068232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:25,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:25,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:05:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444116467] [2024-10-14 04:05:25,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:25,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:05:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:25,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:05:25,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:05:25,850 INFO L87 Difference]: Start difference. First operand 207734 states and 331081 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:27,910 INFO L93 Difference]: Finished difference Result 565656 states and 903742 transitions. [2024-10-14 04:05:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:05:27,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2024-10-14 04:05:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:29,521 INFO L225 Difference]: With dead ends: 565656 [2024-10-14 04:05:29,521 INFO L226 Difference]: Without dead ends: 474404 [2024-10-14 04:05:29,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 04:05:29,609 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 1501 mSDsluCounter, 2656 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:29,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 3479 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:05:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474404 states. [2024-10-14 04:05:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474404 to 333614. [2024-10-14 04:05:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333614 states, 333613 states have (on average 1.592249103002581) internal successors, (531195), 333613 states have internal predecessors, (531195), 0 states have call successors, (0), 0 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 04:05:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333614 states to 333614 states and 531195 transitions. [2024-10-14 04:05:35,584 INFO L78 Accepts]: Start accepts. Automaton has 333614 states and 531195 transitions. Word has length 175 [2024-10-14 04:05:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:35,584 INFO L471 AbstractCegarLoop]: Abstraction has 333614 states and 531195 transitions. [2024-10-14 04:05:35,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:05:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 333614 states and 531195 transitions. [2024-10-14 04:05:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 04:05:35,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:35,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:35,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 04:05:35,589 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:35,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1805766923, now seen corresponding path program 1 times [2024-10-14 04:05:35,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:35,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035877610] [2024-10-14 04:05:35,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:35,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 04:05:35,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:35,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035877610] [2024-10-14 04:05:35,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035877610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:35,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:35,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:05:35,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856677996] [2024-10-14 04:05:35,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:35,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:05:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:35,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:05:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:05:35,799 INFO L87 Difference]: Start difference. First operand 333614 states and 531195 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 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 04:05:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:38,915 INFO L93 Difference]: Finished difference Result 623672 states and 996666 transitions. [2024-10-14 04:05:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:05:38,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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 175 [2024-10-14 04:05:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:40,065 INFO L225 Difference]: With dead ends: 623672 [2024-10-14 04:05:40,065 INFO L226 Difference]: Without dead ends: 532420