./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_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_floodmax.3.1.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 291c2115713bbaa0f9f6deebfd096e226de91dfa7091a11105c0815d1cda6526 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:35:00,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:35:01,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:35:01,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:35:01,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:35:01,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:35:01,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:35:01,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:35:01,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:35:01,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:35:01,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:35:01,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:35:01,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:35:01,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:35:01,127 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:35:01,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:35:01,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:35:01,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:35:01,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:35:01,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:35:01,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:35:01,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:35:01,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:35:01,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:35:01,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:35:01,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:35:01,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:35:01,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:35:01,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:35:01,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:35:01,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:35:01,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:35:01,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:35:01,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:35:01,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:35:01,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:35:01,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:35:01,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:35:01,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:35:01,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:35:01,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:35:01,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:35:01,138 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 -> 291c2115713bbaa0f9f6deebfd096e226de91dfa7091a11105c0815d1cda6526 [2024-10-24 01:35:01,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:35:01,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:35:01,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:35:01,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:35:01,428 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:35:01,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:35:02,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:35:03,167 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:35:03,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:35:03,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15b29c90/4f796c23360247fa8eb4cec7092febd8/FLAGac34bcce2 [2024-10-24 01:35:03,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15b29c90/4f796c23360247fa8eb4cec7092febd8 [2024-10-24 01:35:03,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:35:03,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:35:03,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:35:03,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:35:03,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:35:03,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:35:03" (1/1) ... [2024-10-24 01:35:03,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22dfb9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:03, skipping insertion in model container [2024-10-24 01:35:03,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:35:03" (1/1) ... [2024-10-24 01:35:03,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:35:03,828 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_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7181,7194] [2024-10-24 01:35:03,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:35:03,897 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:35:03,960 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_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7181,7194] [2024-10-24 01:35:03,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:35:04,012 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:35:04,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04 WrapperNode [2024-10-24 01:35:04,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:35:04,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:35:04,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:35:04,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:35:04,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,080 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 616 [2024-10-24 01:35:04,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:35:04,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:35:04,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:35:04,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:35:04,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,122 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-24 01:35:04,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:35:04,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:35:04,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:35:04,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:35:04,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (1/1) ... [2024-10-24 01:35:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:35:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:35:04,207 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-24 01:35:04,214 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-24 01:35:04,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:35:04,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:35:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:35:04,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:35:04,388 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:35:04,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:35:05,059 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-10-24 01:35:05,059 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:35:05,116 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:35:05,116 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:35:05,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:35:05 BoogieIcfgContainer [2024-10-24 01:35:05,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:35:05,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:35:05,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:35:05,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:35:05,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:35:03" (1/3) ... [2024-10-24 01:35:05,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748d0070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:35:05, skipping insertion in model container [2024-10-24 01:35:05,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:35:04" (2/3) ... [2024-10-24 01:35:05,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748d0070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:35:05, skipping insertion in model container [2024-10-24 01:35:05,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:35:05" (3/3) ... [2024-10-24 01:35:05,129 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:35:05,147 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:35:05,147 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:35:05,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:35:05,227 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;@22ef9945, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:35:05,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:35:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.7615384615384615) internal successors, (229), 131 states have internal predecessors, (229), 0 states have call successors, (0), 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-24 01:35:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:35:05,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:05,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:05,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:05,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1826198016, now seen corresponding path program 1 times [2024-10-24 01:35:05,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:05,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643315871] [2024-10-24 01:35:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:05,796 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-24 01:35:05,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643315871] [2024-10-24 01:35:05,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643315871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:05,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:05,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:05,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90871979] [2024-10-24 01:35:05,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:05,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:05,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:05,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:05,829 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.7615384615384615) internal successors, (229), 131 states have internal predecessors, (229), 0 states have call successors, (0), 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 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:05,938 INFO L93 Difference]: Finished difference Result 293 states and 496 transitions. [2024-10-24 01:35:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:35:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-24 01:35:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:05,953 INFO L225 Difference]: With dead ends: 293 [2024-10-24 01:35:05,953 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 01:35:05,956 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-24 01:35:05,959 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 131 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 398 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-24 01:35:05,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 398 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 01:35:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2024-10-24 01:35:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.6) internal successors, (320), 200 states have internal predecessors, (320), 0 states have call successors, (0), 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-24 01:35:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 320 transitions. [2024-10-24 01:35:06,005 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 320 transitions. Word has length 49 [2024-10-24 01:35:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:06,005 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 320 transitions. [2024-10-24 01:35:06,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 320 transitions. [2024-10-24 01:35:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 01:35:06,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:06,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:06,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:35:06,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:06,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -383663571, now seen corresponding path program 1 times [2024-10-24 01:35:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:06,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354140047] [2024-10-24 01:35:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:06,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:06,243 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-24 01:35:06,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:06,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354140047] [2024-10-24 01:35:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354140047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:06,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:06,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494191740] [2024-10-24 01:35:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:06,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:06,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:06,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:06,252 INFO L87 Difference]: Start difference. First operand 201 states and 320 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:06,349 INFO L93 Difference]: Finished difference Result 495 states and 804 transitions. [2024-10-24 01:35:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:35:06,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-24 01:35:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:06,352 INFO L225 Difference]: With dead ends: 495 [2024-10-24 01:35:06,352 INFO L226 Difference]: Without dead ends: 341 [2024-10-24 01:35:06,357 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-24 01:35:06,358 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 118 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 383 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-24 01:35:06,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 383 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-24 01:35:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2024-10-24 01:35:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.6130952380952381) internal successors, (542), 336 states have internal predecessors, (542), 0 states have call successors, (0), 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-24 01:35:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 542 transitions. [2024-10-24 01:35:06,395 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 542 transitions. Word has length 51 [2024-10-24 01:35:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 542 transitions. [2024-10-24 01:35:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 542 transitions. [2024-10-24 01:35:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:35:06,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:06,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:06,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:35:06,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:06,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:06,399 INFO L85 PathProgramCache]: Analyzing trace with hash -931161248, now seen corresponding path program 1 times [2024-10-24 01:35:06,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:06,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887465331] [2024-10-24 01:35:06,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:06,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:06,559 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-24 01:35:06,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:06,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887465331] [2024-10-24 01:35:06,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887465331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:06,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:06,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:06,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660091159] [2024-10-24 01:35:06,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:06,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:06,564 INFO L87 Difference]: Start difference. First operand 337 states and 542 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:06,602 INFO L93 Difference]: Finished difference Result 889 states and 1444 transitions. [2024-10-24 01:35:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:35:06,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-24 01:35:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:06,606 INFO L225 Difference]: With dead ends: 889 [2024-10-24 01:35:06,606 INFO L226 Difference]: Without dead ends: 599 [2024-10-24 01:35:06,608 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-24 01:35:06,612 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 113 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 384 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-24 01:35:06,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 384 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-10-24 01:35:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 593. [2024-10-24 01:35:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 1.6114864864864864) internal successors, (954), 592 states have internal predecessors, (954), 0 states have call successors, (0), 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-24 01:35:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 954 transitions. [2024-10-24 01:35:06,648 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 954 transitions. Word has length 53 [2024-10-24 01:35:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:06,649 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 954 transitions. [2024-10-24 01:35:06,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 954 transitions. [2024-10-24 01:35:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:35:06,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:06,652 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] [2024-10-24 01:35:06,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:35:06,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:06,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash 648932685, now seen corresponding path program 1 times [2024-10-24 01:35:06,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:06,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712631292] [2024-10-24 01:35:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:06,833 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-24 01:35:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712631292] [2024-10-24 01:35:06,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712631292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:06,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:06,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:35:06,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165222497] [2024-10-24 01:35:06,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:06,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:35:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:06,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:35:06,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:35:06,838 INFO L87 Difference]: Start difference. First operand 593 states and 954 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-24 01:35:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:07,018 INFO L93 Difference]: Finished difference Result 2581 states and 4240 transitions. [2024-10-24 01:35:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:35:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-24 01:35:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:07,029 INFO L225 Difference]: With dead ends: 2581 [2024-10-24 01:35:07,030 INFO L226 Difference]: Without dead ends: 2035 [2024-10-24 01:35:07,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:35:07,034 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 855 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:07,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1286 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2024-10-24 01:35:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1070. [2024-10-24 01:35:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 1.6202057998129094) internal successors, (1732), 1069 states have internal predecessors, (1732), 0 states have call successors, (0), 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-24 01:35:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1732 transitions. [2024-10-24 01:35:07,071 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1732 transitions. Word has length 55 [2024-10-24 01:35:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:07,073 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1732 transitions. [2024-10-24 01:35:07,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-24 01:35:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1732 transitions. [2024-10-24 01:35:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 01:35:07,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:07,093 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] [2024-10-24 01:35:07,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:35:07,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1420427451, now seen corresponding path program 1 times [2024-10-24 01:35:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525476723] [2024-10-24 01:35:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:07,231 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-24 01:35:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525476723] [2024-10-24 01:35:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525476723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:07,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:07,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:35:07,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804236550] [2024-10-24 01:35:07,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:07,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:35:07,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:07,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:35:07,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:35:07,238 INFO L87 Difference]: Start difference. First operand 1070 states and 1732 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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-24 01:35:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:07,320 INFO L93 Difference]: Finished difference Result 3135 states and 5139 transitions. [2024-10-24 01:35:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:35:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-24 01:35:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:07,331 INFO L225 Difference]: With dead ends: 3135 [2024-10-24 01:35:07,332 INFO L226 Difference]: Without dead ends: 2112 [2024-10-24 01:35:07,334 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-24 01:35:07,335 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 404 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 604 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-24 01:35:07,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 604 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2024-10-24 01:35:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1582. [2024-10-24 01:35:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.6274509803921569) internal successors, (2573), 1581 states have internal predecessors, (2573), 0 states have call successors, (0), 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-24 01:35:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2573 transitions. [2024-10-24 01:35:07,376 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2573 transitions. Word has length 56 [2024-10-24 01:35:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:07,376 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2573 transitions. [2024-10-24 01:35:07,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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-24 01:35:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2573 transitions. [2024-10-24 01:35:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 01:35:07,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:07,379 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] [2024-10-24 01:35:07,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:35:07,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:07,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1141524204, now seen corresponding path program 1 times [2024-10-24 01:35:07,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:07,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879744001] [2024-10-24 01:35:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:07,534 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-24 01:35:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:07,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879744001] [2024-10-24 01:35:07,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879744001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:07,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:07,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:35:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674248660] [2024-10-24 01:35:07,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:07,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:35:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:07,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:35:07,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:35:07,536 INFO L87 Difference]: Start difference. First operand 1582 states and 2573 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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-24 01:35:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:07,619 INFO L93 Difference]: Finished difference Result 4603 states and 7537 transitions. [2024-10-24 01:35:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:35:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-24 01:35:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:07,634 INFO L225 Difference]: With dead ends: 4603 [2024-10-24 01:35:07,634 INFO L226 Difference]: Without dead ends: 3068 [2024-10-24 01:35:07,638 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-24 01:35:07,640 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 402 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 645 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-24 01:35:07,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 645 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2024-10-24 01:35:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2313. [2024-10-24 01:35:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2312 states have (on average 1.6262975778546713) internal successors, (3760), 2312 states have internal predecessors, (3760), 0 states have call successors, (0), 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-24 01:35:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3760 transitions. [2024-10-24 01:35:07,729 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3760 transitions. Word has length 57 [2024-10-24 01:35:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:07,729 INFO L471 AbstractCegarLoop]: Abstraction has 2313 states and 3760 transitions. [2024-10-24 01:35:07,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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-24 01:35:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3760 transitions. [2024-10-24 01:35:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 01:35:07,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:07,733 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] [2024-10-24 01:35:07,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:35:07,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:07,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash 168542636, now seen corresponding path program 1 times [2024-10-24 01:35:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744634722] [2024-10-24 01:35:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:07,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:07,817 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-24 01:35:07,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:07,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744634722] [2024-10-24 01:35:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744634722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:07,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:07,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:07,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961827512] [2024-10-24 01:35:07,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:07,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:07,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:07,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:07,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:07,820 INFO L87 Difference]: Start difference. First operand 2313 states and 3760 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-24 01:35:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:07,860 INFO L93 Difference]: Finished difference Result 5103 states and 8335 transitions. [2024-10-24 01:35:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:35:07,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-24 01:35:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:07,873 INFO L225 Difference]: With dead ends: 5103 [2024-10-24 01:35:07,873 INFO L226 Difference]: Without dead ends: 3494 [2024-10-24 01:35:07,878 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-24 01:35:07,879 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 117 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 449 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-24 01:35:07,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 449 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2024-10-24 01:35:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3492. [2024-10-24 01:35:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3492 states, 3491 states have (on average 1.6230306502434833) internal successors, (5666), 3491 states have internal predecessors, (5666), 0 states have call successors, (0), 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-24 01:35:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 5666 transitions. [2024-10-24 01:35:07,956 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 5666 transitions. Word has length 58 [2024-10-24 01:35:07,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:07,957 INFO L471 AbstractCegarLoop]: Abstraction has 3492 states and 5666 transitions. [2024-10-24 01:35:07,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-24 01:35:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 5666 transitions. [2024-10-24 01:35:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 01:35:07,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:07,959 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] [2024-10-24 01:35:07,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:35:07,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:07,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2133566557, now seen corresponding path program 1 times [2024-10-24 01:35:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760728009] [2024-10-24 01:35:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:07,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:08,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-24 01:35:08,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760728009] [2024-10-24 01:35:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760728009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:08,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:08,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:08,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279053733] [2024-10-24 01:35:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:08,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:08,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:08,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:08,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:08,041 INFO L87 Difference]: Start difference. First operand 3492 states and 5666 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-24 01:35:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:08,084 INFO L93 Difference]: Finished difference Result 6910 states and 11266 transitions. [2024-10-24 01:35:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:35:08,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-24 01:35:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:08,102 INFO L225 Difference]: With dead ends: 6910 [2024-10-24 01:35:08,102 INFO L226 Difference]: Without dead ends: 4910 [2024-10-24 01:35:08,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:08,109 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 112 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 432 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-24 01:35:08,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 432 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4910 states. [2024-10-24 01:35:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4910 to 4908. [2024-10-24 01:35:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 4907 states have (on average 1.618911758712044) internal successors, (7944), 4907 states have internal predecessors, (7944), 0 states have call successors, (0), 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-24 01:35:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 7944 transitions. [2024-10-24 01:35:08,250 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 7944 transitions. Word has length 58 [2024-10-24 01:35:08,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:08,250 INFO L471 AbstractCegarLoop]: Abstraction has 4908 states and 7944 transitions. [2024-10-24 01:35:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-24 01:35:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 7944 transitions. [2024-10-24 01:35:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 01:35:08,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:08,252 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] [2024-10-24 01:35:08,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:35:08,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:08,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1080900116, now seen corresponding path program 1 times [2024-10-24 01:35:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:08,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621467774] [2024-10-24 01:35:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:08,361 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-24 01:35:08,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:08,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621467774] [2024-10-24 01:35:08,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621467774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:08,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:08,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:35:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586016861] [2024-10-24 01:35:08,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:08,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:35:08,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:35:08,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:35:08,364 INFO L87 Difference]: Start difference. First operand 4908 states and 7944 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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-24 01:35:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:08,483 INFO L93 Difference]: Finished difference Result 15137 states and 24624 transitions. [2024-10-24 01:35:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:35:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-24 01:35:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:08,527 INFO L225 Difference]: With dead ends: 15137 [2024-10-24 01:35:08,527 INFO L226 Difference]: Without dead ends: 10356 [2024-10-24 01:35:08,537 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-24 01:35:08,539 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 400 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:08,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 563 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10356 states. [2024-10-24 01:35:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10356 to 7606. [2024-10-24 01:35:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7606 states, 7605 states have (on average 1.614990138067061) internal successors, (12282), 7605 states have internal predecessors, (12282), 0 states have call successors, (0), 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-24 01:35:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 12282 transitions. [2024-10-24 01:35:08,733 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 12282 transitions. Word has length 58 [2024-10-24 01:35:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:08,734 INFO L471 AbstractCegarLoop]: Abstraction has 7606 states and 12282 transitions. [2024-10-24 01:35:08,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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-24 01:35:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 12282 transitions. [2024-10-24 01:35:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 01:35:08,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:08,735 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] [2024-10-24 01:35:08,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:35:08,736 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:08,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash 24148835, now seen corresponding path program 1 times [2024-10-24 01:35:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271188993] [2024-10-24 01:35:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:08,797 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-24 01:35:08,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:08,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271188993] [2024-10-24 01:35:08,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271188993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:08,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473229996] [2024-10-24 01:35:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:08,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:08,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:08,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:08,800 INFO L87 Difference]: Start difference. First operand 7606 states and 12282 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-24 01:35:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:08,865 INFO L93 Difference]: Finished difference Result 16680 states and 27277 transitions. [2024-10-24 01:35:08,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:35:08,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-24 01:35:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:08,897 INFO L225 Difference]: With dead ends: 16680 [2024-10-24 01:35:08,897 INFO L226 Difference]: Without dead ends: 11155 [2024-10-24 01:35:08,906 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-24 01:35:08,907 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 122 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 475 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-24 01:35:08,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 475 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11155 states. [2024-10-24 01:35:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11155 to 11153. [2024-10-24 01:35:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11153 states, 11152 states have (on average 1.619261119081779) internal successors, (18058), 11152 states have internal predecessors, (18058), 0 states have call successors, (0), 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-24 01:35:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11153 states to 11153 states and 18058 transitions. [2024-10-24 01:35:09,134 INFO L78 Accepts]: Start accepts. Automaton has 11153 states and 18058 transitions. Word has length 58 [2024-10-24 01:35:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:09,135 INFO L471 AbstractCegarLoop]: Abstraction has 11153 states and 18058 transitions. [2024-10-24 01:35:09,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-24 01:35:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 11153 states and 18058 transitions. [2024-10-24 01:35:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 01:35:09,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:09,136 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] [2024-10-24 01:35:09,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:35:09,136 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:09,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -880237699, now seen corresponding path program 1 times [2024-10-24 01:35:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:09,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417159604] [2024-10-24 01:35:09,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:09,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:09,350 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-24 01:35:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417159604] [2024-10-24 01:35:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417159604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:09,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:35:09,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142610022] [2024-10-24 01:35:09,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:09,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:35:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:09,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:35:09,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:35:09,352 INFO L87 Difference]: Start difference. First operand 11153 states and 18058 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-24 01:35:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:09,632 INFO L93 Difference]: Finished difference Result 22234 states and 36013 transitions. [2024-10-24 01:35:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:35:09,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-24 01:35:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:09,655 INFO L225 Difference]: With dead ends: 22234 [2024-10-24 01:35:09,656 INFO L226 Difference]: Without dead ends: 11155 [2024-10-24 01:35:09,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:35:09,670 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 340 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:09,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 557 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11155 states. [2024-10-24 01:35:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11155 to 11153. [2024-10-24 01:35:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11153 states, 11152 states have (on average 1.6080523672883789) internal successors, (17933), 11152 states have internal predecessors, (17933), 0 states have call successors, (0), 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-24 01:35:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11153 states to 11153 states and 17933 transitions. [2024-10-24 01:35:09,925 INFO L78 Accepts]: Start accepts. Automaton has 11153 states and 17933 transitions. Word has length 60 [2024-10-24 01:35:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:09,926 INFO L471 AbstractCegarLoop]: Abstraction has 11153 states and 17933 transitions. [2024-10-24 01:35:09,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-24 01:35:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 11153 states and 17933 transitions. [2024-10-24 01:35:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:35:09,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:09,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:09,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:35:09,928 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:09,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash -139547642, now seen corresponding path program 1 times [2024-10-24 01:35:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:09,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079088487] [2024-10-24 01:35:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:09,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:10,146 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-24 01:35:10,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:10,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079088487] [2024-10-24 01:35:10,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079088487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:10,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:10,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:35:10,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493961438] [2024-10-24 01:35:10,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:10,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:35:10,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:10,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:35:10,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:35:10,150 INFO L87 Difference]: Start difference. First operand 11153 states and 17933 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-24 01:35:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:10,330 INFO L93 Difference]: Finished difference Result 31936 states and 51505 transitions. [2024-10-24 01:35:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:35:10,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-24 01:35:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:10,374 INFO L225 Difference]: With dead ends: 31936 [2024-10-24 01:35:10,374 INFO L226 Difference]: Without dead ends: 20857 [2024-10-24 01:35:10,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:35:10,395 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 223 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:10,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 565 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20857 states. [2024-10-24 01:35:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20857 to 20855. [2024-10-24 01:35:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20855 states, 20854 states have (on average 1.5961446245324638) internal successors, (33286), 20854 states have internal predecessors, (33286), 0 states have call successors, (0), 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-24 01:35:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20855 states to 20855 states and 33286 transitions. [2024-10-24 01:35:10,989 INFO L78 Accepts]: Start accepts. Automaton has 20855 states and 33286 transitions. Word has length 63 [2024-10-24 01:35:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:10,990 INFO L471 AbstractCegarLoop]: Abstraction has 20855 states and 33286 transitions. [2024-10-24 01:35:10,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-24 01:35:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 20855 states and 33286 transitions. [2024-10-24 01:35:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 01:35:10,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:10,995 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] [2024-10-24 01:35:10,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:35:10,996 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:10,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash -32918918, now seen corresponding path program 1 times [2024-10-24 01:35:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:10,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637987950] [2024-10-24 01:35:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:11,330 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-24 01:35:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:11,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637987950] [2024-10-24 01:35:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637987950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:11,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:11,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:35:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245579668] [2024-10-24 01:35:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:11,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:35:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:35:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:35:11,333 INFO L87 Difference]: Start difference. First operand 20855 states and 33286 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:11,425 INFO L93 Difference]: Finished difference Result 21581 states and 34373 transitions. [2024-10-24 01:35:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:35:11,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-24 01:35:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:11,468 INFO L225 Difference]: With dead ends: 21581 [2024-10-24 01:35:11,469 INFO L226 Difference]: Without dead ends: 21579 [2024-10-24 01:35:11,478 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-24 01:35:11,480 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:11,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 791 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:11,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21579 states. [2024-10-24 01:35:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21579 to 21579. [2024-10-24 01:35:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21579 states, 21578 states have (on average 1.5757252757438132) internal successors, (34001), 21578 states have internal predecessors, (34001), 0 states have call successors, (0), 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-24 01:35:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21579 states to 21579 states and 34001 transitions. [2024-10-24 01:35:11,839 INFO L78 Accepts]: Start accepts. Automaton has 21579 states and 34001 transitions. Word has length 64 [2024-10-24 01:35:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:11,840 INFO L471 AbstractCegarLoop]: Abstraction has 21579 states and 34001 transitions. [2024-10-24 01:35:11,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 21579 states and 34001 transitions. [2024-10-24 01:35:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:35:11,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:11,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:11,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:35:11,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:11,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash -120193138, now seen corresponding path program 1 times [2024-10-24 01:35:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744734645] [2024-10-24 01:35:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:35:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744734645] [2024-10-24 01:35:12,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744734645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:12,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:12,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:35:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338973424] [2024-10-24 01:35:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:12,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:35:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:35:12,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:35:12,018 INFO L87 Difference]: Start difference. First operand 21579 states and 34001 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:12,486 INFO L93 Difference]: Finished difference Result 52595 states and 83205 transitions. [2024-10-24 01:35:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:35:12,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-24 01:35:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:12,559 INFO L225 Difference]: With dead ends: 52595 [2024-10-24 01:35:12,559 INFO L226 Difference]: Without dead ends: 42403 [2024-10-24 01:35:12,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:35:12,580 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 510 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:12,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 912 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42403 states. [2024-10-24 01:35:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42403 to 33113. [2024-10-24 01:35:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33113 states, 33112 states have (on average 1.5749275187243295) internal successors, (52149), 33112 states have internal predecessors, (52149), 0 states have call successors, (0), 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-24 01:35:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33113 states to 33113 states and 52149 transitions. [2024-10-24 01:35:13,214 INFO L78 Accepts]: Start accepts. Automaton has 33113 states and 52149 transitions. Word has length 86 [2024-10-24 01:35:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:13,214 INFO L471 AbstractCegarLoop]: Abstraction has 33113 states and 52149 transitions. [2024-10-24 01:35:13,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 33113 states and 52149 transitions. [2024-10-24 01:35:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:35:13,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:13,217 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:13,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:35:13,217 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:13,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:13,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1844830783, now seen corresponding path program 1 times [2024-10-24 01:35:13,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483404022] [2024-10-24 01:35:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 01:35:13,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:13,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483404022] [2024-10-24 01:35:13,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483404022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:13,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:13,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:35:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043957636] [2024-10-24 01:35:13,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:13,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:35:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:13,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:35:13,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:35:13,344 INFO L87 Difference]: Start difference. First operand 33113 states and 52149 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:13,746 INFO L93 Difference]: Finished difference Result 56647 states and 89641 transitions. [2024-10-24 01:35:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:35:13,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-24 01:35:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:13,839 INFO L225 Difference]: With dead ends: 56647 [2024-10-24 01:35:13,839 INFO L226 Difference]: Without dead ends: 46455 [2024-10-24 01:35:13,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:35:13,872 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 514 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:13,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 973 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46455 states. [2024-10-24 01:35:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46455 to 44801. [2024-10-24 01:35:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44801 states, 44800 states have (on average 1.5761830357142856) internal successors, (70613), 44800 states have internal predecessors, (70613), 0 states have call successors, (0), 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-24 01:35:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44801 states to 44801 states and 70613 transitions. [2024-10-24 01:35:14,624 INFO L78 Accepts]: Start accepts. Automaton has 44801 states and 70613 transitions. Word has length 86 [2024-10-24 01:35:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:14,624 INFO L471 AbstractCegarLoop]: Abstraction has 44801 states and 70613 transitions. [2024-10-24 01:35:14,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 44801 states and 70613 transitions. [2024-10-24 01:35:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:35:14,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:14,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:14,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:35:14,627 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:14,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash -264586939, now seen corresponding path program 1 times [2024-10-24 01:35:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:14,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754218559] [2024-10-24 01:35:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 01:35:14,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754218559] [2024-10-24 01:35:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754218559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:14,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:35:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286980139] [2024-10-24 01:35:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:14,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:35:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:14,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:35:14,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:35:14,747 INFO L87 Difference]: Start difference. First operand 44801 states and 70613 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-24 01:35:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:15,172 INFO L93 Difference]: Finished difference Result 63517 states and 100701 transitions. [2024-10-24 01:35:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:35:15,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-24 01:35:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:15,235 INFO L225 Difference]: With dead ends: 63517 [2024-10-24 01:35:15,235 INFO L226 Difference]: Without dead ends: 53095 [2024-10-24 01:35:15,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:35:15,261 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 507 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:15,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 945 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53095 states. [2024-10-24 01:35:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53095 to 51441. [2024-10-24 01:35:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51441 states, 51440 states have (on average 1.5791796267496112) internal successors, (81233), 51440 states have internal predecessors, (81233), 0 states have call successors, (0), 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-24 01:35:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51441 states to 51441 states and 81233 transitions. [2024-10-24 01:35:16,370 INFO L78 Accepts]: Start accepts. Automaton has 51441 states and 81233 transitions. Word has length 86 [2024-10-24 01:35:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:16,371 INFO L471 AbstractCegarLoop]: Abstraction has 51441 states and 81233 transitions. [2024-10-24 01:35:16,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-24 01:35:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 51441 states and 81233 transitions. [2024-10-24 01:35:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 01:35:16,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:16,374 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:16,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:35:16,374 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:16,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -908860859, now seen corresponding path program 1 times [2024-10-24 01:35:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:16,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171173216] [2024-10-24 01:35:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 01:35:16,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:16,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171173216] [2024-10-24 01:35:16,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171173216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:16,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:16,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:16,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716232825] [2024-10-24 01:35:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:16,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:16,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:16,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:16,461 INFO L87 Difference]: Start difference. First operand 51441 states and 81233 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-24 01:35:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:16,723 INFO L93 Difference]: Finished difference Result 113248 states and 179765 transitions. [2024-10-24 01:35:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:35:16,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-24 01:35:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:16,817 INFO L225 Difference]: With dead ends: 113248 [2024-10-24 01:35:16,817 INFO L226 Difference]: Without dead ends: 82688 [2024-10-24 01:35:16,856 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-24 01:35:16,857 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 103 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 370 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-24 01:35:16,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 370 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82688 states. [2024-10-24 01:35:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82688 to 82483. [2024-10-24 01:35:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82483 states, 82482 states have (on average 1.5818117892388643) internal successors, (130471), 82482 states have internal predecessors, (130471), 0 states have call successors, (0), 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-24 01:35:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82483 states to 82483 states and 130471 transitions. [2024-10-24 01:35:18,348 INFO L78 Accepts]: Start accepts. Automaton has 82483 states and 130471 transitions. Word has length 87 [2024-10-24 01:35:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:18,348 INFO L471 AbstractCegarLoop]: Abstraction has 82483 states and 130471 transitions. [2024-10-24 01:35:18,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-24 01:35:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 82483 states and 130471 transitions. [2024-10-24 01:35:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 01:35:18,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:18,352 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:18,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:35:18,352 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:18,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 325235277, now seen corresponding path program 1 times [2024-10-24 01:35:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291354796] [2024-10-24 01:35:18,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:18,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 01:35:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:18,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291354796] [2024-10-24 01:35:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291354796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:18,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:18,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:35:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528829220] [2024-10-24 01:35:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:18,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:35:18,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:18,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:35:18,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:35:18,523 INFO L87 Difference]: Start difference. First operand 82483 states and 130471 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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-24 01:35:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:19,061 INFO L93 Difference]: Finished difference Result 147004 states and 233500 transitions. [2024-10-24 01:35:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:35:19,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-24 01:35:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:19,244 INFO L225 Difference]: With dead ends: 147004 [2024-10-24 01:35:19,245 INFO L226 Difference]: Without dead ends: 112964 [2024-10-24 01:35:19,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:35:19,309 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 227 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:19,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 705 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112964 states. [2024-10-24 01:35:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112964 to 109607. [2024-10-24 01:35:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109607 states, 109606 states have (on average 1.5803331934383154) internal successors, (173214), 109606 states have internal predecessors, (173214), 0 states have call successors, (0), 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-24 01:35:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109607 states to 109607 states and 173214 transitions. [2024-10-24 01:35:21,314 INFO L78 Accepts]: Start accepts. Automaton has 109607 states and 173214 transitions. Word has length 87 [2024-10-24 01:35:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:21,314 INFO L471 AbstractCegarLoop]: Abstraction has 109607 states and 173214 transitions. [2024-10-24 01:35:21,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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-24 01:35:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 109607 states and 173214 transitions. [2024-10-24 01:35:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:35:21,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:21,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:21,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:35:21,318 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:21,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2088244150, now seen corresponding path program 1 times [2024-10-24 01:35:21,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:21,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418212715] [2024-10-24 01:35:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:35:21,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:21,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418212715] [2024-10-24 01:35:21,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418212715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:21,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:21,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374168203] [2024-10-24 01:35:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:21,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:21,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:21,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:21,388 INFO L87 Difference]: Start difference. First operand 109607 states and 173214 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:22,568 INFO L93 Difference]: Finished difference Result 234262 states and 371402 transitions. [2024-10-24 01:35:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:35:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-24 01:35:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:22,835 INFO L225 Difference]: With dead ends: 234262 [2024-10-24 01:35:22,835 INFO L226 Difference]: Without dead ends: 173170 [2024-10-24 01:35:22,880 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-24 01:35:22,881 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 103 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 370 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-24 01:35:22,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 370 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173170 states. [2024-10-24 01:35:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173170 to 172767. [2024-10-24 01:35:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172767 states, 172766 states have (on average 1.5809592165125081) internal successors, (273136), 172766 states have internal predecessors, (273136), 0 states have call successors, (0), 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-24 01:35:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172767 states to 172767 states and 273136 transitions. [2024-10-24 01:35:25,437 INFO L78 Accepts]: Start accepts. Automaton has 172767 states and 273136 transitions. Word has length 88 [2024-10-24 01:35:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:25,437 INFO L471 AbstractCegarLoop]: Abstraction has 172767 states and 273136 transitions. [2024-10-24 01:35:25,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 172767 states and 273136 transitions. [2024-10-24 01:35:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:35:25,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:25,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:25,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:35:25,440 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:25,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:25,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1537065195, now seen corresponding path program 1 times [2024-10-24 01:35:25,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:25,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298434213] [2024-10-24 01:35:25,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:25,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:35:25,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:25,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298434213] [2024-10-24 01:35:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298434213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:25,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:25,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:35:25,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030647358] [2024-10-24 01:35:25,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:25,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:35:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:25,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:35:25,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:35:25,547 INFO L87 Difference]: Start difference. First operand 172767 states and 273136 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:27,051 INFO L93 Difference]: Finished difference Result 288374 states and 457257 transitions. [2024-10-24 01:35:27,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:35:27,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-24 01:35:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:27,462 INFO L225 Difference]: With dead ends: 288374 [2024-10-24 01:35:27,462 INFO L226 Difference]: Without dead ends: 225242 [2024-10-24 01:35:27,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:35:27,545 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 231 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:27,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 699 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:35:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225242 states. [2024-10-24 01:35:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225242 to 212023. [2024-10-24 01:35:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212023 states, 212022 states have (on average 1.5781617002009225) internal successors, (334605), 212022 states have internal predecessors, (334605), 0 states have call successors, (0), 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-24 01:35:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212023 states to 212023 states and 334605 transitions. [2024-10-24 01:35:31,982 INFO L78 Accepts]: Start accepts. Automaton has 212023 states and 334605 transitions. Word has length 88 [2024-10-24 01:35:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:31,983 INFO L471 AbstractCegarLoop]: Abstraction has 212023 states and 334605 transitions. [2024-10-24 01:35:31,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:35:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 212023 states and 334605 transitions. [2024-10-24 01:35:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:35:31,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:31,986 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:31,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:35:31,986 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:31,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1784797969, now seen corresponding path program 1 times [2024-10-24 01:35:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304891115] [2024-10-24 01:35:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:35:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304891115] [2024-10-24 01:35:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304891115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:32,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:32,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:32,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114423653] [2024-10-24 01:35:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:32,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:32,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:32,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:32,057 INFO L87 Difference]: Start difference. First operand 212023 states and 334605 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-24 01:35:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:35:34,563 INFO L93 Difference]: Finished difference Result 624511 states and 985530 transitions. [2024-10-24 01:35:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:35:34,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-24 01:35:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:35:35,483 INFO L225 Difference]: With dead ends: 624511 [2024-10-24 01:35:35,483 INFO L226 Difference]: Without dead ends: 412562 [2024-10-24 01:35:35,672 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-24 01:35:35,673 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 154 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:35:35,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 485 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:35:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412562 states. [2024-10-24 01:35:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412562 to 412560. [2024-10-24 01:35:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412560 states, 412559 states have (on average 1.5676109356479921) internal successors, (646732), 412559 states have internal predecessors, (646732), 0 states have call successors, (0), 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-24 01:35:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412560 states to 412560 states and 646732 transitions. [2024-10-24 01:35:43,506 INFO L78 Accepts]: Start accepts. Automaton has 412560 states and 646732 transitions. Word has length 88 [2024-10-24 01:35:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:35:43,507 INFO L471 AbstractCegarLoop]: Abstraction has 412560 states and 646732 transitions. [2024-10-24 01:35:43,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-24 01:35:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 412560 states and 646732 transitions. [2024-10-24 01:35:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:35:43,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:35:43,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:35:43,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:35:43,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:35:43,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:35:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash -266873061, now seen corresponding path program 1 times [2024-10-24 01:35:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:35:43,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818449306] [2024-10-24 01:35:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:35:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:35:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:35:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:35:43,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:35:43,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818449306] [2024-10-24 01:35:43,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818449306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:35:43,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:35:43,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:35:43,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995180469] [2024-10-24 01:35:43,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:35:43,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:35:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:35:43,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:35:43,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:35:43,600 INFO L87 Difference]: Start difference. First operand 412560 states and 646732 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)