./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.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.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 9e29b1c17273501647988c2dcf7c62baca572c01c9f2bd474ce3ab9b8d1b7b68 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:05:20,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:05:21,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:05:21,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:05:21,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:05:21,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:05:21,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:05:21,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:05:21,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:05:21,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:05:21,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:05:21,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:05:21,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:05:21,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:05:21,115 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:05:21,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:05:21,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:05:21,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:05:21,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:05:21,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:05:21,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:05:21,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:05:21,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:05:21,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:05:21,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:05:21,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:05:21,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:05:21,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:05:21,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:05:21,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:05:21,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:05:21,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:05:21,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:05:21,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:05:21,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:05:21,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:05:21,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:05:21,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:05:21,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:05:21,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:05:21,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:05:21,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:05:21,127 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 -> 9e29b1c17273501647988c2dcf7c62baca572c01c9f2bd474ce3ab9b8d1b7b68 [2024-10-14 04:05:21,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:05:21,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:05:21,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:05:21,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:05:21,416 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:05:21,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 04:05:22,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:05:23,211 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:05:23,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 04:05:23,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279e70754/0bc652f026f04e00b138f2633586503f/FLAG41225b8a4 [2024-10-14 04:05:23,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279e70754/0bc652f026f04e00b138f2633586503f [2024-10-14 04:05:23,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:05:23,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:05:23,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:05:23,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:05:23,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:05:23,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:05:23" (1/1) ... [2024-10-14 04:05:23,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d6e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:23, skipping insertion in model container [2024-10-14 04:05:23,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:05:23" (1/1) ... [2024-10-14 04:05:23,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:05:23,983 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13867,13880] [2024-10-14 04:05:24,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:05:24,081 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:05:24,160 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13867,13880] [2024-10-14 04:05:24,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:05:24,229 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:05:24,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24 WrapperNode [2024-10-14 04:05:24,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:05:24,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:05:24,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:05:24,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:05:24,239 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:05:24" (1/1) ... [2024-10-14 04:05:24,264 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:05:24" (1/1) ... [2024-10-14 04:05:24,351 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1455 [2024-10-14 04:05:24,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:05:24,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:05:24,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:05:24,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:05:24,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,431 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 04:05:24,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:05:24,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:05:24,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:05:24,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:05:24,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (1/1) ... [2024-10-14 04:05:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:05:24,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:05:24,565 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:05:24,570 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:05:24,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:05:24,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:05:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:05:24,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:05:24,828 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:05:24,830 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:05:26,324 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-14 04:05:26,324 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:05:26,414 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:05:26,417 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 04:05:26,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:05:26 BoogieIcfgContainer [2024-10-14 04:05:26,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:05:26,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:05:26,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:05:26,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:05:26,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:05:23" (1/3) ... [2024-10-14 04:05:26,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3474a3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:05:26, skipping insertion in model container [2024-10-14 04:05:26,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:05:24" (2/3) ... [2024-10-14 04:05:26,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3474a3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:05:26, skipping insertion in model container [2024-10-14 04:05:26,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:05:26" (3/3) ... [2024-10-14 04:05:26,430 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-14 04:05:26,453 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:05:26,454 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 04:05:26,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:05:26,563 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;@66f8de0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:05:26,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 04:05:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 347 states have (on average 1.792507204610951) internal successors, (622), 348 states have internal predecessors, (622), 0 states have call successors, (0), 0 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:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 04:05:26,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:26,599 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:26,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:26,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1253843658, now seen corresponding path program 1 times [2024-10-14 04:05:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654953385] [2024-10-14 04:05:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:27,372 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:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:27,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654953385] [2024-10-14 04:05:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654953385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:27,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:27,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325857136] [2024-10-14 04:05:27,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:27,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:27,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:27,435 INFO L87 Difference]: Start difference. First operand has 349 states, 347 states have (on average 1.792507204610951) internal successors, (622), 348 states have internal predecessors, (622), 0 states have call successors, (0), 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:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:27,605 INFO L93 Difference]: Finished difference Result 651 states and 1126 transitions. [2024-10-14 04:05:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:27,612 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:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:27,631 INFO L225 Difference]: With dead ends: 651 [2024-10-14 04:05:27,632 INFO L226 Difference]: Without dead ends: 490 [2024-10-14 04:05:27,635 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:27,639 INFO L432 NwaCegarLoop]: 612 mSDtfsCounter, 267 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1142 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:27,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1142 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:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-10-14 04:05:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 487. [2024-10-14 04:05:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.654320987654321) internal successors, (804), 486 states have internal predecessors, (804), 0 states have call successors, (0), 0 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,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 804 transitions. [2024-10-14 04:05:27,717 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 804 transitions. Word has length 117 [2024-10-14 04:05:27,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:27,718 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 804 transitions. [2024-10-14 04:05:27,719 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:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 804 transitions. [2024-10-14 04:05:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 04:05:27,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:27,727 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:27,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:05:27,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:27,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash -705528010, now seen corresponding path program 1 times [2024-10-14 04:05:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821325244] [2024-10-14 04:05:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:27,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:28,082 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:28,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:28,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821325244] [2024-10-14 04:05:28,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821325244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:28,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:28,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305619327] [2024-10-14 04:05:28,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:28,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:28,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:28,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:28,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:28,087 INFO L87 Difference]: Start difference. First operand 487 states and 804 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:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:28,167 INFO L93 Difference]: Finished difference Result 1057 states and 1752 transitions. [2024-10-14 04:05:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:28,168 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:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:28,174 INFO L225 Difference]: With dead ends: 1057 [2024-10-14 04:05:28,174 INFO L226 Difference]: Without dead ends: 762 [2024-10-14 04:05:28,176 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:28,178 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 231 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1098 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:28,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1098 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:05:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-10-14 04:05:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 758. [2024-10-14 04:05:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 1.655217965653897) internal successors, (1253), 757 states have internal predecessors, (1253), 0 states have call successors, (0), 0 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:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1253 transitions. [2024-10-14 04:05:28,232 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1253 transitions. Word has length 120 [2024-10-14 04:05:28,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:28,255 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1253 transitions. [2024-10-14 04:05:28,256 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:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1253 transitions. [2024-10-14 04:05:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 04:05:28,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:28,259 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:28,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:05:28,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:28,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1250540851, now seen corresponding path program 1 times [2024-10-14 04:05:28,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:28,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21177842] [2024-10-14 04:05:28,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:28,504 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:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:28,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21177842] [2024-10-14 04:05:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21177842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:28,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:28,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:28,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676434314] [2024-10-14 04:05:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:28,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:28,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:28,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:28,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:28,509 INFO L87 Difference]: Start difference. First operand 758 states and 1253 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:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:28,564 INFO L93 Difference]: Finished difference Result 1850 states and 3063 transitions. [2024-10-14 04:05:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:28,564 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:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:28,573 INFO L225 Difference]: With dead ends: 1850 [2024-10-14 04:05:28,574 INFO L226 Difference]: Without dead ends: 1284 [2024-10-14 04:05:28,577 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:28,578 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 224 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1099 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:28,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1099 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:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2024-10-14 04:05:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1278. [2024-10-14 04:05:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1277 states have (on average 1.6515270164447924) internal successors, (2109), 1277 states have internal predecessors, (2109), 0 states have call successors, (0), 0 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:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 2109 transitions. [2024-10-14 04:05:28,623 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 2109 transitions. Word has length 123 [2024-10-14 04:05:28,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:28,624 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 2109 transitions. [2024-10-14 04:05:28,624 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:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 2109 transitions. [2024-10-14 04:05:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 04:05:28,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:28,631 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:28,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:05:28,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:28,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1667165107, now seen corresponding path program 1 times [2024-10-14 04:05:28,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:28,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564233722] [2024-10-14 04:05:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:28,880 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:28,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:28,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564233722] [2024-10-14 04:05:28,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564233722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:28,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:28,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477106756] [2024-10-14 04:05:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:28,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:28,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:28,886 INFO L87 Difference]: Start difference. First operand 1278 states and 2109 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:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:28,949 INFO L93 Difference]: Finished difference Result 3370 states and 5559 transitions. [2024-10-14 04:05:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:28,950 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:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:28,961 INFO L225 Difference]: With dead ends: 3370 [2024-10-14 04:05:28,962 INFO L226 Difference]: Without dead ends: 2284 [2024-10-14 04:05:28,965 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:28,966 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 216 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:28,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1097 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:05:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2024-10-14 04:05:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2274. [2024-10-14 04:05:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2273 states have (on average 1.640563132424109) internal successors, (3729), 2273 states have internal predecessors, (3729), 0 states have call successors, (0), 0 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:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3729 transitions. [2024-10-14 04:05:29,026 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3729 transitions. Word has length 126 [2024-10-14 04:05:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:29,027 INFO L471 AbstractCegarLoop]: Abstraction has 2274 states and 3729 transitions. [2024-10-14 04:05:29,027 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:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3729 transitions. [2024-10-14 04:05:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 04:05:29,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:29,029 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:29,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:05:29,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:29,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2123898576, now seen corresponding path program 1 times [2024-10-14 04:05:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549186844] [2024-10-14 04:05:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:29,366 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:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549186844] [2024-10-14 04:05:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549186844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:29,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:29,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:05:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773718107] [2024-10-14 04:05:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:29,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:05:29,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:05:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:05:29,369 INFO L87 Difference]: Start difference. First operand 2274 states and 3729 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:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:29,785 INFO L93 Difference]: Finished difference Result 11926 states and 19705 transitions. [2024-10-14 04:05:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 04:05:29,786 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:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:29,826 INFO L225 Difference]: With dead ends: 11926 [2024-10-14 04:05:29,827 INFO L226 Difference]: Without dead ends: 9844 [2024-10-14 04:05:29,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:05:29,838 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 2047 mSDsluCounter, 5076 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2047 SdHoareTripleChecker+Valid, 5655 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:29,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2047 Valid, 5655 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 04:05:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9844 states. [2024-10-14 04:05:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9844 to 4219. [2024-10-14 04:05:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4219 states, 4218 states have (on average 1.6403508771929824) internal successors, (6919), 4218 states have internal predecessors, (6919), 0 states have call successors, (0), 0 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:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 4219 states and 6919 transitions. [2024-10-14 04:05:30,061 INFO L78 Accepts]: Start accepts. Automaton has 4219 states and 6919 transitions. Word has length 129 [2024-10-14 04:05:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:30,062 INFO L471 AbstractCegarLoop]: Abstraction has 4219 states and 6919 transitions. [2024-10-14 04:05:30,062 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:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4219 states and 6919 transitions. [2024-10-14 04:05:30,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 04:05:30,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:30,067 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:30,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:05:30,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:30,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:30,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1483408406, now seen corresponding path program 1 times [2024-10-14 04:05:30,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:30,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927057168] [2024-10-14 04:05:30,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:30,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:30,311 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:30,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:30,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927057168] [2024-10-14 04:05:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927057168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:30,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:30,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:05:30,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327541427] [2024-10-14 04:05:30,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:30,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:05:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:30,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:05:30,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:05:30,316 INFO L87 Difference]: Start difference. First operand 4219 states and 6919 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:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:30,472 INFO L93 Difference]: Finished difference Result 12378 states and 20400 transitions. [2024-10-14 04:05:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:05:30,473 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:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:30,508 INFO L225 Difference]: With dead ends: 12378 [2024-10-14 04:05:30,508 INFO L226 Difference]: Without dead ends: 8351 [2024-10-14 04:05:30,518 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:30,519 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 758 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1911 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:30,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1911 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:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8351 states. [2024-10-14 04:05:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8351 to 6268. [2024-10-14 04:05:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 6267 states have (on average 1.642731769586724) internal successors, (10295), 6267 states have internal predecessors, (10295), 0 states have call successors, (0), 0 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:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 10295 transitions. [2024-10-14 04:05:30,749 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 10295 transitions. Word has length 130 [2024-10-14 04:05:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:30,750 INFO L471 AbstractCegarLoop]: Abstraction has 6268 states and 10295 transitions. [2024-10-14 04:05:30,750 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:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 10295 transitions. [2024-10-14 04:05:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:05:30,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:30,754 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:30,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:05:30,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:30,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1196475703, now seen corresponding path program 1 times [2024-10-14 04:05:30,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:30,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277613940] [2024-10-14 04:05:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:30,939 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:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277613940] [2024-10-14 04:05:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277613940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:30,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:05:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467502239] [2024-10-14 04:05:30,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:30,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:05:30,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:30,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:05:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:05:30,943 INFO L87 Difference]: Start difference. First operand 6268 states and 10295 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:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:31,152 INFO L93 Difference]: Finished difference Result 18420 states and 30328 transitions. [2024-10-14 04:05:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:05:31,153 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:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:31,190 INFO L225 Difference]: With dead ends: 18420 [2024-10-14 04:05:31,191 INFO L226 Difference]: Without dead ends: 12344 [2024-10-14 04:05:31,203 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:31,205 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 758 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1900 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:31,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1900 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:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12344 states. [2024-10-14 04:05:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12344 to 9282. [2024-10-14 04:05:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9282 states, 9281 states have (on average 1.641094709621808) internal successors, (15231), 9281 states have internal predecessors, (15231), 0 states have call successors, (0), 0 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:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9282 states to 9282 states and 15231 transitions. [2024-10-14 04:05:31,510 INFO L78 Accepts]: Start accepts. Automaton has 9282 states and 15231 transitions. Word has length 131 [2024-10-14 04:05:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:31,511 INFO L471 AbstractCegarLoop]: Abstraction has 9282 states and 15231 transitions. [2024-10-14 04:05:31,511 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:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand 9282 states and 15231 transitions. [2024-10-14 04:05:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 04:05:31,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:31,517 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:31,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:05:31,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:31,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:31,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1621904815, now seen corresponding path program 1 times [2024-10-14 04:05:31,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:31,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162277190] [2024-10-14 04:05:31,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:31,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:31,747 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:31,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162277190] [2024-10-14 04:05:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162277190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:31,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:05:31,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478701846] [2024-10-14 04:05:31,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:31,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:05:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:31,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:05:31,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:05:31,750 INFO L87 Difference]: Start difference. First operand 9282 states and 15231 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:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:31,942 INFO L93 Difference]: Finished difference Result 27308 states and 44916 transitions. [2024-10-14 04:05:31,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:05:31,943 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:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:31,989 INFO L225 Difference]: With dead ends: 27308 [2024-10-14 04:05:31,989 INFO L226 Difference]: Without dead ends: 18218 [2024-10-14 04:05:32,008 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:32,010 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 756 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1829 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:32,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1829 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:05:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18218 states. [2024-10-14 04:05:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18218 to 13716. [2024-10-14 04:05:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13716 states, 13715 states have (on average 1.6394458621946773) internal successors, (22485), 13715 states have internal predecessors, (22485), 0 states have call successors, (0), 0 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:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13716 states to 13716 states and 22485 transitions. [2024-10-14 04:05:32,496 INFO L78 Accepts]: Start accepts. Automaton has 13716 states and 22485 transitions. Word has length 132 [2024-10-14 04:05:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:32,497 INFO L471 AbstractCegarLoop]: Abstraction has 13716 states and 22485 transitions. [2024-10-14 04:05:32,498 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:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 13716 states and 22485 transitions. [2024-10-14 04:05:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 04:05:32,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:32,505 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:32,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:05:32,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:32,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:32,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1796430653, now seen corresponding path program 1 times [2024-10-14 04:05:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:32,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072675471] [2024-10-14 04:05:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:32,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:32,655 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:32,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:32,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072675471] [2024-10-14 04:05:32,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072675471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:32,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:32,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840947530] [2024-10-14 04:05:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:32,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:32,657 INFO L87 Difference]: Start difference. First operand 13716 states and 22485 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:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:32,851 INFO L93 Difference]: Finished difference Result 30563 states and 50299 transitions. [2024-10-14 04:05:32,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:32,851 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:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:32,896 INFO L225 Difference]: With dead ends: 30563 [2024-10-14 04:05:32,897 INFO L226 Difference]: Without dead ends: 21068 [2024-10-14 04:05:32,917 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:32,918 INFO L432 NwaCegarLoop]: 766 mSDtfsCounter, 237 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1293 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:32,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1293 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:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21068 states. [2024-10-14 04:05:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21068 to 21066. [2024-10-14 04:05:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21066 states, 21065 states have (on average 1.6386897697602658) internal successors, (34519), 21065 states have internal predecessors, (34519), 0 states have call successors, (0), 0 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:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21066 states to 21066 states and 34519 transitions. [2024-10-14 04:05:33,414 INFO L78 Accepts]: Start accepts. Automaton has 21066 states and 34519 transitions. Word has length 133 [2024-10-14 04:05:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:33,415 INFO L471 AbstractCegarLoop]: Abstraction has 21066 states and 34519 transitions. [2024-10-14 04:05:33,415 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:33,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21066 states and 34519 transitions. [2024-10-14 04:05:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 04:05:33,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:33,418 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:33,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:05:33,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:33,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash 931532829, now seen corresponding path program 1 times [2024-10-14 04:05:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:33,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281108649] [2024-10-14 04:05:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:33,672 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:33,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:33,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281108649] [2024-10-14 04:05:33,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281108649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:33,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:33,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:33,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194446023] [2024-10-14 04:05:33,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:33,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:33,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:33,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:33,675 INFO L87 Difference]: Start difference. First operand 21066 states and 34519 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:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:33,959 INFO L93 Difference]: Finished difference Result 46559 states and 76367 transitions. [2024-10-14 04:05:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:33,960 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:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:34,032 INFO L225 Difference]: With dead ends: 46559 [2024-10-14 04:05:34,033 INFO L226 Difference]: Without dead ends: 32026 [2024-10-14 04:05:34,064 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:34,065 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 230 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1268 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:34,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:05:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32026 states. [2024-10-14 04:05:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32026 to 32024. [2024-10-14 04:05:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32024 states, 32023 states have (on average 1.633825687786903) internal successors, (52320), 32023 states have internal predecessors, (52320), 0 states have call successors, (0), 0 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:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32024 states to 32024 states and 52320 transitions. [2024-10-14 04:05:34,801 INFO L78 Accepts]: Start accepts. Automaton has 32024 states and 52320 transitions. Word has length 133 [2024-10-14 04:05:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:34,802 INFO L471 AbstractCegarLoop]: Abstraction has 32024 states and 52320 transitions. [2024-10-14 04:05:34,802 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:34,802 INFO L276 IsEmpty]: Start isEmpty. Operand 32024 states and 52320 transitions. [2024-10-14 04:05:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 04:05:34,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:34,804 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:34,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:05:34,804 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:34,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1207170366, now seen corresponding path program 1 times [2024-10-14 04:05:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234094749] [2024-10-14 04:05:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:35,028 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:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234094749] [2024-10-14 04:05:35,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234094749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:35,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:35,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:05:35,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338789405] [2024-10-14 04:05:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:35,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:05:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:05:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:05:35,031 INFO L87 Difference]: Start difference. First operand 32024 states and 52320 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:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:35,829 INFO L93 Difference]: Finished difference Result 95012 states and 155764 transitions. [2024-10-14 04:05:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:05:35,830 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:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:36,049 INFO L225 Difference]: With dead ends: 95012 [2024-10-14 04:05:36,049 INFO L226 Difference]: Without dead ends: 63204 [2024-10-14 04:05:36,184 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:36,188 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 754 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1909 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:36,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1909 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:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63204 states. [2024-10-14 04:05:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63204 to 47480. [2024-10-14 04:05:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47480 states, 47479 states have (on average 1.6328692685187136) internal successors, (77527), 47479 states have internal predecessors, (77527), 0 states have call successors, (0), 0 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:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47480 states to 47480 states and 77527 transitions. [2024-10-14 04:05:37,184 INFO L78 Accepts]: Start accepts. Automaton has 47480 states and 77527 transitions. Word has length 133 [2024-10-14 04:05:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:37,185 INFO L471 AbstractCegarLoop]: Abstraction has 47480 states and 77527 transitions. [2024-10-14 04:05:37,185 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:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 47480 states and 77527 transitions. [2024-10-14 04:05:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 04:05:37,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:37,187 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:37,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:05:37,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:37,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash 630738377, now seen corresponding path program 1 times [2024-10-14 04:05:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:37,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088762218] [2024-10-14 04:05:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:37,600 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:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:37,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088762218] [2024-10-14 04:05:37,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088762218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:37,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:37,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:37,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602125419] [2024-10-14 04:05:37,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:37,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:37,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:37,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:37,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:37,603 INFO L87 Difference]: Start difference. First operand 47480 states and 77527 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:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:38,125 INFO L93 Difference]: Finished difference Result 104867 states and 171377 transitions. [2024-10-14 04:05:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:38,126 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:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:38,284 INFO L225 Difference]: With dead ends: 104867 [2024-10-14 04:05:38,284 INFO L226 Difference]: Without dead ends: 71738 [2024-10-14 04:05:38,323 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:38,324 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 223 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1235 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:38,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1235 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:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71738 states. [2024-10-14 04:05:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71738 to 71736. [2024-10-14 04:05:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71736 states, 71735 states have (on average 1.6268627587648985) internal successors, (116703), 71735 states have internal predecessors, (116703), 0 states have call successors, (0), 0 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:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71736 states to 71736 states and 116703 transitions. [2024-10-14 04:05:39,526 INFO L78 Accepts]: Start accepts. Automaton has 71736 states and 116703 transitions. Word has length 133 [2024-10-14 04:05:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:39,527 INFO L471 AbstractCegarLoop]: Abstraction has 71736 states and 116703 transitions. [2024-10-14 04:05:39,527 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:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 71736 states and 116703 transitions. [2024-10-14 04:05:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 04:05:39,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:39,529 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] [2024-10-14 04:05:39,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:05:39,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:39,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1184073123, now seen corresponding path program 1 times [2024-10-14 04:05:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119844589] [2024-10-14 04:05:39,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:39,966 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:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:39,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119844589] [2024-10-14 04:05:39,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119844589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:39,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:39,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:05:39,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741843910] [2024-10-14 04:05:39,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:39,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:05:39,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:39,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:05:39,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:05:39,969 INFO L87 Difference]: Start difference. First operand 71736 states and 116703 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:40,476 INFO L93 Difference]: Finished difference Result 156754 states and 255330 transitions. [2024-10-14 04:05:40,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:05:40,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-10-14 04:05:40,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:41,022 INFO L225 Difference]: With dead ends: 156754 [2024-10-14 04:05:41,022 INFO L226 Difference]: Without dead ends: 106562 [2024-10-14 04:05:41,067 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:41,072 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 214 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1200 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:41,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1200 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:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106562 states. [2024-10-14 04:05:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106562 to 106560. [2024-10-14 04:05:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106560 states, 106559 states have (on average 1.6191687234302123) internal successors, (172537), 106559 states have internal predecessors, (172537), 0 states have call successors, (0), 0 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:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106560 states to 106560 states and 172537 transitions. [2024-10-14 04:05:43,290 INFO L78 Accepts]: Start accepts. Automaton has 106560 states and 172537 transitions. Word has length 134 [2024-10-14 04:05:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:43,290 INFO L471 AbstractCegarLoop]: Abstraction has 106560 states and 172537 transitions. [2024-10-14 04:05:43,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 106560 states and 172537 transitions. [2024-10-14 04:05:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 04:05:43,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:43,292 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:43,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:05:43,293 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:43,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:43,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1067752401, now seen corresponding path program 1 times [2024-10-14 04:05:43,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:43,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898570368] [2024-10-14 04:05:43,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:43,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:05:43,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:43,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898570368] [2024-10-14 04:05:43,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898570368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:43,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:43,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:05:43,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709656787] [2024-10-14 04:05:43,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:43,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:05:43,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:43,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:05:43,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:05:43,702 INFO L87 Difference]: Start difference. First operand 106560 states and 172537 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:44,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:44,806 INFO L93 Difference]: Finished difference Result 212862 states and 344659 transitions. [2024-10-14 04:05:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:05:44,807 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:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:45,058 INFO L225 Difference]: With dead ends: 212862 [2024-10-14 04:05:45,058 INFO L226 Difference]: Without dead ends: 106562 [2024-10-14 04:05:45,112 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:45,113 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 222 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:05:45,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 2718 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:05:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106562 states. [2024-10-14 04:05:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106562 to 106560. [2024-10-14 04:05:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106560 states, 106559 states have (on average 1.6133034281477867) internal successors, (171912), 106559 states have internal predecessors, (171912), 0 states have call successors, (0), 0 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:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106560 states to 106560 states and 171912 transitions. [2024-10-14 04:05:46,944 INFO L78 Accepts]: Start accepts. Automaton has 106560 states and 171912 transitions. Word has length 135 [2024-10-14 04:05:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:46,944 INFO L471 AbstractCegarLoop]: Abstraction has 106560 states and 171912 transitions. [2024-10-14 04:05:46,945 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:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 106560 states and 171912 transitions. [2024-10-14 04:05:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 04:05:46,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:46,951 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:46,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:05:46,951 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:46,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1362654499, now seen corresponding path program 1 times [2024-10-14 04:05:46,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:46,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895703235] [2024-10-14 04:05:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:46,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:47,490 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:47,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:47,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895703235] [2024-10-14 04:05:47,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895703235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:47,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:47,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:05:47,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36859075] [2024-10-14 04:05:47,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:47,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:05:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:47,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:05:47,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:05:47,493 INFO L87 Difference]: Start difference. First operand 106560 states and 171912 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:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:49,189 INFO L93 Difference]: Finished difference Result 311502 states and 503007 transitions. [2024-10-14 04:05:49,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:05:49,190 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:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:49,603 INFO L225 Difference]: With dead ends: 311502 [2024-10-14 04:05:49,603 INFO L226 Difference]: Without dead ends: 205202 [2024-10-14 04:05:49,646 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:49,649 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 871 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2189 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:49,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2189 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:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205202 states. [2024-10-14 04:05:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205202 to 205200. [2024-10-14 04:05:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205200 states, 205199 states have (on average 1.6057241994356697) internal successors, (329493), 205199 states have internal predecessors, (329493), 0 states have call successors, (0), 0 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:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205200 states to 205200 states and 329493 transitions. [2024-10-14 04:05:52,453 INFO L78 Accepts]: Start accepts. Automaton has 205200 states and 329493 transitions. Word has length 138 [2024-10-14 04:05:52,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:52,453 INFO L471 AbstractCegarLoop]: Abstraction has 205200 states and 329493 transitions. [2024-10-14 04:05:52,454 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:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 205200 states and 329493 transitions. [2024-10-14 04:05:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 04:05:52,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:52,455 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:52,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 04:05:52,455 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:52,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash -709292564, now seen corresponding path program 1 times [2024-10-14 04:05:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:52,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437624644] [2024-10-14 04:05:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:54,037 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:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437624644] [2024-10-14 04:05:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437624644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:54,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:54,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:05:54,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911579637] [2024-10-14 04:05:54,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:05:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:05:54,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:05:54,040 INFO L87 Difference]: Start difference. First operand 205200 states and 329493 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:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:05:54,947 INFO L93 Difference]: Finished difference Result 209074 states and 335302 transitions. [2024-10-14 04:05:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:05:54,948 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:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:05:55,403 INFO L225 Difference]: With dead ends: 209074 [2024-10-14 04:05:55,404 INFO L226 Difference]: Without dead ends: 209072 [2024-10-14 04:05:55,481 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:55,482 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2262 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:55,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2262 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:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209072 states. [2024-10-14 04:05:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209072 to 209072. [2024-10-14 04:05:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209072 states, 209071 states have (on average 1.5943770298128388) internal successors, (333338), 209071 states have internal predecessors, (333338), 0 states have call successors, (0), 0 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:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209072 states to 209072 states and 333338 transitions. [2024-10-14 04:05:59,529 INFO L78 Accepts]: Start accepts. Automaton has 209072 states and 333338 transitions. Word has length 139 [2024-10-14 04:05:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:05:59,530 INFO L471 AbstractCegarLoop]: Abstraction has 209072 states and 333338 transitions. [2024-10-14 04:05:59,530 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:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 209072 states and 333338 transitions. [2024-10-14 04:05:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 04:05:59,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:05:59,534 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:59,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 04:05:59,535 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:05:59,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:05:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash -181794411, now seen corresponding path program 1 times [2024-10-14 04:05:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:05:59,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944458579] [2024-10-14 04:05:59,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:05:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:05:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:05:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 04:05:59,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:05:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944458579] [2024-10-14 04:05:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944458579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:05:59,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:05:59,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:05:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689307971] [2024-10-14 04:05:59,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:05:59,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:05:59,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:05:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:05:59,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:05:59,822 INFO L87 Difference]: Start difference. First operand 209072 states and 333338 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:06:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:06:02,345 INFO L93 Difference]: Finished difference Result 570402 states and 912111 transitions. [2024-10-14 04:06:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:06:02,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2024-10-14 04:06:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:06:03,436 INFO L225 Difference]: With dead ends: 570402 [2024-10-14 04:06:03,436 INFO L226 Difference]: Without dead ends: 477400 [2024-10-14 04:06:03,681 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:06:03,682 INFO L432 NwaCegarLoop]: 820 mSDtfsCounter, 1533 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:06:03,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 3385 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:06:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477400 states. [2024-10-14 04:06:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477400 to 336136. [2024-10-14 04:06:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336136 states, 336135 states have (on average 1.5929076115251313) internal successors, (535432), 336135 states have internal predecessors, (535432), 0 states have call successors, (0), 0 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:06:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336136 states to 336136 states and 535432 transitions. [2024-10-14 04:06:11,526 INFO L78 Accepts]: Start accepts. Automaton has 336136 states and 535432 transitions. Word has length 175 [2024-10-14 04:06:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:06:11,527 INFO L471 AbstractCegarLoop]: Abstraction has 336136 states and 535432 transitions. [2024-10-14 04:06:11,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:06:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 336136 states and 535432 transitions. [2024-10-14 04:06:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 04:06:11,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:06:11,545 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:06:11,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 04:06:11,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:06:11,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:06:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1046692235, now seen corresponding path program 1 times [2024-10-14 04:06:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:06:11,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271487054] [2024-10-14 04:06:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:06:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:06:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:06:11,839 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:06:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:06:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271487054] [2024-10-14 04:06:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271487054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:06:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:06:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:06:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905022243] [2024-10-14 04:06:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:06:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:06:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:06:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:06:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:06:11,842 INFO L87 Difference]: Start difference. First operand 336136 states and 535432 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:06:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:06:14,470 INFO L93 Difference]: Finished difference Result 641804 states and 1026411 transitions. [2024-10-14 04:06:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:06:14,470 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:06:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:06:15,650 INFO L225 Difference]: With dead ends: 641804 [2024-10-14 04:06:15,650 INFO L226 Difference]: Without dead ends: 549952 [2024-10-14 04:06:15,856 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:06:15,856 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 1519 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 3608 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:06:15,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 3608 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:06:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549952 states.