./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.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-var-start-time.3.1.ufo.BOUNDED-6.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 3da1085986a33686aa7ffc74caa759bc9bd987d241f97554ff5ad69a436a7e40 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:19:01,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:19:01,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:19:01,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:19:01,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:19:01,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:19:01,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:19:01,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:19:01,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:19:01,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:19:01,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:19:01,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:19:01,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:19:01,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:19:01,455 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:19:01,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:19:01,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:19:01,456 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:19:01,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:19:01,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:19:01,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:19:01,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:19:01,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:19:01,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:19:01,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:19:01,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:19:01,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:19:01,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:19:01,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:19:01,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:19:01,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:19:01,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:19:01,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:19:01,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:19:01,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:19:01,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:19:01,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:19:01,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:19:01,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:19:01,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:19:01,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:19:01,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:19:01,467 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 -> 3da1085986a33686aa7ffc74caa759bc9bd987d241f97554ff5ad69a436a7e40 [2024-10-12 20:19:01,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:19:01,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:19:01,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:19:01,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:19:01,755 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:19:01,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-12 20:19:03,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:19:03,336 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:19:03,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-12 20:19:03,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e412d0c63/cf43aa45a6904a6c9b7b940cb09e6153/FLAG9322c6b55 [2024-10-12 20:19:03,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e412d0c63/cf43aa45a6904a6c9b7b940cb09e6153 [2024-10-12 20:19:03,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:19:03,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:19:03,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:19:03,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:19:03,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:19:03,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:03,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1dfb5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03, skipping insertion in model container [2024-10-12 20:19:03,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:03,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:19:03,931 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2024-10-12 20:19:03,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:19:03,962 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:19:03,988 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2024-10-12 20:19:03,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:19:04,010 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:19:04,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04 WrapperNode [2024-10-12 20:19:04,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:19:04,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:19:04,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:19:04,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:19:04,016 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:19:04" (1/1) ... [2024-10-12 20:19:04,022 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:19:04" (1/1) ... [2024-10-12 20:19:04,055 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 367 [2024-10-12 20:19:04,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:19:04,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:19:04,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:19:04,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:19:04,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,087 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:19:04,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:19:04,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:19:04,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:19:04,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:19:04,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (1/1) ... [2024-10-12 20:19:04,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:19:04,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:04,146 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:19:04,148 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:19:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:19:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:19:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:19:04,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:19:04,335 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:19:04,337 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:19:04,674 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-12 20:19:04,676 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:19:04,711 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:19:04,712 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:19:04,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:19:04 BoogieIcfgContainer [2024-10-12 20:19:04,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:19:04,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:19:04,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:19:04,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:19:04,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:19:03" (1/3) ... [2024-10-12 20:19:04,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c45ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:19:04, skipping insertion in model container [2024-10-12 20:19:04,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:04" (2/3) ... [2024-10-12 20:19:04,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c45ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:19:04, skipping insertion in model container [2024-10-12 20:19:04,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:19:04" (3/3) ... [2024-10-12 20:19:04,722 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-12 20:19:04,735 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:19:04,735 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:19:04,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:19:04,791 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;@70c056c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:19:04,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:19:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 82 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 20:19:04,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:04,809 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] [2024-10-12 20:19:04,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:04,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1085213270, now seen corresponding path program 1 times [2024-10-12 20:19:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670650849] [2024-10-12 20:19:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:05,078 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:19:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:05,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670650849] [2024-10-12 20:19:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670650849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:05,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:05,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:05,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076948130] [2024-10-12 20:19:05,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:05,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:05,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:05,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:05,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:05,103 INFO L87 Difference]: Start difference. First operand has 83 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 82 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:19:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:05,142 INFO L93 Difference]: Finished difference Result 195 states and 314 transitions. [2024-10-12 20:19:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:05,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-12 20:19:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:05,153 INFO L225 Difference]: With dead ends: 195 [2024-10-12 20:19:05,153 INFO L226 Difference]: Without dead ends: 127 [2024-10-12 20:19:05,156 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:19:05,158 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 100 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 292 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:19:05,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 292 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-12 20:19:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-12 20:19:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.5080645161290323) internal successors, (187), 124 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:19:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 187 transitions. [2024-10-12 20:19:05,191 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 187 transitions. Word has length 36 [2024-10-12 20:19:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:05,192 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 187 transitions. [2024-10-12 20:19:05,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:19:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 187 transitions. [2024-10-12 20:19:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 20:19:05,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:05,193 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] [2024-10-12 20:19:05,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:19:05,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:05,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:05,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1921613256, now seen corresponding path program 1 times [2024-10-12 20:19:05,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:05,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429491796] [2024-10-12 20:19:05,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:05,316 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:19:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:05,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429491796] [2024-10-12 20:19:05,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429491796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:05,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:05,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:05,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852447301] [2024-10-12 20:19:05,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:05,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:05,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:05,323 INFO L87 Difference]: Start difference. First operand 125 states and 187 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:19:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:05,396 INFO L93 Difference]: Finished difference Result 305 states and 471 transitions. [2024-10-12 20:19:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-12 20:19:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:05,398 INFO L225 Difference]: With dead ends: 305 [2024-10-12 20:19:05,399 INFO L226 Difference]: Without dead ends: 199 [2024-10-12 20:19:05,399 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:19:05,403 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 81 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:05,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-12 20:19:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2024-10-12 20:19:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.530612244897959) internal successors, (300), 196 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:19:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 300 transitions. [2024-10-12 20:19:05,443 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 300 transitions. Word has length 37 [2024-10-12 20:19:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:05,443 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 300 transitions. [2024-10-12 20:19:05,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:19:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 300 transitions. [2024-10-12 20:19:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 20:19:05,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:05,448 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] [2024-10-12 20:19:05,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:19:05,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:05,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1122057593, now seen corresponding path program 1 times [2024-10-12 20:19:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:05,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771482290] [2024-10-12 20:19:05,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:05,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:05,592 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:19:05,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:05,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771482290] [2024-10-12 20:19:05,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771482290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:05,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:05,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151106851] [2024-10-12 20:19:05,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:05,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:05,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:05,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:05,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:05,595 INFO L87 Difference]: Start difference. First operand 197 states and 300 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:19:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:05,612 INFO L93 Difference]: Finished difference Result 489 states and 758 transitions. [2024-10-12 20:19:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:05,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-12 20:19:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:05,614 INFO L225 Difference]: With dead ends: 489 [2024-10-12 20:19:05,614 INFO L226 Difference]: Without dead ends: 311 [2024-10-12 20:19:05,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:05,616 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 76 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 237 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:19:05,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-12 20:19:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2024-10-12 20:19:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5324675324675325) internal successors, (472), 308 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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:19:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2024-10-12 20:19:05,633 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 38 [2024-10-12 20:19:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:05,633 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2024-10-12 20:19:05,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:19:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2024-10-12 20:19:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 20:19:05,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:05,635 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] [2024-10-12 20:19:05,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:19:05,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:05,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash -664411233, now seen corresponding path program 1 times [2024-10-12 20:19:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:05,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748906770] [2024-10-12 20:19:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:05,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:05,755 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:19:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:05,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748906770] [2024-10-12 20:19:05,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748906770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:05,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:05,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161696363] [2024-10-12 20:19:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:05,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:05,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:05,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:05,760 INFO L87 Difference]: Start difference. First operand 309 states and 472 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:19:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:05,859 INFO L93 Difference]: Finished difference Result 1469 states and 2284 transitions. [2024-10-12 20:19:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:05,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-12 20:19:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:05,864 INFO L225 Difference]: With dead ends: 1469 [2024-10-12 20:19:05,865 INFO L226 Difference]: Without dead ends: 1179 [2024-10-12 20:19:05,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:19:05,869 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 486 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:05,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 658 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-10-12 20:19:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 597. [2024-10-12 20:19:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.523489932885906) internal successors, (908), 596 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:19:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 908 transitions. [2024-10-12 20:19:05,895 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 908 transitions. Word has length 39 [2024-10-12 20:19:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:05,897 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 908 transitions. [2024-10-12 20:19:05,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:19:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 908 transitions. [2024-10-12 20:19:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 20:19:05,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:05,898 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] [2024-10-12 20:19:05,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:19:05,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:05,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash 858631940, now seen corresponding path program 1 times [2024-10-12 20:19:05,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:05,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371706389] [2024-10-12 20:19:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:05,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:06,011 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:19:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371706389] [2024-10-12 20:19:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371706389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:06,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729882825] [2024-10-12 20:19:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:06,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:06,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:06,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:06,014 INFO L87 Difference]: Start difference. First operand 597 states and 908 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:19:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:06,074 INFO L93 Difference]: Finished difference Result 2067 states and 3143 transitions. [2024-10-12 20:19:06,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:06,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-12 20:19:06,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:06,090 INFO L225 Difference]: With dead ends: 2067 [2024-10-12 20:19:06,091 INFO L226 Difference]: Without dead ends: 1489 [2024-10-12 20:19:06,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:06,093 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 323 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:06,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 328 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2024-10-12 20:19:06,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1485. [2024-10-12 20:19:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1484 states have (on average 1.5067385444743935) internal successors, (2236), 1484 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states 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:19:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2236 transitions. [2024-10-12 20:19:06,142 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2236 transitions. Word has length 40 [2024-10-12 20:19:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:06,142 INFO L471 AbstractCegarLoop]: Abstraction has 1485 states and 2236 transitions. [2024-10-12 20:19:06,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:19:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2236 transitions. [2024-10-12 20:19:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 20:19:06,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:06,144 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] [2024-10-12 20:19:06,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:19:06,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:06,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:06,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1083564261, now seen corresponding path program 1 times [2024-10-12 20:19:06,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:06,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367805479] [2024-10-12 20:19:06,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:06,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:06,229 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:19:06,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367805479] [2024-10-12 20:19:06,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367805479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:06,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:06,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539754712] [2024-10-12 20:19:06,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:06,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:06,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:06,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:06,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:06,233 INFO L87 Difference]: Start difference. First operand 1485 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:19:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:06,362 INFO L93 Difference]: Finished difference Result 4417 states and 6670 transitions. [2024-10-12 20:19:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:06,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-12 20:19:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:06,371 INFO L225 Difference]: With dead ends: 4417 [2024-10-12 20:19:06,371 INFO L226 Difference]: Without dead ends: 2951 [2024-10-12 20:19:06,373 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:19:06,374 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 496 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:06,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 137 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2024-10-12 20:19:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2024-10-12 20:19:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.4993215739484396) internal successors, (4420), 2948 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states 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:19:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4420 transitions. [2024-10-12 20:19:06,424 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4420 transitions. Word has length 42 [2024-10-12 20:19:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:06,424 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4420 transitions. [2024-10-12 20:19:06,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:19:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4420 transitions. [2024-10-12 20:19:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 20:19:06,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:06,428 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] [2024-10-12 20:19:06,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:19:06,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:06,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 542600406, now seen corresponding path program 1 times [2024-10-12 20:19:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:06,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012584133] [2024-10-12 20:19:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:06,676 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:19:06,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:06,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012584133] [2024-10-12 20:19:06,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012584133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:06,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:06,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135061523] [2024-10-12 20:19:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:06,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:06,682 INFO L87 Difference]: Start difference. First operand 2949 states and 4420 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:19:06,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:06,710 INFO L93 Difference]: Finished difference Result 3143 states and 4709 transitions. [2024-10-12 20:19:06,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:06,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-12 20:19:06,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:06,718 INFO L225 Difference]: With dead ends: 3143 [2024-10-12 20:19:06,718 INFO L226 Difference]: Without dead ends: 3141 [2024-10-12 20:19:06,718 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:19:06,720 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 444 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:19:06,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-10-12 20:19:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 3141. [2024-10-12 20:19:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.4687898089171973) internal successors, (4612), 3140 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states 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:19:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4612 transitions. [2024-10-12 20:19:06,759 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4612 transitions. Word has length 42 [2024-10-12 20:19:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:06,759 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4612 transitions. [2024-10-12 20:19:06,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:19:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4612 transitions. [2024-10-12 20:19:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 20:19:06,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:06,762 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] [2024-10-12 20:19:06,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:19:06,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:06,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash -348683587, now seen corresponding path program 1 times [2024-10-12 20:19:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:06,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393503538] [2024-10-12 20:19:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:06,812 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:19:06,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:06,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393503538] [2024-10-12 20:19:06,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393503538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:06,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:06,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:06,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714178017] [2024-10-12 20:19:06,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:06,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:06,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:06,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:06,815 INFO L87 Difference]: Start difference. First operand 3141 states and 4612 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:19:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:06,843 INFO L93 Difference]: Finished difference Result 7603 states and 11170 transitions. [2024-10-12 20:19:06,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:06,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-12 20:19:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:06,855 INFO L225 Difference]: With dead ends: 7603 [2024-10-12 20:19:06,855 INFO L226 Difference]: Without dead ends: 4481 [2024-10-12 20:19:06,857 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:19:06,858 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 66 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:06,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 234 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2024-10-12 20:19:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4479. [2024-10-12 20:19:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4479 states, 4478 states have (on average 1.4595801697186244) internal successors, (6536), 4478 states have internal predecessors, (6536), 0 states have call successors, (0), 0 states 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:19:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4479 states to 4479 states and 6536 transitions. [2024-10-12 20:19:06,914 INFO L78 Accepts]: Start accepts. Automaton has 4479 states and 6536 transitions. Word has length 43 [2024-10-12 20:19:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:06,914 INFO L471 AbstractCegarLoop]: Abstraction has 4479 states and 6536 transitions. [2024-10-12 20:19:06,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:19:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4479 states and 6536 transitions. [2024-10-12 20:19:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 20:19:06,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:06,916 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:06,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:19:06,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:06,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1611610844, now seen corresponding path program 1 times [2024-10-12 20:19:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367811376] [2024-10-12 20:19:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:07,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:07,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367811376] [2024-10-12 20:19:07,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367811376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:07,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897468545] [2024-10-12 20:19:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:07,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:07,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:07,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:07,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:19:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:07,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 20:19:07,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:19:07,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:19:07,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897468545] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:07,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 16 [2024-10-12 20:19:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832676204] [2024-10-12 20:19:07,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:07,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 20:19:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:07,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 20:19:07,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:19:07,863 INFO L87 Difference]: Start difference. First operand 4479 states and 6536 transitions. Second operand has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:19:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:09,857 INFO L93 Difference]: Finished difference Result 22339 states and 32330 transitions. [2024-10-12 20:19:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-10-12 20:19:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-12 20:19:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:09,900 INFO L225 Difference]: With dead ends: 22339 [2024-10-12 20:19:09,900 INFO L226 Difference]: Without dead ends: 18365 [2024-10-12 20:19:09,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=933, Invalid=3897, Unknown=0, NotChecked=0, Total=4830 [2024-10-12 20:19:09,909 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 3344 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3344 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:09,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3344 Valid, 1511 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:19:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18365 states. [2024-10-12 20:19:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18365 to 15627. [2024-10-12 20:19:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15627 states, 15626 states have (on average 1.4402918213234353) internal successors, (22506), 15626 states have internal predecessors, (22506), 0 states have call successors, (0), 0 states 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:19:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15627 states to 15627 states and 22506 transitions. [2024-10-12 20:19:10,172 INFO L78 Accepts]: Start accepts. Automaton has 15627 states and 22506 transitions. Word has length 60 [2024-10-12 20:19:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:10,172 INFO L471 AbstractCegarLoop]: Abstraction has 15627 states and 22506 transitions. [2024-10-12 20:19:10,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:19:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 15627 states and 22506 transitions. [2024-10-12 20:19:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:19:10,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:10,175 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:10,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 20:19:10,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:10,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:10,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1774270321, now seen corresponding path program 1 times [2024-10-12 20:19:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49584377] [2024-10-12 20:19:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:10,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:10,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49584377] [2024-10-12 20:19:10,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49584377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:10,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:10,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:10,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53947531] [2024-10-12 20:19:10,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:10,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:10,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:10,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:10,420 INFO L87 Difference]: Start difference. First operand 15627 states and 22506 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:19:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:10,563 INFO L93 Difference]: Finished difference Result 25123 states and 35974 transitions. [2024-10-12 20:19:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:10,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 20:19:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:10,584 INFO L225 Difference]: With dead ends: 25123 [2024-10-12 20:19:10,585 INFO L226 Difference]: Without dead ends: 16160 [2024-10-12 20:19:10,593 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:19:10,593 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 67 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:10,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16160 states. [2024-10-12 20:19:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16160 to 15716. [2024-10-12 20:19:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15716 states, 15715 states have (on average 1.41228125994273) internal successors, (22194), 15715 states have internal predecessors, (22194), 0 states have call successors, (0), 0 states 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:19:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15716 states to 15716 states and 22194 transitions. [2024-10-12 20:19:10,756 INFO L78 Accepts]: Start accepts. Automaton has 15716 states and 22194 transitions. Word has length 61 [2024-10-12 20:19:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:10,756 INFO L471 AbstractCegarLoop]: Abstraction has 15716 states and 22194 transitions. [2024-10-12 20:19:10,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:19:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 15716 states and 22194 transitions. [2024-10-12 20:19:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:19:10,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:10,758 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:10,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:19:10,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:10,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1902637812, now seen corresponding path program 1 times [2024-10-12 20:19:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:10,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087943775] [2024-10-12 20:19:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:10,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:10,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087943775] [2024-10-12 20:19:10,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087943775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:10,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:10,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:10,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297606201] [2024-10-12 20:19:10,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:10,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:10,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:10,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:10,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:10,798 INFO L87 Difference]: Start difference. First operand 15716 states and 22194 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:19:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:10,865 INFO L93 Difference]: Finished difference Result 39143 states and 54916 transitions. [2024-10-12 20:19:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 20:19:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:11,053 INFO L225 Difference]: With dead ends: 39143 [2024-10-12 20:19:11,058 INFO L226 Difference]: Without dead ends: 26344 [2024-10-12 20:19:11,070 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:19:11,073 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:11,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 220 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26344 states. [2024-10-12 20:19:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26344 to 26293. [2024-10-12 20:19:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26293 states, 26292 states have (on average 1.3832344439373194) internal successors, (36368), 26292 states have internal predecessors, (36368), 0 states have call successors, (0), 0 states 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:19:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26293 states to 26293 states and 36368 transitions. [2024-10-12 20:19:11,664 INFO L78 Accepts]: Start accepts. Automaton has 26293 states and 36368 transitions. Word has length 61 [2024-10-12 20:19:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:11,664 INFO L471 AbstractCegarLoop]: Abstraction has 26293 states and 36368 transitions. [2024-10-12 20:19:11,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:19:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 26293 states and 36368 transitions. [2024-10-12 20:19:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:19:11,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:11,668 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:11,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:19:11,669 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:11,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1440820303, now seen corresponding path program 1 times [2024-10-12 20:19:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023652613] [2024-10-12 20:19:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:11,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023652613] [2024-10-12 20:19:11,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023652613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:11,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:11,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:11,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579138926] [2024-10-12 20:19:11,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:11,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:11,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:11,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:11,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:11,729 INFO L87 Difference]: Start difference. First operand 26293 states and 36368 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:19:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:11,903 INFO L93 Difference]: Finished difference Result 53590 states and 73936 transitions. [2024-10-12 20:19:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:11,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 20:19:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:11,942 INFO L225 Difference]: With dead ends: 53590 [2024-10-12 20:19:11,942 INFO L226 Difference]: Without dead ends: 29491 [2024-10-12 20:19:11,968 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:19:11,969 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:11,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 264 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29491 states. [2024-10-12 20:19:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29491 to 26066. [2024-10-12 20:19:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26066 states, 26065 states have (on average 1.3648954536735085) internal successors, (35576), 26065 states have internal predecessors, (35576), 0 states have call successors, (0), 0 states 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:19:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26066 states to 26066 states and 35576 transitions. [2024-10-12 20:19:12,455 INFO L78 Accepts]: Start accepts. Automaton has 26066 states and 35576 transitions. Word has length 61 [2024-10-12 20:19:12,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:12,455 INFO L471 AbstractCegarLoop]: Abstraction has 26066 states and 35576 transitions. [2024-10-12 20:19:12,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:19:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 26066 states and 35576 transitions. [2024-10-12 20:19:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:19:12,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:12,458 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:12,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:19:12,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:12,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 977464216, now seen corresponding path program 1 times [2024-10-12 20:19:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:12,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580774240] [2024-10-12 20:19:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:19:12,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:12,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580774240] [2024-10-12 20:19:12,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580774240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:12,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:12,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488037949] [2024-10-12 20:19:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:12,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:12,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:12,525 INFO L87 Difference]: Start difference. First operand 26066 states and 35576 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:12,780 INFO L93 Difference]: Finished difference Result 49876 states and 68698 transitions. [2024-10-12 20:19:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:12,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-12 20:19:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:12,845 INFO L225 Difference]: With dead ends: 49876 [2024-10-12 20:19:12,846 INFO L226 Difference]: Without dead ends: 42340 [2024-10-12 20:19:12,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:12,866 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 340 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:12,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 549 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42340 states. [2024-10-12 20:19:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42340 to 33260. [2024-10-12 20:19:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33260 states, 33259 states have (on average 1.363270092305842) internal successors, (45341), 33259 states have internal predecessors, (45341), 0 states have call successors, (0), 0 states 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:19:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33260 states to 33260 states and 45341 transitions. [2024-10-12 20:19:13,414 INFO L78 Accepts]: Start accepts. Automaton has 33260 states and 45341 transitions. Word has length 61 [2024-10-12 20:19:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:13,415 INFO L471 AbstractCegarLoop]: Abstraction has 33260 states and 45341 transitions. [2024-10-12 20:19:13,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33260 states and 45341 transitions. [2024-10-12 20:19:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:19:13,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:13,419 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:13,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:19:13,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:13,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1662623151, now seen corresponding path program 1 times [2024-10-12 20:19:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729344846] [2024-10-12 20:19:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:19:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729344846] [2024-10-12 20:19:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729344846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:13,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:13,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372593437] [2024-10-12 20:19:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:13,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:13,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:13,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:13,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:13,512 INFO L87 Difference]: Start difference. First operand 33260 states and 45341 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:13,791 INFO L93 Difference]: Finished difference Result 57849 states and 79499 transitions. [2024-10-12 20:19:13,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:13,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-12 20:19:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:13,840 INFO L225 Difference]: With dead ends: 57849 [2024-10-12 20:19:13,840 INFO L226 Difference]: Without dead ends: 47595 [2024-10-12 20:19:13,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:13,856 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 335 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:13,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 575 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47595 states. [2024-10-12 20:19:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47595 to 41574. [2024-10-12 20:19:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41574 states, 41573 states have (on average 1.3585259663724052) internal successors, (56478), 41573 states have internal predecessors, (56478), 0 states have call successors, (0), 0 states 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:19:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41574 states to 41574 states and 56478 transitions. [2024-10-12 20:19:14,585 INFO L78 Accepts]: Start accepts. Automaton has 41574 states and 56478 transitions. Word has length 61 [2024-10-12 20:19:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:14,585 INFO L471 AbstractCegarLoop]: Abstraction has 41574 states and 56478 transitions. [2024-10-12 20:19:14,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 41574 states and 56478 transitions. [2024-10-12 20:19:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:19:14,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:14,598 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:14,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:19:14,599 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:14,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:14,599 INFO L85 PathProgramCache]: Analyzing trace with hash -337091279, now seen corresponding path program 1 times [2024-10-12 20:19:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:14,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488032307] [2024-10-12 20:19:14,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:19:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488032307] [2024-10-12 20:19:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488032307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:14,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:14,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:14,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184748605] [2024-10-12 20:19:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:14,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:14,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:14,675 INFO L87 Difference]: Start difference. First operand 41574 states and 56478 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:19:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:14,902 INFO L93 Difference]: Finished difference Result 80048 states and 108816 transitions. [2024-10-12 20:19:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:14,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 62 [2024-10-12 20:19:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:14,946 INFO L225 Difference]: With dead ends: 80048 [2024-10-12 20:19:14,947 INFO L226 Difference]: Without dead ends: 38530 [2024-10-12 20:19:14,976 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:19:14,977 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 82 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:14,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 123 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38530 states. [2024-10-12 20:19:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38530 to 37055. [2024-10-12 20:19:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37055 states, 37054 states have (on average 1.3416365304690452) internal successors, (49713), 37054 states have internal predecessors, (49713), 0 states have call successors, (0), 0 states 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:19:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37055 states to 37055 states and 49713 transitions. [2024-10-12 20:19:15,453 INFO L78 Accepts]: Start accepts. Automaton has 37055 states and 49713 transitions. Word has length 62 [2024-10-12 20:19:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:15,453 INFO L471 AbstractCegarLoop]: Abstraction has 37055 states and 49713 transitions. [2024-10-12 20:19:15,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:19:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 37055 states and 49713 transitions. [2024-10-12 20:19:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:19:15,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:15,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:15,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:19:15,456 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:15,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1360545378, now seen corresponding path program 1 times [2024-10-12 20:19:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:15,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853273906] [2024-10-12 20:19:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:15,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:19:15,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:15,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853273906] [2024-10-12 20:19:15,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853273906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:15,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:15,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:19:15,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482527474] [2024-10-12 20:19:15,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:15,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:15,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:15,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:15,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:15,520 INFO L87 Difference]: Start difference. First operand 37055 states and 49713 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:15,786 INFO L93 Difference]: Finished difference Result 61739 states and 83594 transitions. [2024-10-12 20:19:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:15,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-12 20:19:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:15,845 INFO L225 Difference]: With dead ends: 61739 [2024-10-12 20:19:15,846 INFO L226 Difference]: Without dead ends: 51489 [2024-10-12 20:19:15,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:15,867 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 322 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:15,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 543 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51489 states. [2024-10-12 20:19:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51489 to 44871. [2024-10-12 20:19:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44871 states, 44870 states have (on average 1.3396924448406509) internal successors, (60112), 44870 states have internal predecessors, (60112), 0 states have call successors, (0), 0 states 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:19:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44871 states to 44871 states and 60112 transitions. [2024-10-12 20:19:16,533 INFO L78 Accepts]: Start accepts. Automaton has 44871 states and 60112 transitions. Word has length 62 [2024-10-12 20:19:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:16,534 INFO L471 AbstractCegarLoop]: Abstraction has 44871 states and 60112 transitions. [2024-10-12 20:19:16,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 44871 states and 60112 transitions. [2024-10-12 20:19:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:19:16,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:16,539 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:16,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:19:16,539 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:16,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:16,540 INFO L85 PathProgramCache]: Analyzing trace with hash 561582588, now seen corresponding path program 1 times [2024-10-12 20:19:16,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:16,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859431528] [2024-10-12 20:19:16,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:16,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:19:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859431528] [2024-10-12 20:19:16,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859431528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:16,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:16,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:16,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080532130] [2024-10-12 20:19:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:16,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:19:16,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:16,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:19:16,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:19:16,612 INFO L87 Difference]: Start difference. First operand 44871 states and 60112 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:16,873 INFO L93 Difference]: Finished difference Result 103537 states and 138448 transitions. [2024-10-12 20:19:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:19:16,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-12 20:19:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:16,941 INFO L225 Difference]: With dead ends: 103537 [2024-10-12 20:19:16,942 INFO L226 Difference]: Without dead ends: 58727 [2024-10-12 20:19:16,982 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:19:16,982 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 437 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:16,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 139 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58727 states. [2024-10-12 20:19:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58727 to 58141. [2024-10-12 20:19:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58141 states, 58140 states have (on average 1.3245098039215686) internal successors, (77007), 58140 states have internal predecessors, (77007), 0 states have call successors, (0), 0 states 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:19:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58141 states to 58141 states and 77007 transitions. [2024-10-12 20:19:17,815 INFO L78 Accepts]: Start accepts. Automaton has 58141 states and 77007 transitions. Word has length 66 [2024-10-12 20:19:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:17,816 INFO L471 AbstractCegarLoop]: Abstraction has 58141 states and 77007 transitions. [2024-10-12 20:19:17,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 58141 states and 77007 transitions. [2024-10-12 20:19:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:19:17,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:17,820 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:17,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:19:17,820 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:17,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1883270751, now seen corresponding path program 1 times [2024-10-12 20:19:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:17,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518920697] [2024-10-12 20:19:17,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518920697] [2024-10-12 20:19:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518920697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251576323] [2024-10-12 20:19:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:17,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:17,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:17,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:17,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:19:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:17,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:19:17,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:18,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251576323] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:18,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:18,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 20:19:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935749927] [2024-10-12 20:19:18,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:18,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:19:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:18,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:19:18,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:19:18,510 INFO L87 Difference]: Start difference. First operand 58141 states and 77007 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:18,887 INFO L93 Difference]: Finished difference Result 137042 states and 182050 transitions. [2024-10-12 20:19:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:19:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-12 20:19:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:19,008 INFO L225 Difference]: With dead ends: 137042 [2024-10-12 20:19:19,009 INFO L226 Difference]: Without dead ends: 100592 [2024-10-12 20:19:19,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:19:19,055 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1390 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:19,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 302 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100592 states. [2024-10-12 20:19:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100592 to 69474. [2024-10-12 20:19:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69474 states, 69473 states have (on average 1.3254069926446246) internal successors, (92080), 69473 states have internal predecessors, (92080), 0 states have call successors, (0), 0 states 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:19:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69474 states to 69474 states and 92080 transitions. [2024-10-12 20:19:20,048 INFO L78 Accepts]: Start accepts. Automaton has 69474 states and 92080 transitions. Word has length 66 [2024-10-12 20:19:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:20,048 INFO L471 AbstractCegarLoop]: Abstraction has 69474 states and 92080 transitions. [2024-10-12 20:19:20,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:19:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 69474 states and 92080 transitions. [2024-10-12 20:19:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 20:19:20,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:20,053 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:20,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:19:20,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 20:19:20,258 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2036642874, now seen corresponding path program 1 times [2024-10-12 20:19:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593426841] [2024-10-12 20:19:20,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:20,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:20,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:20,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593426841] [2024-10-12 20:19:20,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593426841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:20,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743084027] [2024-10-12 20:19:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:20,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:20,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:20,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:20,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:19:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:21,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:19:21,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:21,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:21,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743084027] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:21,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:21,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 20:19:21,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479890388] [2024-10-12 20:19:21,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:21,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:19:21,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:21,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:19:21,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:19:21,281 INFO L87 Difference]: Start difference. First operand 69474 states and 92080 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:19:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:21,705 INFO L93 Difference]: Finished difference Result 126645 states and 167211 transitions. [2024-10-12 20:19:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:19:21,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 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 66 [2024-10-12 20:19:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:21,816 INFO L225 Difference]: With dead ends: 126645 [2024-10-12 20:19:21,817 INFO L226 Difference]: Without dead ends: 91901 [2024-10-12 20:19:21,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:19:21,864 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 741 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:21,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 315 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:21,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91901 states. [2024-10-12 20:19:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91901 to 75297. [2024-10-12 20:19:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75297 states, 75296 states have (on average 1.321424776880578) internal successors, (99498), 75296 states have internal predecessors, (99498), 0 states have call successors, (0), 0 states 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:19:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75297 states to 75297 states and 99498 transitions. [2024-10-12 20:19:23,213 INFO L78 Accepts]: Start accepts. Automaton has 75297 states and 99498 transitions. Word has length 66 [2024-10-12 20:19:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:23,213 INFO L471 AbstractCegarLoop]: Abstraction has 75297 states and 99498 transitions. [2024-10-12 20:19:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:19:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 75297 states and 99498 transitions. [2024-10-12 20:19:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 20:19:23,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:23,219 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:19:23,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 20:19:23,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:23,420 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:23,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash -432252977, now seen corresponding path program 1 times [2024-10-12 20:19:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983984928] [2024-10-12 20:19:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983984928] [2024-10-12 20:19:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983984928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361385409] [2024-10-12 20:19:23,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:23,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:23,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:23,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:23,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:19:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:23,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:19:23,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:23,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361385409] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:23,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 20:19:23,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256618807] [2024-10-12 20:19:23,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:23,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:19:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:19:23,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:19:23,905 INFO L87 Difference]: Start difference. First operand 75297 states and 99498 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:19:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:25,120 INFO L93 Difference]: Finished difference Result 150186 states and 197755 transitions. [2024-10-12 20:19:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:19:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 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 67 [2024-10-12 20:19:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:25,211 INFO L225 Difference]: With dead ends: 150186 [2024-10-12 20:19:25,212 INFO L226 Difference]: Without dead ends: 88402 [2024-10-12 20:19:25,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:19:25,226 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 699 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:25,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 286 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88402 states. [2024-10-12 20:19:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88402 to 75970. [2024-10-12 20:19:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75970 states, 75969 states have (on average 1.315510273927523) internal successors, (99938), 75969 states have internal predecessors, (99938), 0 states have call successors, (0), 0 states 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:19:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75970 states to 75970 states and 99938 transitions. [2024-10-12 20:19:26,612 INFO L78 Accepts]: Start accepts. Automaton has 75970 states and 99938 transitions. Word has length 67 [2024-10-12 20:19:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:26,612 INFO L471 AbstractCegarLoop]: Abstraction has 75970 states and 99938 transitions. [2024-10-12 20:19:26,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:19:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 75970 states and 99938 transitions. [2024-10-12 20:19:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 20:19:26,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:26,618 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:26,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 20:19:26,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:26,818 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:26,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1037283468, now seen corresponding path program 1 times [2024-10-12 20:19:26,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:26,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272791310] [2024-10-12 20:19:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:27,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:27,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272791310] [2024-10-12 20:19:27,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272791310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:27,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760319409] [2024-10-12 20:19:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:27,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:27,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:27,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:27,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:19:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:27,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:19:27,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:27,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760319409] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:27,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-12 20:19:27,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394364959] [2024-10-12 20:19:27,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:27,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 20:19:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:27,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 20:19:27,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:19:27,770 INFO L87 Difference]: Start difference. First operand 75970 states and 99938 transitions. Second operand has 19 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 18 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:19:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:29,733 INFO L93 Difference]: Finished difference Result 337733 states and 443327 transitions. [2024-10-12 20:19:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 20:19:29,734 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 18 states have internal predecessors, (147), 0 states have call successors, (0), 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 68 [2024-10-12 20:19:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:30,112 INFO L225 Difference]: With dead ends: 337733 [2024-10-12 20:19:30,113 INFO L226 Difference]: Without dead ends: 261649 [2024-10-12 20:19:30,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=366, Invalid=1194, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 20:19:30,213 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1337 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:30,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 1330 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:19:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261649 states. [2024-10-12 20:19:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261649 to 154352. [2024-10-12 20:19:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154352 states, 154351 states have (on average 1.3024988500236474) internal successors, (201042), 154351 states have internal predecessors, (201042), 0 states have call successors, (0), 0 states 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:19:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154352 states to 154352 states and 201042 transitions. [2024-10-12 20:19:33,517 INFO L78 Accepts]: Start accepts. Automaton has 154352 states and 201042 transitions. Word has length 68 [2024-10-12 20:19:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:33,517 INFO L471 AbstractCegarLoop]: Abstraction has 154352 states and 201042 transitions. [2024-10-12 20:19:33,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 18 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:19:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 154352 states and 201042 transitions. [2024-10-12 20:19:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 20:19:33,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:33,524 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:33,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 20:19:33,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:33,727 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:33,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:33,728 INFO L85 PathProgramCache]: Analyzing trace with hash 663141039, now seen corresponding path program 1 times [2024-10-12 20:19:33,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:33,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110489542] [2024-10-12 20:19:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:33,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:33,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110489542] [2024-10-12 20:19:33,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110489542] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:19:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123736439] [2024-10-12 20:19:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:33,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:33,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:33,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:19:33,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 20:19:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:34,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 20:19:34,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:19:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:35,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:19:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:36,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123736439] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:19:36,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:19:36,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-12 20:19:36,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043352034] [2024-10-12 20:19:36,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:19:36,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 20:19:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 20:19:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:19:36,219 INFO L87 Difference]: Start difference. First operand 154352 states and 201042 transitions. Second operand has 29 states, 29 states have (on average 6.137931034482759) internal successors, (178), 28 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:19:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:49,844 INFO L93 Difference]: Finished difference Result 694265 states and 893529 transitions. [2024-10-12 20:19:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2024-10-12 20:19:49,845 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.137931034482759) internal successors, (178), 28 states have internal predecessors, (178), 0 states have call successors, (0), 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 68 [2024-10-12 20:19:49,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:51,501 INFO L225 Difference]: With dead ends: 694265 [2024-10-12 20:19:51,501 INFO L226 Difference]: Without dead ends: 574986 [2024-10-12 20:19:51,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30842 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=9398, Invalid=62694, Unknown=0, NotChecked=0, Total=72092 [2024-10-12 20:19:51,675 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 7601 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 4558 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7601 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 4627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:51,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7601 Valid, 3053 Invalid, 4627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4558 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 20:19:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574986 states. [2024-10-12 20:19:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574986 to 229846. [2024-10-12 20:19:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229846 states, 229845 states have (on average 1.3012029846200701) internal successors, (299075), 229845 states have internal predecessors, (299075), 0 states have call successors, (0), 0 states 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:19:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229846 states to 229846 states and 299075 transitions. [2024-10-12 20:19:56,576 INFO L78 Accepts]: Start accepts. Automaton has 229846 states and 299075 transitions. Word has length 68 [2024-10-12 20:19:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:56,577 INFO L471 AbstractCegarLoop]: Abstraction has 229846 states and 299075 transitions. [2024-10-12 20:19:56,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.137931034482759) internal successors, (178), 28 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:19:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 229846 states and 299075 transitions. [2024-10-12 20:19:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:19:56,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:56,584 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:19:56,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 20:19:56,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:19:56,785 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:56,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash 962524779, now seen corresponding path program 1 times [2024-10-12 20:19:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072869435] [2024-10-12 20:19:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:56,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:56,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:56,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072869435] [2024-10-12 20:19:56,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072869435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:56,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:56,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664212294] [2024-10-12 20:19:56,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:56,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:56,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:56,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:56,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:56,838 INFO L87 Difference]: Start difference. First operand 229846 states and 299075 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:19:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:58,189 INFO L93 Difference]: Finished difference Result 292066 states and 379104 transitions. [2024-10-12 20:19:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-10-12 20:19:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:58,494 INFO L225 Difference]: With dead ends: 292066 [2024-10-12 20:19:58,494 INFO L226 Difference]: Without dead ends: 208380 [2024-10-12 20:19:58,576 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:19:58,577 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 58 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:58,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 251 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208380 states. [2024-10-12 20:20:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208380 to 208378. [2024-10-12 20:20:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208378 states, 208377 states have (on average 1.2821808548928144) internal successors, (267177), 208377 states have internal predecessors, (267177), 0 states have call successors, (0), 0 states 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:20:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208378 states to 208378 states and 267177 transitions. [2024-10-12 20:20:01,377 INFO L78 Accepts]: Start accepts. Automaton has 208378 states and 267177 transitions. Word has length 69 [2024-10-12 20:20:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:01,377 INFO L471 AbstractCegarLoop]: Abstraction has 208378 states and 267177 transitions. [2024-10-12 20:20:01,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:20:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 208378 states and 267177 transitions. [2024-10-12 20:20:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 20:20:01,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:01,384 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:20:01,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:20:01,385 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:01,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1296589406, now seen corresponding path program 1 times [2024-10-12 20:20:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:01,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411598804] [2024-10-12 20:20:01,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:01,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:20:01,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:01,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411598804] [2024-10-12 20:20:01,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411598804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:20:01,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:20:01,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:20:01,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813122443] [2024-10-12 20:20:01,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:20:01,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:20:01,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:01,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:20:01,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:20:01,430 INFO L87 Difference]: Start difference. First operand 208378 states and 267177 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:20:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:20:02,969 INFO L93 Difference]: Finished difference Result 367063 states and 470557 transitions. [2024-10-12 20:20:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:20:02,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 69 [2024-10-12 20:20:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:20:03,141 INFO L225 Difference]: With dead ends: 367063 [2024-10-12 20:20:03,141 INFO L226 Difference]: Without dead ends: 158745 [2024-10-12 20:20:03,205 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:20:03,206 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 84 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:20:03,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 127 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:20:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158745 states. [2024-10-12 20:20:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158745 to 158670. [2024-10-12 20:20:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158670 states, 158669 states have (on average 1.2656662612104443) internal successors, (200822), 158669 states have internal predecessors, (200822), 0 states have call successors, (0), 0 states 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:20:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158670 states to 158670 states and 200822 transitions. [2024-10-12 20:20:05,849 INFO L78 Accepts]: Start accepts. Automaton has 158670 states and 200822 transitions. Word has length 69 [2024-10-12 20:20:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:20:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 158670 states and 200822 transitions. [2024-10-12 20:20:05,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:20:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 158670 states and 200822 transitions. [2024-10-12 20:20:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 20:20:05,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:20:05,855 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:20:05,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:20:05,855 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:20:05,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:20:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash 30985211, now seen corresponding path program 1 times [2024-10-12 20:20:05,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:20:05,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220301417] [2024-10-12 20:20:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:20:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:06,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:20:06,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220301417] [2024-10-12 20:20:06,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220301417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:20:06,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002692274] [2024-10-12 20:20:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:20:06,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:20:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:20:06,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:20:06,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 20:20:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:20:06,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 20:20:06,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:20:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:08,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:20:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:20:09,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002692274] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:20:09,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:20:09,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2024-10-12 20:20:09,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856868360] [2024-10-12 20:20:09,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:20:09,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-12 20:20:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:20:09,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-12 20:20:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2024-10-12 20:20:09,440 INFO L87 Difference]: Start difference. First operand 158670 states and 200822 transitions. Second operand has 42 states, 42 states have (on average 4.404761904761905) internal successors, (185), 42 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)