./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.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 e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:33:32,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:33:32,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:33:32,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:33:32,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:33:32,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:33:32,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:33:32,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:33:32,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:33:32,522 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:33:32,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:33:32,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:33:32,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:33:32,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:33:32,524 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:33:32,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:33:32,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:33:32,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:33:32,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:33:32,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:33:32,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:33:32,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:33:32,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:33:32,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:33:32,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:33:32,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:33:32,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:33:32,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:33:32,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:33:32,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:33:32,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:33:32,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:33:32,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:33:32,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:33:32,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:33:32,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:33:32,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:33:32,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:33:32,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:33:32,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:33:32,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:33:32,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:33:32,537 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 -> e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d [2024-10-12 20:33:32,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:33:32,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:33:32,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:33:32,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:33:32,803 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:33:32,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:33:34,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:33:34,544 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:33:34,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:33:34,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb4db84b/cbb89398b1d9440383d7f7ec445eaabe/FLAG223e8d646 [2024-10-12 20:33:34,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb4db84b/cbb89398b1d9440383d7f7ec445eaabe [2024-10-12 20:33:34,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:33:34,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:33:34,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:33:34,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:33:34,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:33:34,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:33:34" (1/1) ... [2024-10-12 20:33:34,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610acf58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:34, skipping insertion in model container [2024-10-12 20:33:34,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:33:34" (1/1) ... [2024-10-12 20:33:34,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:33:34,926 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2024-10-12 20:33:34,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:33:34,975 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:33:35,021 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2024-10-12 20:33:35,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:33:35,093 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:33:35,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35 WrapperNode [2024-10-12 20:33:35,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:33:35,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:33:35,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:33:35,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:33:35,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,159 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 716 [2024-10-12 20:33:35,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:33:35,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:33:35,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:33:35,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:33:35,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,188 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-12 20:33:35,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:33:35,230 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:33:35,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:33:35,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:33:35,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (1/1) ... [2024-10-12 20:33:35,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:33:35,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:33:35,265 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-12 20:33:35,267 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-12 20:33:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:33:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:33:35,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:33:35,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:33:35,445 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:33:35,447 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:33:36,043 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-12 20:33:36,045 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:33:36,097 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:33:36,099 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:33:36,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:33:36 BoogieIcfgContainer [2024-10-12 20:33:36,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:33:36,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:33:36,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:33:36,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:33:36,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:33:34" (1/3) ... [2024-10-12 20:33:36,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268f3361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:33:36, skipping insertion in model container [2024-10-12 20:33:36,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:35" (2/3) ... [2024-10-12 20:33:36,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268f3361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:33:36, skipping insertion in model container [2024-10-12 20:33:36,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:33:36" (3/3) ... [2024-10-12 20:33:36,109 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:33:36,126 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:33:36,126 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:33:36,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:33:36,193 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;@1bea773b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:33:36,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:33:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 155 states have (on average 1.761290322580645) internal successors, (273), 156 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:33:36,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:36,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:36,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:36,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1079152141, now seen corresponding path program 1 times [2024-10-12 20:33:36,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:36,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154208499] [2024-10-12 20:33:36,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:36,874 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-12 20:33:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154208499] [2024-10-12 20:33:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154208499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:36,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:33:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232191350] [2024-10-12 20:33:36,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:33:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:36,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:33:36,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:33:36,911 INFO L87 Difference]: Start difference. First operand has 157 states, 155 states have (on average 1.761290322580645) internal successors, (273), 156 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-12 20:33:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:36,994 INFO L93 Difference]: Finished difference Result 337 states and 556 transitions. [2024-10-12 20:33:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:33:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-12 20:33:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:37,012 INFO L225 Difference]: With dead ends: 337 [2024-10-12 20:33:37,012 INFO L226 Difference]: Without dead ends: 239 [2024-10-12 20:33:37,015 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-12 20:33:37,018 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 185 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:37,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 533 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-12 20:33:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2024-10-12 20:33:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.4406779661016949) internal successors, (340), 236 states have internal predecessors, (340), 0 states have call successors, (0), 0 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-12 20:33:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 340 transitions. [2024-10-12 20:33:37,082 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 340 transitions. Word has length 101 [2024-10-12 20:33:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:37,083 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 340 transitions. [2024-10-12 20:33:37,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-12 20:33:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 340 transitions. [2024-10-12 20:33:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 20:33:37,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:37,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:37,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:33:37,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:37,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1195322511, now seen corresponding path program 1 times [2024-10-12 20:33:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:37,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379961435] [2024-10-12 20:33:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:37,286 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-12 20:33:37,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:37,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379961435] [2024-10-12 20:33:37,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379961435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:37,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:37,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:33:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55875724] [2024-10-12 20:33:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:37,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:33:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:33:37,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:33:37,293 INFO L87 Difference]: Start difference. First operand 237 states and 340 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-12 20:33:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:37,340 INFO L93 Difference]: Finished difference Result 569 states and 868 transitions. [2024-10-12 20:33:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:33:37,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-10-12 20:33:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:37,346 INFO L225 Difference]: With dead ends: 569 [2024-10-12 20:33:37,347 INFO L226 Difference]: Without dead ends: 395 [2024-10-12 20:33:37,348 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-12 20:33:37,349 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 126 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 459 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-12 20:33:37,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 459 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-12 20:33:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2024-10-12 20:33:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5) internal successors, (588), 392 states have internal predecessors, (588), 0 states have call successors, (0), 0 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-12 20:33:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 588 transitions. [2024-10-12 20:33:37,377 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 588 transitions. Word has length 102 [2024-10-12 20:33:37,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:37,377 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 588 transitions. [2024-10-12 20:33:37,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-12 20:33:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 588 transitions. [2024-10-12 20:33:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:33:37,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:33:37,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:33:37,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:37,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1086033565, now seen corresponding path program 1 times [2024-10-12 20:33:37,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763229657] [2024-10-12 20:33:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:37,529 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-12 20:33:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763229657] [2024-10-12 20:33:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763229657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:33:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532488116] [2024-10-12 20:33:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:33:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:37,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:33:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:33:37,533 INFO L87 Difference]: Start difference. First operand 393 states and 588 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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-12 20:33:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:37,578 INFO L93 Difference]: Finished difference Result 1021 states and 1586 transitions. [2024-10-12 20:33:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:33:37,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-10-12 20:33:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:37,584 INFO L225 Difference]: With dead ends: 1021 [2024-10-12 20:33:37,584 INFO L226 Difference]: Without dead ends: 691 [2024-10-12 20:33:37,586 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-12 20:33:37,589 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 121 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 455 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-12 20:33:37,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 455 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-12 20:33:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2024-10-12 20:33:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.5348837209302326) internal successors, (1056), 688 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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-12 20:33:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1056 transitions. [2024-10-12 20:33:37,629 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1056 transitions. Word has length 103 [2024-10-12 20:33:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:37,630 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1056 transitions. [2024-10-12 20:33:37,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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-12 20:33:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1056 transitions. [2024-10-12 20:33:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:33:37,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:37,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:37,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:33:37,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:37,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash 319867899, now seen corresponding path program 1 times [2024-10-12 20:33:37,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:37,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996281657] [2024-10-12 20:33:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:37,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:37,787 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-12 20:33:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:37,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996281657] [2024-10-12 20:33:37,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996281657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:37,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:37,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:33:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916684819] [2024-10-12 20:33:37,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:37,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:33:37,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:33:37,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:33:37,792 INFO L87 Difference]: Start difference. First operand 689 states and 1056 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:37,821 INFO L93 Difference]: Finished difference Result 1877 states and 2938 transitions. [2024-10-12 20:33:37,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:33:37,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-12 20:33:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:37,829 INFO L225 Difference]: With dead ends: 1877 [2024-10-12 20:33:37,830 INFO L226 Difference]: Without dead ends: 1251 [2024-10-12 20:33:37,831 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-12 20:33:37,832 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 116 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 451 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-12 20:33:37,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 451 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-10-12 20:33:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2024-10-12 20:33:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.5512820512820513) internal successors, (1936), 1248 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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-12 20:33:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1936 transitions. [2024-10-12 20:33:37,869 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1936 transitions. Word has length 104 [2024-10-12 20:33:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:37,870 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1936 transitions. [2024-10-12 20:33:37,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1936 transitions. [2024-10-12 20:33:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 20:33:37,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:37,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:37,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:33:37,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:37,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:37,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1176147823, now seen corresponding path program 1 times [2024-10-12 20:33:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:37,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176629955] [2024-10-12 20:33:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:37,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:38,005 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-12 20:33:38,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176629955] [2024-10-12 20:33:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176629955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:38,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:38,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:33:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58399819] [2024-10-12 20:33:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:38,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:33:38,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:38,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:33:38,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:33:38,008 INFO L87 Difference]: Start difference. First operand 1249 states and 1936 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:38,043 INFO L93 Difference]: Finished difference Result 3493 states and 5474 transitions. [2024-10-12 20:33:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:33:38,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-12 20:33:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:38,053 INFO L225 Difference]: With dead ends: 3493 [2024-10-12 20:33:38,054 INFO L226 Difference]: Without dead ends: 2307 [2024-10-12 20:33:38,056 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-12 20:33:38,057 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 111 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 447 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-12 20:33:38,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 447 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2024-10-12 20:33:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2305. [2024-10-12 20:33:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 2304 states have (on average 1.5555555555555556) internal successors, (3584), 2304 states have internal predecessors, (3584), 0 states have call successors, (0), 0 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-12 20:33:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3584 transitions. [2024-10-12 20:33:38,124 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3584 transitions. Word has length 105 [2024-10-12 20:33:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:38,124 INFO L471 AbstractCegarLoop]: Abstraction has 2305 states and 3584 transitions. [2024-10-12 20:33:38,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3584 transitions. [2024-10-12 20:33:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 20:33:38,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:38,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:38,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:33:38,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:38,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash -611746598, now seen corresponding path program 1 times [2024-10-12 20:33:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:38,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870040061] [2024-10-12 20:33:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:38,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:38,221 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-12 20:33:38,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:38,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870040061] [2024-10-12 20:33:38,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870040061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:38,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:38,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:33:38,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141856986] [2024-10-12 20:33:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:38,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:33:38,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:38,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:33:38,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:33:38,226 INFO L87 Difference]: Start difference. First operand 2305 states and 3584 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:38,271 INFO L93 Difference]: Finished difference Result 6533 states and 10210 transitions. [2024-10-12 20:33:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:33:38,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-12 20:33:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:38,292 INFO L225 Difference]: With dead ends: 6533 [2024-10-12 20:33:38,292 INFO L226 Difference]: Without dead ends: 4291 [2024-10-12 20:33:38,297 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-12 20:33:38,297 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 106 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 443 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-12 20:33:38,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 443 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4291 states. [2024-10-12 20:33:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4291 to 4289. [2024-10-12 20:33:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4289 states, 4288 states have (on average 1.5522388059701493) internal successors, (6656), 4288 states have internal predecessors, (6656), 0 states have call successors, (0), 0 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-12 20:33:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 6656 transitions. [2024-10-12 20:33:38,400 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 6656 transitions. Word has length 106 [2024-10-12 20:33:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:38,400 INFO L471 AbstractCegarLoop]: Abstraction has 4289 states and 6656 transitions. [2024-10-12 20:33:38,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 6656 transitions. [2024-10-12 20:33:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 20:33:38,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:38,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:38,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:33:38,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:38,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1150505180, now seen corresponding path program 1 times [2024-10-12 20:33:38,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349504901] [2024-10-12 20:33:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:38,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:38,541 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-12 20:33:38,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:38,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349504901] [2024-10-12 20:33:38,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349504901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:38,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:38,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:33:38,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213455775] [2024-10-12 20:33:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:38,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:33:38,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:38,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:33:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:33:38,544 INFO L87 Difference]: Start difference. First operand 4289 states and 6656 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:38,612 INFO L93 Difference]: Finished difference Result 12229 states and 19010 transitions. [2024-10-12 20:33:38,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:33:38,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-12 20:33:38,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:38,642 INFO L225 Difference]: With dead ends: 12229 [2024-10-12 20:33:38,642 INFO L226 Difference]: Without dead ends: 8003 [2024-10-12 20:33:38,651 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-12 20:33:38,654 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 101 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 439 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-12 20:33:38,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 439 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8003 states. [2024-10-12 20:33:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8003 to 8001. [2024-10-12 20:33:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8001 states, 8000 states have (on average 1.544) internal successors, (12352), 8000 states have internal predecessors, (12352), 0 states have call successors, (0), 0 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-12 20:33:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 12352 transitions. [2024-10-12 20:33:38,850 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 12352 transitions. Word has length 107 [2024-10-12 20:33:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:38,851 INFO L471 AbstractCegarLoop]: Abstraction has 8001 states and 12352 transitions. [2024-10-12 20:33:38,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 12352 transitions. [2024-10-12 20:33:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 20:33:38,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:38,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:38,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:33:38,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:38,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:38,853 INFO L85 PathProgramCache]: Analyzing trace with hash -82138799, now seen corresponding path program 1 times [2024-10-12 20:33:38,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:38,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489913102] [2024-10-12 20:33:38,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:38,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:39,186 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-12 20:33:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489913102] [2024-10-12 20:33:39,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489913102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:39,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:39,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:33:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218852075] [2024-10-12 20:33:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:39,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:33:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:39,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:33:39,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:33:39,190 INFO L87 Difference]: Start difference. First operand 8001 states and 12352 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:40,247 INFO L93 Difference]: Finished difference Result 135009 states and 208976 transitions. [2024-10-12 20:33:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 20:33:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-10-12 20:33:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:40,865 INFO L225 Difference]: With dead ends: 135009 [2024-10-12 20:33:40,866 INFO L226 Difference]: Without dead ends: 127071 [2024-10-12 20:33:40,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:33:40,938 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 3201 mSDsluCounter, 7450 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3201 SdHoareTripleChecker+Valid, 7654 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:40,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3201 Valid, 7654 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:33:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127071 states. [2024-10-12 20:33:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127071 to 15937. [2024-10-12 20:33:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15937 states, 15936 states have (on average 1.5301204819277108) internal successors, (24384), 15936 states have internal predecessors, (24384), 0 states have call successors, (0), 0 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-12 20:33:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15937 states to 15937 states and 24384 transitions. [2024-10-12 20:33:42,189 INFO L78 Accepts]: Start accepts. Automaton has 15937 states and 24384 transitions. Word has length 108 [2024-10-12 20:33:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:42,189 INFO L471 AbstractCegarLoop]: Abstraction has 15937 states and 24384 transitions. [2024-10-12 20:33:42,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 15937 states and 24384 transitions. [2024-10-12 20:33:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 20:33:42,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:42,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:42,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:33:42,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:42,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1747176077, now seen corresponding path program 1 times [2024-10-12 20:33:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:42,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082578667] [2024-10-12 20:33:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:42,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:42,313 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-12 20:33:42,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082578667] [2024-10-12 20:33:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082578667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:42,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:42,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:33:42,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135125495] [2024-10-12 20:33:42,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:42,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:33:42,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:42,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:33:42,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:33:42,318 INFO L87 Difference]: Start difference. First operand 15937 states and 24384 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-12 20:33:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:42,437 INFO L93 Difference]: Finished difference Result 46277 states and 70594 transitions. [2024-10-12 20:33:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:33:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-12 20:33:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:42,634 INFO L225 Difference]: With dead ends: 46277 [2024-10-12 20:33:42,634 INFO L226 Difference]: Without dead ends: 30403 [2024-10-12 20:33:42,659 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-12 20:33:42,664 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 91 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:42,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 345 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30403 states. [2024-10-12 20:33:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30403 to 30145. [2024-10-12 20:33:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30145 states, 30144 states have (on average 1.505307855626327) internal successors, (45376), 30144 states have internal predecessors, (45376), 0 states have call successors, (0), 0 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-12 20:33:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30145 states to 30145 states and 45376 transitions. [2024-10-12 20:33:43,242 INFO L78 Accepts]: Start accepts. Automaton has 30145 states and 45376 transitions. Word has length 110 [2024-10-12 20:33:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:43,242 INFO L471 AbstractCegarLoop]: Abstraction has 30145 states and 45376 transitions. [2024-10-12 20:33:43,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-12 20:33:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 30145 states and 45376 transitions. [2024-10-12 20:33:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 20:33:43,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:43,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:43,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:33:43,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:43,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1768178732, now seen corresponding path program 1 times [2024-10-12 20:33:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:43,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442628736] [2024-10-12 20:33:43,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:43,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:43,978 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-12 20:33:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442628736] [2024-10-12 20:33:43,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442628736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:43,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:43,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:33:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064317335] [2024-10-12 20:33:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:43,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:33:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:33:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:33:43,981 INFO L87 Difference]: Start difference. First operand 30145 states and 45376 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-12 20:33:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:44,581 INFO L93 Difference]: Finished difference Result 60229 states and 90690 transitions. [2024-10-12 20:33:44,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:33:44,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-12 20:33:44,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:44,635 INFO L225 Difference]: With dead ends: 60229 [2024-10-12 20:33:44,636 INFO L226 Difference]: Without dead ends: 30147 [2024-10-12 20:33:44,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:33:44,678 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 176 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:44,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1354 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30147 states. [2024-10-12 20:33:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30147 to 30145. [2024-10-12 20:33:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30145 states, 30144 states have (on average 1.4968152866242037) internal successors, (45120), 30144 states have internal predecessors, (45120), 0 states have call successors, (0), 0 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-12 20:33:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30145 states to 30145 states and 45120 transitions. [2024-10-12 20:33:45,391 INFO L78 Accepts]: Start accepts. Automaton has 30145 states and 45120 transitions. Word has length 110 [2024-10-12 20:33:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:45,391 INFO L471 AbstractCegarLoop]: Abstraction has 30145 states and 45120 transitions. [2024-10-12 20:33:45,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-12 20:33:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 30145 states and 45120 transitions. [2024-10-12 20:33:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:45,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:45,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:45,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:33:45,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:45,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1312772968, now seen corresponding path program 1 times [2024-10-12 20:33:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:45,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546147256] [2024-10-12 20:33:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:45,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:45,475 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-12 20:33:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546147256] [2024-10-12 20:33:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546147256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:45,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:45,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:33:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032767674] [2024-10-12 20:33:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:45,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:33:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:45,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:33:45,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:33:45,478 INFO L87 Difference]: Start difference. First operand 30145 states and 45120 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:45,621 INFO L93 Difference]: Finished difference Result 59336 states and 89414 transitions. [2024-10-12 20:33:45,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:33:45,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:45,694 INFO L225 Difference]: With dead ends: 59336 [2024-10-12 20:33:45,695 INFO L226 Difference]: Without dead ends: 43461 [2024-10-12 20:33:45,719 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-12 20:33:45,720 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 133 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 471 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-12 20:33:45,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 471 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43461 states. [2024-10-12 20:33:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43461 to 43459. [2024-10-12 20:33:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43459 states, 43458 states have (on average 1.4948225873256937) internal successors, (64962), 43458 states have internal predecessors, (64962), 0 states have call successors, (0), 0 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-12 20:33:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43459 states to 43459 states and 64962 transitions. [2024-10-12 20:33:46,563 INFO L78 Accepts]: Start accepts. Automaton has 43459 states and 64962 transitions. Word has length 111 [2024-10-12 20:33:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:46,563 INFO L471 AbstractCegarLoop]: Abstraction has 43459 states and 64962 transitions. [2024-10-12 20:33:46,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 43459 states and 64962 transitions. [2024-10-12 20:33:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:46,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:46,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:46,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:33:46,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:46,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1022943379, now seen corresponding path program 1 times [2024-10-12 20:33:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:46,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230576215] [2024-10-12 20:33:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:46,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:46,729 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-12 20:33:46,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:46,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230576215] [2024-10-12 20:33:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230576215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530838293] [2024-10-12 20:33:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:46,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:46,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:46,732 INFO L87 Difference]: Start difference. First operand 43459 states and 64962 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:47,149 INFO L93 Difference]: Finished difference Result 86853 states and 129859 transitions. [2024-10-12 20:33:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:47,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:47,219 INFO L225 Difference]: With dead ends: 86853 [2024-10-12 20:33:47,219 INFO L226 Difference]: Without dead ends: 43459 [2024-10-12 20:33:47,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:33:47,254 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 526 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:47,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 150 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43459 states. [2024-10-12 20:33:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43459 to 43459. [2024-10-12 20:33:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43459 states, 43458 states have (on average 1.485986469694878) internal successors, (64578), 43458 states have internal predecessors, (64578), 0 states have call successors, (0), 0 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-12 20:33:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43459 states to 43459 states and 64578 transitions. [2024-10-12 20:33:48,002 INFO L78 Accepts]: Start accepts. Automaton has 43459 states and 64578 transitions. Word has length 111 [2024-10-12 20:33:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:48,003 INFO L471 AbstractCegarLoop]: Abstraction has 43459 states and 64578 transitions. [2024-10-12 20:33:48,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 43459 states and 64578 transitions. [2024-10-12 20:33:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:48,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:48,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:48,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:33:48,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:48,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1530606802, now seen corresponding path program 1 times [2024-10-12 20:33:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:48,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708892950] [2024-10-12 20:33:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:48,175 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-12 20:33:48,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708892950] [2024-10-12 20:33:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708892950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:48,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:48,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:48,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538235991] [2024-10-12 20:33:48,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:48,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:48,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:48,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:48,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:48,179 INFO L87 Difference]: Start difference. First operand 43459 states and 64578 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:48,661 INFO L93 Difference]: Finished difference Result 116039 states and 172868 transitions. [2024-10-12 20:33:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:48,760 INFO L225 Difference]: With dead ends: 116039 [2024-10-12 20:33:48,761 INFO L226 Difference]: Without dead ends: 72645 [2024-10-12 20:33:49,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:33:49,078 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 838 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:49,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 211 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:33:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72645 states. [2024-10-12 20:33:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72645 to 72643. [2024-10-12 20:33:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.4845681561631012) internal successors, (107842), 72642 states have internal predecessors, (107842), 0 states have call successors, (0), 0 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-12 20:33:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 107842 transitions. [2024-10-12 20:33:50,033 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 107842 transitions. Word has length 111 [2024-10-12 20:33:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:50,034 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 107842 transitions. [2024-10-12 20:33:50,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 107842 transitions. [2024-10-12 20:33:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:50,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:50,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:50,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:33:50,036 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:50,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:50,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1017933833, now seen corresponding path program 1 times [2024-10-12 20:33:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:50,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996180532] [2024-10-12 20:33:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:50,200 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-12 20:33:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996180532] [2024-10-12 20:33:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996180532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:50,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:50,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:50,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112146673] [2024-10-12 20:33:50,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:50,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:50,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:50,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:50,202 INFO L87 Difference]: Start difference. First operand 72643 states and 107842 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:50,914 INFO L93 Difference]: Finished difference Result 145221 states and 215619 transitions. [2024-10-12 20:33:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:50,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:50,988 INFO L225 Difference]: With dead ends: 145221 [2024-10-12 20:33:50,988 INFO L226 Difference]: Without dead ends: 72643 [2024-10-12 20:33:51,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:33:51,025 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 484 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:51,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 174 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72643 states. [2024-10-12 20:33:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72643 to 72643. [2024-10-12 20:33:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.4757578260510449) internal successors, (107202), 72642 states have internal predecessors, (107202), 0 states have call successors, (0), 0 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-12 20:33:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 107202 transitions. [2024-10-12 20:33:52,161 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 107202 transitions. Word has length 111 [2024-10-12 20:33:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:52,161 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 107202 transitions. [2024-10-12 20:33:52,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 107202 transitions. [2024-10-12 20:33:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:52,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:52,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:52,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:33:52,164 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:52,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -889848526, now seen corresponding path program 1 times [2024-10-12 20:33:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:52,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449987844] [2024-10-12 20:33:52,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:52,313 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-12 20:33:52,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449987844] [2024-10-12 20:33:52,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449987844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:52,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:52,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:52,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010932517] [2024-10-12 20:33:52,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:52,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:52,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:52,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:52,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:52,316 INFO L87 Difference]: Start difference. First operand 72643 states and 107202 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:53,200 INFO L93 Difference]: Finished difference Result 145221 states and 214339 transitions. [2024-10-12 20:33:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:53,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:53,280 INFO L225 Difference]: With dead ends: 145221 [2024-10-12 20:33:53,281 INFO L226 Difference]: Without dead ends: 72643 [2024-10-12 20:33:53,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:33:53,323 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 494 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:53,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 166 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72643 states. [2024-10-12 20:33:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72643 to 72643. [2024-10-12 20:33:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.4669474959389885) internal successors, (106562), 72642 states have internal predecessors, (106562), 0 states have call successors, (0), 0 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-12 20:33:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 106562 transitions. [2024-10-12 20:33:54,263 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 106562 transitions. Word has length 111 [2024-10-12 20:33:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:54,263 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 106562 transitions. [2024-10-12 20:33:54,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 106562 transitions. [2024-10-12 20:33:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:54,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:54,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:54,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:33:54,264 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:54,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1652712233, now seen corresponding path program 1 times [2024-10-12 20:33:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:54,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665723993] [2024-10-12 20:33:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:54,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:54,383 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-12 20:33:54,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:54,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665723993] [2024-10-12 20:33:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665723993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:54,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:54,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:54,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017735047] [2024-10-12 20:33:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:54,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:54,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:54,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:54,388 INFO L87 Difference]: Start difference. First operand 72643 states and 106562 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:54,714 INFO L93 Difference]: Finished difference Result 145221 states and 213059 transitions. [2024-10-12 20:33:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:54,794 INFO L225 Difference]: With dead ends: 145221 [2024-10-12 20:33:54,795 INFO L226 Difference]: Without dead ends: 72643 [2024-10-12 20:33:54,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:33:54,850 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 465 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:54,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 182 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72643 states. [2024-10-12 20:33:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72643 to 72643. [2024-10-12 20:33:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.458137165826932) internal successors, (105922), 72642 states have internal predecessors, (105922), 0 states have call successors, (0), 0 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-12 20:33:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 105922 transitions. [2024-10-12 20:33:56,513 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 105922 transitions. Word has length 111 [2024-10-12 20:33:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:56,513 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 105922 transitions. [2024-10-12 20:33:56,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 105922 transitions. [2024-10-12 20:33:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:56,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:56,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:56,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:33:56,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:56,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash -787179844, now seen corresponding path program 1 times [2024-10-12 20:33:56,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72495211] [2024-10-12 20:33:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72495211] [2024-10-12 20:33:56,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72495211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:56,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:56,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586768034] [2024-10-12 20:33:56,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:56,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:56,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:56,675 INFO L87 Difference]: Start difference. First operand 72643 states and 105922 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:57,111 INFO L93 Difference]: Finished difference Result 145221 states and 211779 transitions. [2024-10-12 20:33:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:57,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:57,193 INFO L225 Difference]: With dead ends: 145221 [2024-10-12 20:33:57,193 INFO L226 Difference]: Without dead ends: 72643 [2024-10-12 20:33:57,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:33:57,248 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 449 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:57,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 190 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:33:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72643 states. [2024-10-12 20:33:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72643 to 72643. [2024-10-12 20:33:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72643 states, 72642 states have (on average 1.4493268357148756) internal successors, (105282), 72642 states have internal predecessors, (105282), 0 states have call successors, (0), 0 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-12 20:33:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72643 states to 72643 states and 105282 transitions. [2024-10-12 20:33:58,469 INFO L78 Accepts]: Start accepts. Automaton has 72643 states and 105282 transitions. Word has length 111 [2024-10-12 20:33:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:58,469 INFO L471 AbstractCegarLoop]: Abstraction has 72643 states and 105282 transitions. [2024-10-12 20:33:58,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 72643 states and 105282 transitions. [2024-10-12 20:33:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 20:33:58,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:58,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:58,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:33:58,471 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:33:58,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1316470345, now seen corresponding path program 1 times [2024-10-12 20:33:58,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:58,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241948803] [2024-10-12 20:33:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:58,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:58,762 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-12 20:33:58,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:58,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241948803] [2024-10-12 20:33:58,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241948803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:58,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:33:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155988412] [2024-10-12 20:33:58,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:58,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:58,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:58,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:58,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:58,764 INFO L87 Difference]: Start difference. First operand 72643 states and 105282 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:33:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:58,982 INFO L93 Difference]: Finished difference Result 74693 states and 108355 transitions. [2024-10-12 20:33:58,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:58,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-12 20:33:58,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:59,088 INFO L225 Difference]: With dead ends: 74693 [2024-10-12 20:33:59,088 INFO L226 Difference]: Without dead ends: 74691 [2024-10-12 20:33:59,119 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-12 20:33:59,120 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:59,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 792 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:33:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74691 states. [2024-10-12 20:34:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74691 to 74691. [2024-10-12 20:34:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74691 states, 74690 states have (on average 1.4352925425090373) internal successors, (107202), 74690 states have internal predecessors, (107202), 0 states have call successors, (0), 0 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-12 20:34:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74691 states to 74691 states and 107202 transitions. [2024-10-12 20:34:00,409 INFO L78 Accepts]: Start accepts. Automaton has 74691 states and 107202 transitions. Word has length 111 [2024-10-12 20:34:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:00,409 INFO L471 AbstractCegarLoop]: Abstraction has 74691 states and 107202 transitions. [2024-10-12 20:34:00,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-12 20:34:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 74691 states and 107202 transitions. [2024-10-12 20:34:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 20:34:00,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:00,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:34:00,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:34:00,429 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:00,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 615396721, now seen corresponding path program 1 times [2024-10-12 20:34:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:00,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094085449] [2024-10-12 20:34:00,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 20:34:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094085449] [2024-10-12 20:34:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094085449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:01,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:34:01,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656595784] [2024-10-12 20:34:01,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:01,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:34:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:01,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:34:01,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:34:01,156 INFO L87 Difference]: Start difference. First operand 74691 states and 107202 transitions. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-12 20:34:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:03,405 INFO L93 Difference]: Finished difference Result 694869 states and 997131 transitions. [2024-10-12 20:34:03,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:34:03,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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 150 [2024-10-12 20:34:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:04,443 INFO L225 Difference]: With dead ends: 694869 [2024-10-12 20:34:04,444 INFO L226 Difference]: Without dead ends: 620243 [2024-10-12 20:34:04,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:34:04,614 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 2767 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2767 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:04,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2767 Valid, 2933 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:34:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620243 states. [2024-10-12 20:34:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620243 to 149315. [2024-10-12 20:34:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149315 states, 149314 states have (on average 1.4311986819722196) internal successors, (213698), 149314 states have internal predecessors, (213698), 0 states have call successors, (0), 0 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-12 20:34:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149315 states to 149315 states and 213698 transitions. [2024-10-12 20:34:10,358 INFO L78 Accepts]: Start accepts. Automaton has 149315 states and 213698 transitions. Word has length 150 [2024-10-12 20:34:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:10,359 INFO L471 AbstractCegarLoop]: Abstraction has 149315 states and 213698 transitions. [2024-10-12 20:34:10,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-12 20:34:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 149315 states and 213698 transitions. [2024-10-12 20:34:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 20:34:10,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:10,382 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:34:10,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:34:10,383 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:10,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:10,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1682316791, now seen corresponding path program 1 times [2024-10-12 20:34:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:10,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632338723] [2024-10-12 20:34:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 20:34:10,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:10,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632338723] [2024-10-12 20:34:10,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632338723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:10,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:10,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:34:10,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325053269] [2024-10-12 20:34:10,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:10,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:34:10,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:10,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:34:10,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:34:10,688 INFO L87 Difference]: Start difference. First operand 149315 states and 213698 transitions. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-12 20:34:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:13,308 INFO L93 Difference]: Finished difference Result 769493 states and 1103627 transitions. [2024-10-12 20:34:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:34:13,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 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 150 [2024-10-12 20:34:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:14,470 INFO L225 Difference]: With dead ends: 769493 [2024-10-12 20:34:14,470 INFO L226 Difference]: Without dead ends: 694867 [2024-10-12 20:34:15,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:34:15,575 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 2803 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2803 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:15,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2803 Valid, 2662 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:34:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694867 states. [2024-10-12 20:34:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694867 to 261315. [2024-10-12 20:34:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261315 states, 261314 states have (on average 1.4268887239106975) internal successors, (372866), 261314 states have internal predecessors, (372866), 0 states have call successors, (0), 0 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-12 20:34:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261315 states to 261315 states and 372866 transitions. [2024-10-12 20:34:22,520 INFO L78 Accepts]: Start accepts. Automaton has 261315 states and 372866 transitions. Word has length 150 [2024-10-12 20:34:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:22,520 INFO L471 AbstractCegarLoop]: Abstraction has 261315 states and 372866 transitions. [2024-10-12 20:34:22,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-12 20:34:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 261315 states and 372866 transitions. [2024-10-12 20:34:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 20:34:22,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:22,540 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:34:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:34:22,540 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:34:22,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1031515645, now seen corresponding path program 1 times [2024-10-12 20:34:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262345873] [2024-10-12 20:34:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 20:34:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262345873] [2024-10-12 20:34:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262345873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:22,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:22,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:34:22,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870104960] [2024-10-12 20:34:22,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:22,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:34:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:22,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:34:22,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:34:22,806 INFO L87 Difference]: Start difference. First operand 261315 states and 372866 transitions. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)