./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.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 6ccc8126940cf3f46bcb3993cc3f2567a1d57b3d9eef9ad8f60ee950111ffdfc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:25:54,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:25:54,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:25:54,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:25:54,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:25:54,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:25:54,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:25:54,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:25:54,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:25:54,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:25:54,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:25:54,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:25:54,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:25:54,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:25:54,955 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:25:54,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:25:54,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:25:54,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:25:54,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:25:54,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:25:54,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:25:54,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:25:54,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:25:54,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:25:54,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:25:54,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:25:54,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:25:54,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:25:54,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:25:54,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:25:54,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:25:54,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:25:54,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:25:54,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:25:54,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:25:54,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:25:54,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:25:54,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:25:54,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:25:54,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:25:54,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:25:54,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:25:54,963 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 -> 6ccc8126940cf3f46bcb3993cc3f2567a1d57b3d9eef9ad8f60ee950111ffdfc [2024-10-12 21:25:55,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:25:55,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:25:55,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:25:55,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:25:55,169 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:25:55,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c [2024-10-12 21:25:56,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:25:56,818 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:25:56,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c [2024-10-12 21:25:56,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21edbd57/d8df396960b44f989943d5c005fb4769/FLAG145d5fe0a [2024-10-12 21:25:56,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21edbd57/d8df396960b44f989943d5c005fb4769 [2024-10-12 21:25:56,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:25:56,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:25:56,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:25:56,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:25:56,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:25:56,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:25:56" (1/1) ... [2024-10-12 21:25:56,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b60a9ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:56, skipping insertion in model container [2024-10-12 21:25:56,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:25:56" (1/1) ... [2024-10-12 21:25:56,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:25:57,197 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c[8616,8629] [2024-10-12 21:25:57,223 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c[11433,11446] [2024-10-12 21:25:57,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:25:57,815 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:25:57,839 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c[8616,8629] [2024-10-12 21:25:57,843 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c[11433,11446] [2024-10-12 21:25:58,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:25:58,148 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:25:58,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58 WrapperNode [2024-10-12 21:25:58,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:25:58,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:25:58,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:25:58,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:25:58,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,411 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5039 [2024-10-12 21:25:58,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:25:58,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:25:58,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:25:58,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:25:58,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,670 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 21:25:58,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:25:58,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:25:58,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:25:58,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:25:58,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (1/1) ... [2024-10-12 21:25:58,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:25:58,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:25:58,943 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 21:25:58,944 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 21:25:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:25:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:25:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:25:58,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:25:59,063 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:25:59,065 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:26:01,984 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2024-10-12 21:26:01,985 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:26:02,027 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:26:02,027 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:26:02,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:26:02 BoogieIcfgContainer [2024-10-12 21:26:02,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:26:02,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:26:02,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:26:02,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:26:02,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:25:56" (1/3) ... [2024-10-12 21:26:02,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef65fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:26:02, skipping insertion in model container [2024-10-12 21:26:02,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:25:58" (2/3) ... [2024-10-12 21:26:02,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef65fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:26:02, skipping insertion in model container [2024-10-12 21:26:02,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:26:02" (3/3) ... [2024-10-12 21:26:02,034 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c [2024-10-12 21:26:02,045 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:26:02,045 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:26:02,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:26:02,121 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;@7b75940c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:26:02,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:26:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 820 states, 817 states have (on average 1.97796817625459) internal successors, (1616), 819 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states 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 21:26:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:26:02,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:02,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:02,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash -915082471, now seen corresponding path program 1 times [2024-10-12 21:26:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:02,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038686007] [2024-10-12 21:26:02,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:02,371 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 21:26:02,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:02,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038686007] [2024-10-12 21:26:02,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038686007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:02,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:02,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:26:02,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498142028] [2024-10-12 21:26:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:02,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:26:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:26:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:26:02,400 INFO L87 Difference]: Start difference. First operand has 820 states, 817 states have (on average 1.97796817625459) internal successors, (1616), 819 states have internal predecessors, (1616), 0 states have call successors, (0), 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 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 21:26:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:02,480 INFO L93 Difference]: Finished difference Result 1613 states and 3180 transitions. [2024-10-12 21:26:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:26:02,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 21:26:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:02,494 INFO L225 Difference]: With dead ends: 1613 [2024-10-12 21:26:02,494 INFO L226 Difference]: Without dead ends: 816 [2024-10-12 21:26:02,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:26:02,500 INFO L432 NwaCegarLoop]: 1545 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:02,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1545 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-10-12 21:26:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2024-10-12 21:26:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.898034398034398) internal successors, (1545), 815 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states 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 21:26:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1545 transitions. [2024-10-12 21:26:02,555 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1545 transitions. Word has length 19 [2024-10-12 21:26:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:02,555 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1545 transitions. [2024-10-12 21:26:02,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 21:26:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1545 transitions. [2024-10-12 21:26:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:26:02,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:02,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:02,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:26:02,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:02,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2100021147, now seen corresponding path program 1 times [2024-10-12 21:26:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:02,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390518975] [2024-10-12 21:26:02,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:02,644 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 21:26:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:02,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390518975] [2024-10-12 21:26:02,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390518975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:02,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:02,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:26:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358214674] [2024-10-12 21:26:02,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:02,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:26:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:26:02,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:26:02,647 INFO L87 Difference]: Start difference. First operand 816 states and 1545 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 21:26:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:02,746 INFO L93 Difference]: Finished difference Result 889 states and 1660 transitions. [2024-10-12 21:26:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:26:02,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 21:26:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:02,751 INFO L225 Difference]: With dead ends: 889 [2024-10-12 21:26:02,751 INFO L226 Difference]: Without dead ends: 851 [2024-10-12 21:26:02,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:26:02,753 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 55 mSDsluCounter, 3052 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4592 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:02,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4592 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-10-12 21:26:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 816. [2024-10-12 21:26:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.8697788697788698) internal successors, (1522), 815 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states 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 21:26:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1522 transitions. [2024-10-12 21:26:02,773 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1522 transitions. Word has length 19 [2024-10-12 21:26:02,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:02,773 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1522 transitions. [2024-10-12 21:26:02,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 21:26:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1522 transitions. [2024-10-12 21:26:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 21:26:02,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:02,774 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] [2024-10-12 21:26:02,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:26:02,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:02,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1342881082, now seen corresponding path program 1 times [2024-10-12 21:26:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:02,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169897592] [2024-10-12 21:26:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:02,818 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 21:26:02,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:02,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169897592] [2024-10-12 21:26:02,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169897592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:02,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:02,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:26:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026748105] [2024-10-12 21:26:02,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:02,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:02,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:02,821 INFO L87 Difference]: Start difference. First operand 816 states and 1522 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 21:26:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:05,524 INFO L93 Difference]: Finished difference Result 2320 states and 4395 transitions. [2024-10-12 21:26:05,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:05,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-12 21:26:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:05,529 INFO L225 Difference]: With dead ends: 2320 [2024-10-12 21:26:05,529 INFO L226 Difference]: Without dead ends: 1567 [2024-10-12 21:26:05,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 21:26:05,531 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 878 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:05,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 508 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:26:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-10-12 21:26:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2024-10-12 21:26:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1565 states have (on average 1.6287539936102235) internal successors, (2549), 1566 states have internal predecessors, (2549), 0 states have call successors, (0), 0 states 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 21:26:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2549 transitions. [2024-10-12 21:26:05,552 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2549 transitions. Word has length 23 [2024-10-12 21:26:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:05,553 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2549 transitions. [2024-10-12 21:26:05,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 21:26:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2549 transitions. [2024-10-12 21:26:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 21:26:05,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:05,554 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] [2024-10-12 21:26:05,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:26:05,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:05,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:05,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1286109718, now seen corresponding path program 1 times [2024-10-12 21:26:05,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:05,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513672051] [2024-10-12 21:26:05,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:05,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:05,697 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 21:26:05,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:05,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513672051] [2024-10-12 21:26:05,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513672051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:05,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:05,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993577749] [2024-10-12 21:26:05,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:05,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:05,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:05,700 INFO L87 Difference]: Start difference. First operand 1567 states and 2549 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 21:26:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:05,848 INFO L93 Difference]: Finished difference Result 1847 states and 2997 transitions. [2024-10-12 21:26:05,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:26:05,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-10-12 21:26:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:05,854 INFO L225 Difference]: With dead ends: 1847 [2024-10-12 21:26:05,854 INFO L226 Difference]: Without dead ends: 1812 [2024-10-12 21:26:05,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:26:05,855 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 6246 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6246 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:05,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6246 Valid, 2155 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:26:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-10-12 21:26:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1600. [2024-10-12 21:26:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1598 states have (on average 1.62828535669587) internal successors, (2602), 1599 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states 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 21:26:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2602 transitions. [2024-10-12 21:26:05,875 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2602 transitions. Word has length 41 [2024-10-12 21:26:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:05,876 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2602 transitions. [2024-10-12 21:26:05,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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 21:26:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2602 transitions. [2024-10-12 21:26:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 21:26:05,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:05,877 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 21:26:05,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:26:05,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:05,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1122752986, now seen corresponding path program 1 times [2024-10-12 21:26:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:05,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403706479] [2024-10-12 21:26:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:05,926 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 21:26:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:05,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403706479] [2024-10-12 21:26:05,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403706479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:05,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:05,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498972381] [2024-10-12 21:26:05,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:05,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:05,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:05,929 INFO L87 Difference]: Start difference. First operand 1600 states and 2602 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 21:26:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:05,954 INFO L93 Difference]: Finished difference Result 1725 states and 2801 transitions. [2024-10-12 21:26:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:05,955 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 21:26:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:05,959 INFO L225 Difference]: With dead ends: 1725 [2024-10-12 21:26:05,959 INFO L226 Difference]: Without dead ends: 1657 [2024-10-12 21:26:05,959 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 21:26:05,960 INFO L432 NwaCegarLoop]: 1517 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:05,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1567 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-10-12 21:26:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1655. [2024-10-12 21:26:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1653 states have (on average 1.6261343012704175) internal successors, (2688), 1654 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states 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 21:26:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2688 transitions. [2024-10-12 21:26:05,980 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2688 transitions. Word has length 43 [2024-10-12 21:26:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:05,981 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2688 transitions. [2024-10-12 21:26:05,981 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 21:26:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2688 transitions. [2024-10-12 21:26:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 21:26:05,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:05,982 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 21:26:05,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:26:05,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:05,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1120608034, now seen corresponding path program 1 times [2024-10-12 21:26:05,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:05,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964235722] [2024-10-12 21:26:05,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:05,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:06,214 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 21:26:06,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:06,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964235722] [2024-10-12 21:26:06,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964235722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:06,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:06,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:06,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790577742] [2024-10-12 21:26:06,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:06,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:06,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:06,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:06,216 INFO L87 Difference]: Start difference. First operand 1655 states and 2688 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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 21:26:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:06,299 INFO L93 Difference]: Finished difference Result 1780 states and 2884 transitions. [2024-10-12 21:26:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:06,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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 21:26:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:06,303 INFO L225 Difference]: With dead ends: 1780 [2024-10-12 21:26:06,303 INFO L226 Difference]: Without dead ends: 1657 [2024-10-12 21:26:06,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:26:06,305 INFO L432 NwaCegarLoop]: 1513 mSDtfsCounter, 2964 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:06,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 1669 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-10-12 21:26:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1655. [2024-10-12 21:26:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1653 states have (on average 1.6249243799153055) internal successors, (2686), 1654 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states 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 21:26:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2686 transitions. [2024-10-12 21:26:06,325 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2686 transitions. Word has length 43 [2024-10-12 21:26:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:06,325 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2686 transitions. [2024-10-12 21:26:06,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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 21:26:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2686 transitions. [2024-10-12 21:26:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 21:26:06,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:06,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:06,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:26:06,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:06,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash -507494279, now seen corresponding path program 1 times [2024-10-12 21:26:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:06,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802978447] [2024-10-12 21:26:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:06,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:06,467 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 21:26:06,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:06,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802978447] [2024-10-12 21:26:06,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802978447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:06,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:06,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:26:06,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352548105] [2024-10-12 21:26:06,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:06,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:26:06,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:06,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:26:06,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:26:06,470 INFO L87 Difference]: Start difference. First operand 1655 states and 2686 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 21:26:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:06,506 INFO L93 Difference]: Finished difference Result 1661 states and 2693 transitions. [2024-10-12 21:26:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:26:06,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-12 21:26:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:06,511 INFO L225 Difference]: With dead ends: 1661 [2024-10-12 21:26:06,511 INFO L226 Difference]: Without dead ends: 1659 [2024-10-12 21:26:06,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:26:06,512 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 0 mSDsluCounter, 3028 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:06,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4546 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-10-12 21:26:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1659. [2024-10-12 21:26:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1657 states have (on average 1.6228123114061557) internal successors, (2689), 1658 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states 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 21:26:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2689 transitions. [2024-10-12 21:26:06,542 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2689 transitions. Word has length 44 [2024-10-12 21:26:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:06,544 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2689 transitions. [2024-10-12 21:26:06,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 21:26:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2689 transitions. [2024-10-12 21:26:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:26:06,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:06,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:06,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:26:06,546 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:06,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:06,546 INFO L85 PathProgramCache]: Analyzing trace with hash 106173278, now seen corresponding path program 1 times [2024-10-12 21:26:06,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:06,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620043521] [2024-10-12 21:26:06,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:06,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:06,611 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 21:26:06,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:06,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620043521] [2024-10-12 21:26:06,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620043521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:06,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:06,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029390494] [2024-10-12 21:26:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:06,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:06,612 INFO L87 Difference]: Start difference. First operand 1659 states and 2689 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 21:26:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:06,642 INFO L93 Difference]: Finished difference Result 1797 states and 2902 transitions. [2024-10-12 21:26:06,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:06,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-12 21:26:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:06,648 INFO L225 Difference]: With dead ends: 1797 [2024-10-12 21:26:06,648 INFO L226 Difference]: Without dead ends: 1725 [2024-10-12 21:26:06,649 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 21:26:06,650 INFO L432 NwaCegarLoop]: 1559 mSDtfsCounter, 1484 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1615 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 21:26:06,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1615 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2024-10-12 21:26:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1723. [2024-10-12 21:26:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1721 states have (on average 1.6188262638001163) internal successors, (2786), 1722 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states 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 21:26:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2786 transitions. [2024-10-12 21:26:06,684 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2786 transitions. Word has length 45 [2024-10-12 21:26:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:06,685 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2786 transitions. [2024-10-12 21:26:06,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 21:26:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2786 transitions. [2024-10-12 21:26:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:26:06,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:06,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:06,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:26:06,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:06,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash -479538850, now seen corresponding path program 1 times [2024-10-12 21:26:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:06,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602917424] [2024-10-12 21:26:06,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:06,730 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 21:26:06,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:06,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602917424] [2024-10-12 21:26:06,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602917424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:06,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:06,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:06,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868268535] [2024-10-12 21:26:06,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:06,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:06,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:06,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:06,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:06,734 INFO L87 Difference]: Start difference. First operand 1723 states and 2786 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 21:26:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:06,766 INFO L93 Difference]: Finished difference Result 2077 states and 3326 transitions. [2024-10-12 21:26:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:06,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-12 21:26:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:06,775 INFO L225 Difference]: With dead ends: 2077 [2024-10-12 21:26:06,775 INFO L226 Difference]: Without dead ends: 1888 [2024-10-12 21:26:06,776 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 21:26:06,779 INFO L432 NwaCegarLoop]: 1551 mSDtfsCounter, 1480 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1615 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 21:26:06,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1615 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2024-10-12 21:26:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1886. [2024-10-12 21:26:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1884 states have (on average 1.6072186836518048) internal successors, (3028), 1885 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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 21:26:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3028 transitions. [2024-10-12 21:26:06,815 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3028 transitions. Word has length 45 [2024-10-12 21:26:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:06,815 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 3028 transitions. [2024-10-12 21:26:06,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 21:26:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3028 transitions. [2024-10-12 21:26:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:26:06,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:06,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:06,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:26:06,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:06,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash 409194590, now seen corresponding path program 1 times [2024-10-12 21:26:06,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:06,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887386102] [2024-10-12 21:26:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:06,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:06,868 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 21:26:06,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887386102] [2024-10-12 21:26:06,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887386102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:06,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:06,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:06,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268812907] [2024-10-12 21:26:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:06,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:06,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:06,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:06,874 INFO L87 Difference]: Start difference. First operand 1886 states and 3028 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 21:26:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:06,908 INFO L93 Difference]: Finished difference Result 2542 states and 4010 transitions. [2024-10-12 21:26:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:06,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-12 21:26:06,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:06,914 INFO L225 Difference]: With dead ends: 2542 [2024-10-12 21:26:06,914 INFO L226 Difference]: Without dead ends: 2190 [2024-10-12 21:26:06,915 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 21:26:06,916 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 1478 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1617 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 21:26:06,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1617 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2024-10-12 21:26:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2188. [2024-10-12 21:26:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 2186 states have (on average 1.584629460201281) internal successors, (3464), 2187 states have internal predecessors, (3464), 0 states have call successors, (0), 0 states 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 21:26:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3464 transitions. [2024-10-12 21:26:06,958 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 3464 transitions. Word has length 45 [2024-10-12 21:26:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:06,959 INFO L471 AbstractCegarLoop]: Abstraction has 2188 states and 3464 transitions. [2024-10-12 21:26:06,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 21:26:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 3464 transitions. [2024-10-12 21:26:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 21:26:06,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:06,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:06,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:26:06,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:06,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash 146117214, now seen corresponding path program 1 times [2024-10-12 21:26:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:06,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758204641] [2024-10-12 21:26:06,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:06,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:07,008 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 21:26:07,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:07,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758204641] [2024-10-12 21:26:07,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758204641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:07,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:07,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859154214] [2024-10-12 21:26:07,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:07,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:07,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:07,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:07,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:07,011 INFO L87 Difference]: Start difference. First operand 2188 states and 3464 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 21:26:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:07,054 INFO L93 Difference]: Finished difference Result 3400 states and 5234 transitions. [2024-10-12 21:26:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:07,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-12 21:26:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:07,062 INFO L225 Difference]: With dead ends: 3400 [2024-10-12 21:26:07,062 INFO L226 Difference]: Without dead ends: 2746 [2024-10-12 21:26:07,063 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 21:26:07,064 INFO L432 NwaCegarLoop]: 1561 mSDtfsCounter, 1482 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1621 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 21:26:07,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1621 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2024-10-12 21:26:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2744. [2024-10-12 21:26:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2744 states, 2742 states have (on average 1.5463165572574762) internal successors, (4240), 2743 states have internal predecessors, (4240), 0 states have call successors, (0), 0 states 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 21:26:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 4240 transitions. [2024-10-12 21:26:07,113 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 4240 transitions. Word has length 45 [2024-10-12 21:26:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:07,113 INFO L471 AbstractCegarLoop]: Abstraction has 2744 states and 4240 transitions. [2024-10-12 21:26:07,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 21:26:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 4240 transitions. [2024-10-12 21:26:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:26:07,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:07,114 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] [2024-10-12 21:26:07,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:26:07,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:07,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:07,115 INFO L85 PathProgramCache]: Analyzing trace with hash -879880138, now seen corresponding path program 1 times [2024-10-12 21:26:07,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:07,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444727602] [2024-10-12 21:26:07,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:07,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:26:07,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:07,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444727602] [2024-10-12 21:26:07,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444727602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:07,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:07,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:07,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376343088] [2024-10-12 21:26:07,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:07,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:07,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:07,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:07,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:07,221 INFO L87 Difference]: Start difference. First operand 2744 states and 4240 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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 21:26:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:07,375 INFO L93 Difference]: Finished difference Result 7506 states and 11101 transitions. [2024-10-12 21:26:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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 21:26:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:07,399 INFO L225 Difference]: With dead ends: 7506 [2024-10-12 21:26:07,399 INFO L226 Difference]: Without dead ends: 6640 [2024-10-12 21:26:07,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:26:07,406 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 4635 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:07,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 3299 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:26:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2024-10-12 21:26:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 3784. [2024-10-12 21:26:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3784 states, 3782 states have (on average 1.5124272871496562) internal successors, (5720), 3783 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states 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 21:26:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5720 transitions. [2024-10-12 21:26:07,490 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5720 transitions. Word has length 61 [2024-10-12 21:26:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:07,490 INFO L471 AbstractCegarLoop]: Abstraction has 3784 states and 5720 transitions. [2024-10-12 21:26:07,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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 21:26:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5720 transitions. [2024-10-12 21:26:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:26:07,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:07,491 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] [2024-10-12 21:26:07,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:26:07,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:07,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1465592266, now seen corresponding path program 1 times [2024-10-12 21:26:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:07,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370142210] [2024-10-12 21:26:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 21:26:07,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:07,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370142210] [2024-10-12 21:26:07,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370142210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:07,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:07,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013708229] [2024-10-12 21:26:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:07,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:07,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:07,628 INFO L87 Difference]: Start difference. First operand 3784 states and 5720 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:26:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:07,775 INFO L93 Difference]: Finished difference Result 8714 states and 12829 transitions. [2024-10-12 21:26:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:07,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-12 21:26:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:07,791 INFO L225 Difference]: With dead ends: 8714 [2024-10-12 21:26:07,791 INFO L226 Difference]: Without dead ends: 7504 [2024-10-12 21:26:07,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:26:07,795 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 4670 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4670 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:07,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4670 Valid, 3317 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:26:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2024-10-12 21:26:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 5424. [2024-10-12 21:26:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5424 states, 5422 states have (on average 1.484323127997049) internal successors, (8048), 5423 states have internal predecessors, (8048), 0 states have call successors, (0), 0 states 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 21:26:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5424 states to 5424 states and 8048 transitions. [2024-10-12 21:26:07,917 INFO L78 Accepts]: Start accepts. Automaton has 5424 states and 8048 transitions. Word has length 61 [2024-10-12 21:26:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:07,917 INFO L471 AbstractCegarLoop]: Abstraction has 5424 states and 8048 transitions. [2024-10-12 21:26:07,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:26:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5424 states and 8048 transitions. [2024-10-12 21:26:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:26:07,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:07,919 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] [2024-10-12 21:26:07,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:26:07,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:07,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash -576858826, now seen corresponding path program 1 times [2024-10-12 21:26:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:07,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60191941] [2024-10-12 21:26:07,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 21:26:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:08,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60191941] [2024-10-12 21:26:08,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60191941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:08,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:08,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:08,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582994464] [2024-10-12 21:26:08,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:08,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:08,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:08,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:08,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:08,014 INFO L87 Difference]: Start difference. First operand 5424 states and 8048 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 21:26:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:08,175 INFO L93 Difference]: Finished difference Result 9922 states and 14549 transitions. [2024-10-12 21:26:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 21:26:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:08,186 INFO L225 Difference]: With dead ends: 9922 [2024-10-12 21:26:08,186 INFO L226 Difference]: Without dead ends: 8712 [2024-10-12 21:26:08,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:26:08,189 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 4667 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:08,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3318 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:26:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8712 states. [2024-10-12 21:26:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8712 to 6632. [2024-10-12 21:26:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6632 states, 6630 states have (on average 1.4733031674208146) internal successors, (9768), 6631 states have internal predecessors, (9768), 0 states have call successors, (0), 0 states 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 21:26:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 9768 transitions. [2024-10-12 21:26:08,308 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 9768 transitions. Word has length 61 [2024-10-12 21:26:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:08,308 INFO L471 AbstractCegarLoop]: Abstraction has 6632 states and 9768 transitions. [2024-10-12 21:26:08,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 21:26:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 9768 transitions. [2024-10-12 21:26:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:26:08,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:08,309 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] [2024-10-12 21:26:08,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:26:08,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:08,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:08,310 INFO L85 PathProgramCache]: Analyzing trace with hash -839936202, now seen corresponding path program 1 times [2024-10-12 21:26:08,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:08,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563309615] [2024-10-12 21:26:08,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:08,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:26:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563309615] [2024-10-12 21:26:08,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563309615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:08,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:08,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:26:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571498207] [2024-10-12 21:26:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:08,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:26:08,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:26:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:26:08,439 INFO L87 Difference]: Start difference. First operand 6632 states and 9768 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 21:26:08,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:08,624 INFO L93 Difference]: Finished difference Result 11130 states and 16269 transitions. [2024-10-12 21:26:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:08,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 21:26:08,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:08,637 INFO L225 Difference]: With dead ends: 11130 [2024-10-12 21:26:08,637 INFO L226 Difference]: Without dead ends: 9920 [2024-10-12 21:26:08,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:26:08,641 INFO L432 NwaCegarLoop]: 1565 mSDtfsCounter, 4639 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4639 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:08,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4639 Valid, 3339 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:26:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9920 states. [2024-10-12 21:26:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9920 to 7840. [2024-10-12 21:26:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7840 states, 7838 states have (on average 1.4656800204133709) internal successors, (11488), 7839 states have internal predecessors, (11488), 0 states have call successors, (0), 0 states 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 21:26:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7840 states to 7840 states and 11488 transitions. [2024-10-12 21:26:08,782 INFO L78 Accepts]: Start accepts. Automaton has 7840 states and 11488 transitions. Word has length 61 [2024-10-12 21:26:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:08,782 INFO L471 AbstractCegarLoop]: Abstraction has 7840 states and 11488 transitions. [2024-10-12 21:26:08,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 21:26:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 7840 states and 11488 transitions. [2024-10-12 21:26:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 21:26:08,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:08,786 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:08,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:26:08,786 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:08,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash -593577456, now seen corresponding path program 1 times [2024-10-12 21:26:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:08,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297484743] [2024-10-12 21:26:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:08,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297484743] [2024-10-12 21:26:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297484743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:08,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:08,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362021639] [2024-10-12 21:26:08,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:08,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:08,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:08,866 INFO L87 Difference]: Start difference. First operand 7840 states and 11488 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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 21:26:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:08,959 INFO L93 Difference]: Finished difference Result 14148 states and 20482 transitions. [2024-10-12 21:26:08,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:08,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 21:26:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:08,970 INFO L225 Difference]: With dead ends: 14148 [2024-10-12 21:26:08,970 INFO L226 Difference]: Without dead ends: 7842 [2024-10-12 21:26:08,977 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 21:26:08,977 INFO L432 NwaCegarLoop]: 1545 mSDtfsCounter, 37 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:08,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3053 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7842 states. [2024-10-12 21:26:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7842 to 7840. [2024-10-12 21:26:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7840 states, 7838 states have (on average 1.44985965807604) internal successors, (11364), 7839 states have internal predecessors, (11364), 0 states have call successors, (0), 0 states 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 21:26:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7840 states to 7840 states and 11364 transitions. [2024-10-12 21:26:09,103 INFO L78 Accepts]: Start accepts. Automaton has 7840 states and 11364 transitions. Word has length 62 [2024-10-12 21:26:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:09,103 INFO L471 AbstractCegarLoop]: Abstraction has 7840 states and 11364 transitions. [2024-10-12 21:26:09,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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 21:26:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7840 states and 11364 transitions. [2024-10-12 21:26:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 21:26:09,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:09,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:09,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:26:09,105 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:09,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash 153695742, now seen corresponding path program 1 times [2024-10-12 21:26:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:09,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29257290] [2024-10-12 21:26:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:09,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:09,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29257290] [2024-10-12 21:26:09,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29257290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:09,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:09,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912710462] [2024-10-12 21:26:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:09,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:09,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:09,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:09,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:09,230 INFO L87 Difference]: Start difference. First operand 7840 states and 11364 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:26:09,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:09,280 INFO L93 Difference]: Finished difference Result 10236 states and 14771 transitions. [2024-10-12 21:26:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:09,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-12 21:26:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:09,285 INFO L225 Difference]: With dead ends: 10236 [2024-10-12 21:26:09,285 INFO L226 Difference]: Without dead ends: 3930 [2024-10-12 21:26:09,290 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 21:26:09,290 INFO L432 NwaCegarLoop]: 1543 mSDtfsCounter, 31 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:09,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3050 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:09,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2024-10-12 21:26:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3923. [2024-10-12 21:26:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3921 states have (on average 1.4922213720989543) internal successors, (5851), 3922 states have internal predecessors, (5851), 0 states have call successors, (0), 0 states 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 21:26:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 5851 transitions. [2024-10-12 21:26:09,340 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 5851 transitions. Word has length 63 [2024-10-12 21:26:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:09,340 INFO L471 AbstractCegarLoop]: Abstraction has 3923 states and 5851 transitions. [2024-10-12 21:26:09,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:26:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 5851 transitions. [2024-10-12 21:26:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 21:26:09,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:09,341 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] [2024-10-12 21:26:09,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:26:09,341 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:09,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:09,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1807172254, now seen corresponding path program 1 times [2024-10-12 21:26:09,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:09,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708048991] [2024-10-12 21:26:09,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:09,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:09,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:09,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708048991] [2024-10-12 21:26:09,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708048991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:09,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:09,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508023594] [2024-10-12 21:26:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:09,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:09,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:09,409 INFO L87 Difference]: Start difference. First operand 3923 states and 5851 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 21:26:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:09,442 INFO L93 Difference]: Finished difference Result 5115 states and 7525 transitions. [2024-10-12 21:26:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:09,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-12 21:26:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:09,446 INFO L225 Difference]: With dead ends: 5115 [2024-10-12 21:26:09,447 INFO L226 Difference]: Without dead ends: 2737 [2024-10-12 21:26:09,448 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 21:26:09,449 INFO L432 NwaCegarLoop]: 1537 mSDtfsCounter, 33 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3029 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:09,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3029 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2024-10-12 21:26:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2735. [2024-10-12 21:26:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2733 states have (on average 1.5210391511159898) internal successors, (4157), 2734 states have internal predecessors, (4157), 0 states have call successors, (0), 0 states 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 21:26:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 4157 transitions. [2024-10-12 21:26:09,482 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 4157 transitions. Word has length 64 [2024-10-12 21:26:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:09,482 INFO L471 AbstractCegarLoop]: Abstraction has 2735 states and 4157 transitions. [2024-10-12 21:26:09,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 21:26:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 4157 transitions. [2024-10-12 21:26:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:26:09,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:09,483 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:09,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:26:09,483 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:09,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1518156628, now seen corresponding path program 1 times [2024-10-12 21:26:09,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:09,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803021966] [2024-10-12 21:26:09,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:09,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:09,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:09,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803021966] [2024-10-12 21:26:09,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803021966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:26:09,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:26:09,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:26:09,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615917810] [2024-10-12 21:26:09,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:26:09,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:26:09,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:09,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:26:09,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:26:09,545 INFO L87 Difference]: Start difference. First operand 2735 states and 4157 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 21:26:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:09,569 INFO L93 Difference]: Finished difference Result 3333 states and 4984 transitions. [2024-10-12 21:26:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:26:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 21:26:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:09,572 INFO L225 Difference]: With dead ends: 3333 [2024-10-12 21:26:09,572 INFO L226 Difference]: Without dead ends: 2143 [2024-10-12 21:26:09,573 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 21:26:09,574 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 30 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:09,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3014 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2024-10-12 21:26:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2141. [2024-10-12 21:26:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 2139 states have (on average 1.5525946704067322) internal successors, (3321), 2140 states have internal predecessors, (3321), 0 states have call successors, (0), 0 states 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 21:26:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 3321 transitions. [2024-10-12 21:26:09,594 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 3321 transitions. Word has length 66 [2024-10-12 21:26:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:09,594 INFO L471 AbstractCegarLoop]: Abstraction has 2141 states and 3321 transitions. [2024-10-12 21:26:09,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 21:26:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 3321 transitions. [2024-10-12 21:26:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 21:26:09,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:09,595 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] [2024-10-12 21:26:09,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:26:09,596 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:09,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:09,596 INFO L85 PathProgramCache]: Analyzing trace with hash 312352826, now seen corresponding path program 1 times [2024-10-12 21:26:09,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:09,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564030247] [2024-10-12 21:26:09,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:26:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564030247] [2024-10-12 21:26:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564030247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294932769] [2024-10-12 21:26:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:09,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:09,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:09,716 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 21:26:09,728 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 21:26:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:09,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 21:26:09,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:26:09,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:26:10,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294932769] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:10,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:10,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2024-10-12 21:26:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229675092] [2024-10-12 21:26:10,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:10,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:26:10,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:26:10,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:26:10,186 INFO L87 Difference]: Start difference. First operand 2141 states and 3321 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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 21:26:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:10,265 INFO L93 Difference]: Finished difference Result 3569 states and 5231 transitions. [2024-10-12 21:26:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:26:10,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 0 states have call successors, (0), 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 21:26:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:10,271 INFO L225 Difference]: With dead ends: 3569 [2024-10-12 21:26:10,271 INFO L226 Difference]: Without dead ends: 2973 [2024-10-12 21:26:10,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:26:10,273 INFO L432 NwaCegarLoop]: 1516 mSDtfsCounter, 4419 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4419 SdHoareTripleChecker+Valid, 3186 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:10,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4419 Valid, 3186 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:26:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2024-10-12 21:26:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2916. [2024-10-12 21:26:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2914 states have (on average 1.473232669869595) internal successors, (4293), 2915 states have internal predecessors, (4293), 0 states have call successors, (0), 0 states 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 21:26:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4293 transitions. [2024-10-12 21:26:10,391 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4293 transitions. Word has length 68 [2024-10-12 21:26:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:10,391 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 4293 transitions. [2024-10-12 21:26:10,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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 21:26:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4293 transitions. [2024-10-12 21:26:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 21:26:10,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:10,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:10,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:26:10,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:10,598 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:10,598 INFO L85 PathProgramCache]: Analyzing trace with hash 424413204, now seen corresponding path program 1 times [2024-10-12 21:26:10,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:10,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578787511] [2024-10-12 21:26:10,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578787511] [2024-10-12 21:26:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578787511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924087798] [2024-10-12 21:26:12,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:12,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:12,084 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 21:26:12,087 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 21:26:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:12,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 21:26:12,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:12,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924087798] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:13,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2024-10-12 21:26:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668353624] [2024-10-12 21:26:13,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-12 21:26:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 21:26:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2024-10-12 21:26:13,557 INFO L87 Difference]: Start difference. First operand 2916 states and 4293 transitions. Second operand has 32 states, 32 states have (on average 5.5625) internal successors, (178), 32 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 21:26:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:14,325 INFO L93 Difference]: Finished difference Result 5556 states and 7747 transitions. [2024-10-12 21:26:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 21:26:14,326 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.5625) internal successors, (178), 32 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 69 [2024-10-12 21:26:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:14,330 INFO L225 Difference]: With dead ends: 5556 [2024-10-12 21:26:14,331 INFO L226 Difference]: Without dead ends: 4312 [2024-10-12 21:26:14,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=473, Invalid=1783, Unknown=0, NotChecked=0, Total=2256 [2024-10-12 21:26:14,333 INFO L432 NwaCegarLoop]: 1496 mSDtfsCounter, 12419 mSDsluCounter, 4896 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12419 SdHoareTripleChecker+Valid, 6392 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:14,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12419 Valid, 6392 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:26:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2024-10-12 21:26:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 4266. [2024-10-12 21:26:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4266 states, 4264 states have (on average 1.4064258911819887) internal successors, (5997), 4265 states have internal predecessors, (5997), 0 states have call successors, (0), 0 states 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 21:26:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4266 states to 4266 states and 5997 transitions. [2024-10-12 21:26:14,392 INFO L78 Accepts]: Start accepts. Automaton has 4266 states and 5997 transitions. Word has length 69 [2024-10-12 21:26:14,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:14,392 INFO L471 AbstractCegarLoop]: Abstraction has 4266 states and 5997 transitions. [2024-10-12 21:26:14,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.5625) internal successors, (178), 32 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 21:26:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4266 states and 5997 transitions. [2024-10-12 21:26:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 21:26:14,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:14,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:14,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:26:14,593 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,SelfDestructingSolverStorable20 [2024-10-12 21:26:14,594 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:14,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1130703970, now seen corresponding path program 1 times [2024-10-12 21:26:14,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:14,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34222551] [2024-10-12 21:26:14,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:14,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:15,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:15,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34222551] [2024-10-12 21:26:15,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34222551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:15,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494529489] [2024-10-12 21:26:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:15,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:15,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:15,555 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 21:26:15,556 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 21:26:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:15,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 21:26:15,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:15,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:16,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494529489] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:16,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:16,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-10-12 21:26:16,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412604682] [2024-10-12 21:26:16,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:16,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 21:26:16,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 21:26:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-10-12 21:26:16,657 INFO L87 Difference]: Start difference. First operand 4266 states and 5997 transitions. Second operand has 29 states, 29 states have (on average 6.172413793103448) internal successors, (179), 28 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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 21:26:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:17,662 INFO L93 Difference]: Finished difference Result 14805 states and 19528 transitions. [2024-10-12 21:26:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-12 21:26:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.172413793103448) internal successors, (179), 28 states have internal predecessors, (179), 0 states have call successors, (0), 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 21:26:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:17,674 INFO L225 Difference]: With dead ends: 14805 [2024-10-12 21:26:17,674 INFO L226 Difference]: Without dead ends: 12240 [2024-10-12 21:26:17,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=615, Invalid=2465, Unknown=0, NotChecked=0, Total=3080 [2024-10-12 21:26:17,679 INFO L432 NwaCegarLoop]: 1494 mSDtfsCounter, 11246 mSDsluCounter, 6430 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11246 SdHoareTripleChecker+Valid, 7924 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:17,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11246 Valid, 7924 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:26:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12240 states. [2024-10-12 21:26:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12240 to 12228. [2024-10-12 21:26:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12228 states, 12226 states have (on average 1.314166530345166) internal successors, (16067), 12227 states have internal predecessors, (16067), 0 states have call successors, (0), 0 states 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 21:26:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12228 states to 12228 states and 16067 transitions. [2024-10-12 21:26:17,992 INFO L78 Accepts]: Start accepts. Automaton has 12228 states and 16067 transitions. Word has length 69 [2024-10-12 21:26:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:17,992 INFO L471 AbstractCegarLoop]: Abstraction has 12228 states and 16067 transitions. [2024-10-12 21:26:17,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.172413793103448) internal successors, (179), 28 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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 21:26:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12228 states and 16067 transitions. [2024-10-12 21:26:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 21:26:17,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:17,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:18,006 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 21:26:18,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:18,197 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:18,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash 103866210, now seen corresponding path program 1 times [2024-10-12 21:26:18,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:18,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388135677] [2024-10-12 21:26:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:19,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:19,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388135677] [2024-10-12 21:26:19,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388135677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339105223] [2024-10-12 21:26:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:19,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:19,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:19,089 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 21:26:19,090 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 21:26:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:19,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 21:26:19,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:19,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339105223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:19,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2024-10-12 21:26:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952339571] [2024-10-12 21:26:19,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:19,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 21:26:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 21:26:19,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2024-10-12 21:26:19,957 INFO L87 Difference]: Start difference. First operand 12228 states and 16067 transitions. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 27 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) [2024-10-12 21:26:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:21,355 INFO L93 Difference]: Finished difference Result 33653 states and 43517 transitions. [2024-10-12 21:26:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-12 21:26:21,356 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 27 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) Word has length 69 [2024-10-12 21:26:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:21,381 INFO L225 Difference]: With dead ends: 33653 [2024-10-12 21:26:21,381 INFO L226 Difference]: Without dead ends: 24498 [2024-10-12 21:26:21,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=714, Invalid=2708, Unknown=0, NotChecked=0, Total=3422 [2024-10-12 21:26:21,409 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 14135 mSDsluCounter, 6436 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14135 SdHoareTripleChecker+Valid, 7951 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:21,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14135 Valid, 7951 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:26:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24498 states. [2024-10-12 21:26:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24498 to 23298. [2024-10-12 21:26:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23298 states, 23296 states have (on average 1.2772149725274726) internal successors, (29754), 23297 states have internal predecessors, (29754), 0 states have call successors, (0), 0 states 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 21:26:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23298 states to 23298 states and 29754 transitions. [2024-10-12 21:26:21,952 INFO L78 Accepts]: Start accepts. Automaton has 23298 states and 29754 transitions. Word has length 69 [2024-10-12 21:26:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:26:21,952 INFO L471 AbstractCegarLoop]: Abstraction has 23298 states and 29754 transitions. [2024-10-12 21:26:21,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 27 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) [2024-10-12 21:26:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 23298 states and 29754 transitions. [2024-10-12 21:26:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 21:26:21,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:26:21,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:26:21,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 21:26:22,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:22,155 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:26:22,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:26:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1994982376, now seen corresponding path program 1 times [2024-10-12 21:26:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:26:22,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687726420] [2024-10-12 21:26:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:26:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:22,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:26:22,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687726420] [2024-10-12 21:26:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687726420] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:26:22,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558919546] [2024-10-12 21:26:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:26:22,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:26:22,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:26:22,516 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 21:26:22,517 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 21:26:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:26:22,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-12 21:26:22,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:26:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:24,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:26:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:26:27,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558919546] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:26:27,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:26:27,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 21] total 49 [2024-10-12 21:26:27,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501646294] [2024-10-12 21:26:27,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:26:27,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-12 21:26:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:26:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-12 21:26:27,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2035, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 21:26:27,063 INFO L87 Difference]: Start difference. First operand 23298 states and 29754 transitions. Second operand has 49 states, 49 states have (on average 4.040816326530612) internal successors, (198), 49 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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 21:26:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:26:59,476 INFO L93 Difference]: Finished difference Result 70521 states and 90956 transitions. [2024-10-12 21:26:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-10-12 21:26:59,476 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.040816326530612) internal successors, (198), 49 states have internal predecessors, (198), 0 states have call successors, (0), 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 70 [2024-10-12 21:26:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:26:59,531 INFO L225 Difference]: With dead ends: 70521 [2024-10-12 21:26:59,531 INFO L226 Difference]: Without dead ends: 51925 [2024-10-12 21:26:59,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16715 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=8336, Invalid=34306, Unknown=0, NotChecked=0, Total=42642 [2024-10-12 21:26:59,557 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 28407 mSDsluCounter, 17819 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28407 SdHoareTripleChecker+Valid, 19374 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:26:59,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28407 Valid, 19374 Invalid, 2730 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [139 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:26:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51925 states. [2024-10-12 21:27:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51925 to 21128. [2024-10-12 21:27:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21128 states, 21126 states have (on average 1.2656915648963363) internal successors, (26739), 21127 states have internal predecessors, (26739), 0 states have call successors, (0), 0 states 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 21:27:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21128 states to 21128 states and 26739 transitions. [2024-10-12 21:27:00,404 INFO L78 Accepts]: Start accepts. Automaton has 21128 states and 26739 transitions. Word has length 70 [2024-10-12 21:27:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:27:00,405 INFO L471 AbstractCegarLoop]: Abstraction has 21128 states and 26739 transitions. [2024-10-12 21:27:00,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.040816326530612) internal successors, (198), 49 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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 21:27:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 21128 states and 26739 transitions. [2024-10-12 21:27:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 21:27:00,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:27:00,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:27:00,422 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 21:27:00,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-12 21:27:00,611 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:27:00,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:27:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2129294422, now seen corresponding path program 1 times [2024-10-12 21:27:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:27:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423094137] [2024-10-12 21:27:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:27:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:27:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:27:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:27:02,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:27:02,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423094137] [2024-10-12 21:27:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423094137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:27:02,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012724541] [2024-10-12 21:27:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:27:02,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:27:02,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:27:02,664 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 21:27:02,666 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 21:27:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:27:02,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 21:27:02,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:27:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:27:04,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:27:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:27:06,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012724541] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:27:06,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:27:06,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 17] total 58 [2024-10-12 21:27:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851128111] [2024-10-12 21:27:06,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:27:06,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-10-12 21:27:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:27:06,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-10-12 21:27:06,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3072, Unknown=0, NotChecked=0, Total=3306 [2024-10-12 21:27:06,186 INFO L87 Difference]: Start difference. First operand 21128 states and 26739 transitions. Second operand has 58 states, 58 states have (on average 3.2586206896551726) internal successors, (189), 58 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)