./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.5.ufo.UNBOUNDED.pals+Problem12_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label08.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 2c4913bb4ed3bafd270c91bb47247b29a03ea021b2ff38c2735de1cba1400212 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:58:56,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:58:56,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:58:56,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:58:56,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:58:56,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:58:56,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:58:56,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:58:56,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:58:56,843 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:58:56,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:58:56,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:58:56,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:58:56,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:58:56,844 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:58:56,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:58:56,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:58:56,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:58:56,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:58:56,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:58:56,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:58:56,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:58:56,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:58:56,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:58:56,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:58:56,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:58:56,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:58:56,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:58:56,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:58:56,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:58:56,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:58:56,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:58:56,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:58:56,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:58:56,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:58:56,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:58:56,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:58:56,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:58:56,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:58:56,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:58:56,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:58:56,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:58:56,854 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 -> 2c4913bb4ed3bafd270c91bb47247b29a03ea021b2ff38c2735de1cba1400212 [2024-10-14 04:58:57,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:58:57,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:58:57,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:58:57,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:58:57,144 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:58:57,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-14 04:58:58,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:58:59,011 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:58:59,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-14 04:58:59,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82679cb2/0d2bc69032d64fd98bee3e7a47636561/FLAG3918b0248 [2024-10-14 04:58:59,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82679cb2/0d2bc69032d64fd98bee3e7a47636561 [2024-10-14 04:58:59,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:58:59,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:58:59,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:58:59,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:58:59,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:58:59,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:58:59" (1/1) ... [2024-10-14 04:58:59,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfca1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:58:59, skipping insertion in model container [2024-10-14 04:58:59,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:58:59" (1/1) ... [2024-10-14 04:58:59,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:58:59,612 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.5.ufo.UNBOUNDED.pals+Problem12_label08.c[11668,11681] [2024-10-14 04:58:59,666 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.5.ufo.UNBOUNDED.pals+Problem12_label08.c[15175,15188] [2024-10-14 04:59:00,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:59:00,364 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:59:00,398 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.5.ufo.UNBOUNDED.pals+Problem12_label08.c[11668,11681] [2024-10-14 04:59:00,407 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.5.ufo.UNBOUNDED.pals+Problem12_label08.c[15175,15188] [2024-10-14 04:59:00,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:59:00,789 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:59:00,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00 WrapperNode [2024-10-14 04:59:00,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:59:00,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:59:00,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:59:00,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:59:00,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:00,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,197 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5097 [2024-10-14 04:59:01,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:59:01,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:59:01,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:59:01,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:59:01,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,472 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 04:59:01,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:59:01,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:59:01,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:59:01,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:59:01,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (1/1) ... [2024-10-14 04:59:01,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:59:01,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:59:01,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:59:01,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:59:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:59:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:59:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:59:01,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:59:02,024 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:59:02,025 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:59:06,146 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2024-10-14 04:59:06,146 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:59:06,227 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:59:06,227 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 04:59:06,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:59:06 BoogieIcfgContainer [2024-10-14 04:59:06,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:59:06,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:59:06,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:59:06,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:59:06,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:58:59" (1/3) ... [2024-10-14 04:59:06,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242431ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:59:06, skipping insertion in model container [2024-10-14 04:59:06,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:59:00" (2/3) ... [2024-10-14 04:59:06,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242431ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:59:06, skipping insertion in model container [2024-10-14 04:59:06,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:59:06" (3/3) ... [2024-10-14 04:59:06,240 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-14 04:59:06,265 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:59:06,265 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:59:06,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:59:06,373 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;@368e839a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:59:06,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:59:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 836 states, 833 states have (on average 1.9747899159663866) internal successors, (1645), 835 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 04:59:06,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:06,390 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] [2024-10-14 04:59:06,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:06,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1602770487, now seen corresponding path program 1 times [2024-10-14 04:59:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030065058] [2024-10-14 04:59:06,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:06,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:06,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030065058] [2024-10-14 04:59:06,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030065058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:06,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:06,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 04:59:06,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250941965] [2024-10-14 04:59:06,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:06,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 04:59:06,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:06,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 04:59:06,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 04:59:06,709 INFO L87 Difference]: Start difference. First operand has 836 states, 833 states have (on average 1.9747899159663866) internal successors, (1645), 835 states have internal predecessors, (1645), 0 states have call successors, (0), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:06,813 INFO L93 Difference]: Finished difference Result 1636 states and 3221 transitions. [2024-10-14 04:59:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 04:59:06,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-14 04:59:06,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:06,834 INFO L225 Difference]: With dead ends: 1636 [2024-10-14 04:59:06,835 INFO L226 Difference]: Without dead ends: 832 [2024-10-14 04:59:06,840 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-14 04:59:06,843 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:06,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1573 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:06,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-14 04:59:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2024-10-14 04:59:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8963855421686746) internal successors, (1574), 831 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1574 transitions. [2024-10-14 04:59:06,934 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1574 transitions. Word has length 21 [2024-10-14 04:59:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:06,934 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1574 transitions. [2024-10-14 04:59:06,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1574 transitions. [2024-10-14 04:59:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 04:59:06,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:06,936 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] [2024-10-14 04:59:06,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:59:06,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1103848907, now seen corresponding path program 1 times [2024-10-14 04:59:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:06,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759495080] [2024-10-14 04:59:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:07,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:07,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759495080] [2024-10-14 04:59:07,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759495080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:07,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:07,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:59:07,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401381731] [2024-10-14 04:59:07,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:07,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:59:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:07,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:59:07,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:59:07,136 INFO L87 Difference]: Start difference. First operand 832 states and 1574 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:07,238 INFO L93 Difference]: Finished difference Result 878 states and 1646 transitions. [2024-10-14 04:59:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:59:07,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-14 04:59:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:07,243 INFO L225 Difference]: With dead ends: 878 [2024-10-14 04:59:07,243 INFO L226 Difference]: Without dead ends: 832 [2024-10-14 04:59:07,244 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-14 04:59:07,245 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 0 mSDsluCounter, 3107 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4678 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:07,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4678 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:59:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-14 04:59:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2024-10-14 04:59:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8590361445783132) internal successors, (1543), 831 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1543 transitions. [2024-10-14 04:59:07,273 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1543 transitions. Word has length 21 [2024-10-14 04:59:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:07,274 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1543 transitions. [2024-10-14 04:59:07,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1543 transitions. [2024-10-14 04:59:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 04:59:07,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:07,275 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] [2024-10-14 04:59:07,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:59:07,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:07,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash -196137149, now seen corresponding path program 1 times [2024-10-14 04:59:07,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:07,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427348819] [2024-10-14 04:59:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:07,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427348819] [2024-10-14 04:59:07,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427348819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:07,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:07,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 04:59:07,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413760747] [2024-10-14 04:59:07,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:07,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:07,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:07,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:07,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:07,366 INFO L87 Difference]: Start difference. First operand 832 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:10,578 INFO L93 Difference]: Finished difference Result 2336 states and 4416 transitions. [2024-10-14 04:59:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-14 04:59:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:10,587 INFO L225 Difference]: With dead ends: 2336 [2024-10-14 04:59:10,587 INFO L226 Difference]: Without dead ends: 1583 [2024-10-14 04:59:10,588 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-14 04:59:10,590 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 893 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:10,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 529 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 04:59:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-10-14 04:59:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2024-10-14 04:59:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1581 states have (on average 1.6255534471853257) internal successors, (2570), 1582 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2570 transitions. [2024-10-14 04:59:10,628 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2570 transitions. Word has length 29 [2024-10-14 04:59:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:10,628 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2570 transitions. [2024-10-14 04:59:10,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2570 transitions. [2024-10-14 04:59:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 04:59:10,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:10,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:10,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:59:10,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:10,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:10,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2084924126, now seen corresponding path program 1 times [2024-10-14 04:59:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:10,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625046899] [2024-10-14 04:59:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:10,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:10,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625046899] [2024-10-14 04:59:10,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625046899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:10,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:10,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:59:10,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917678767] [2024-10-14 04:59:10,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:10,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:59:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:59:10,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:59:10,827 INFO L87 Difference]: Start difference. First operand 1583 states and 2570 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:11,084 INFO L93 Difference]: Finished difference Result 2013 states and 3260 transitions. [2024-10-14 04:59:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 04:59:11,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 04:59:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:11,092 INFO L225 Difference]: With dead ends: 2013 [2024-10-14 04:59:11,093 INFO L226 Difference]: Without dead ends: 1970 [2024-10-14 04:59:11,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-14 04:59:11,095 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 7959 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7959 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:11,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7959 Valid, 2654 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:59:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2024-10-14 04:59:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1624. [2024-10-14 04:59:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2636 transitions. [2024-10-14 04:59:11,131 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2636 transitions. Word has length 51 [2024-10-14 04:59:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:11,131 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2636 transitions. [2024-10-14 04:59:11,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2636 transitions. [2024-10-14 04:59:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 04:59:11,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:11,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:11,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:59:11,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:11,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:11,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1991892562, now seen corresponding path program 1 times [2024-10-14 04:59:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:11,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826503028] [2024-10-14 04:59:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:11,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826503028] [2024-10-14 04:59:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826503028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:11,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74598969] [2024-10-14 04:59:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:11,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:11,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:11,230 INFO L87 Difference]: Start difference. First operand 1624 states and 2636 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:11,276 INFO L93 Difference]: Finished difference Result 1781 states and 2887 transitions. [2024-10-14 04:59:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 04:59:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:11,284 INFO L225 Difference]: With dead ends: 1781 [2024-10-14 04:59:11,284 INFO L226 Difference]: Without dead ends: 1697 [2024-10-14 04:59:11,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:11,286 INFO L432 NwaCegarLoop]: 1536 mSDtfsCounter, 1482 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:11,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1597 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-10-14 04:59:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1693. [2024-10-14 04:59:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.6227084565345948) internal successors, (2744), 1692 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2744 transitions. [2024-10-14 04:59:11,381 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2744 transitions. Word has length 53 [2024-10-14 04:59:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:11,382 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2744 transitions. [2024-10-14 04:59:11,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2744 transitions. [2024-10-14 04:59:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 04:59:11,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:11,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:11,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:59:11,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:11,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1994037514, now seen corresponding path program 1 times [2024-10-14 04:59:11,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:11,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710387637] [2024-10-14 04:59:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:11,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:11,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710387637] [2024-10-14 04:59:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710387637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:59:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803034731] [2024-10-14 04:59:11,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:11,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:59:11,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:11,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:59:11,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:59:11,696 INFO L87 Difference]: Start difference. First operand 1693 states and 2744 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:11,874 INFO L93 Difference]: Finished difference Result 1848 states and 2988 transitions. [2024-10-14 04:59:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:59:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 04:59:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:11,881 INFO L225 Difference]: With dead ends: 1848 [2024-10-14 04:59:11,881 INFO L226 Difference]: Without dead ends: 1695 [2024-10-14 04:59:11,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-14 04:59:11,884 INFO L432 NwaCegarLoop]: 1533 mSDtfsCounter, 4482 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:11,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 1796 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:59:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2024-10-14 04:59:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2024-10-14 04:59:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.621525724423418) internal successors, (2742), 1692 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2742 transitions. [2024-10-14 04:59:11,944 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2742 transitions. Word has length 53 [2024-10-14 04:59:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:11,945 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2742 transitions. [2024-10-14 04:59:11,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2742 transitions. [2024-10-14 04:59:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 04:59:11,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:11,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:59:11,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:11,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1556545358, now seen corresponding path program 1 times [2024-10-14 04:59:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008351663] [2024-10-14 04:59:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:12,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:12,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008351663] [2024-10-14 04:59:12,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008351663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:12,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:12,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 04:59:12,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413329608] [2024-10-14 04:59:12,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:12,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:59:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:12,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:59:12,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 04:59:12,142 INFO L87 Difference]: Start difference. First operand 1693 states and 2742 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-14 04:59:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:12,189 INFO L93 Difference]: Finished difference Result 1699 states and 2749 transitions. [2024-10-14 04:59:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:59:12,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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 54 [2024-10-14 04:59:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:12,196 INFO L225 Difference]: With dead ends: 1699 [2024-10-14 04:59:12,197 INFO L226 Difference]: Without dead ends: 1697 [2024-10-14 04:59:12,197 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-14 04:59:12,198 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 0 mSDsluCounter, 3070 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4609 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-14 04:59:12,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4609 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-10-14 04:59:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1697. [2024-10-14 04:59:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1695 states have (on average 1.6194690265486726) internal successors, (2745), 1696 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2745 transitions. [2024-10-14 04:59:12,240 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2745 transitions. Word has length 54 [2024-10-14 04:59:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:12,241 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2745 transitions. [2024-10-14 04:59:12,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-14 04:59:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2745 transitions. [2024-10-14 04:59:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 04:59:12,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:12,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:12,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:59:12,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:12,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash -333799254, now seen corresponding path program 1 times [2024-10-14 04:59:12,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:12,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563859259] [2024-10-14 04:59:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:12,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:12,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563859259] [2024-10-14 04:59:12,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563859259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:12,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:12,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:12,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967422444] [2024-10-14 04:59:12,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:12,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:12,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:12,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:12,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:12,316 INFO L87 Difference]: Start difference. First operand 1697 states and 2745 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:12,356 INFO L93 Difference]: Finished difference Result 1995 states and 3205 transitions. [2024-10-14 04:59:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:12,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 04:59:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:12,364 INFO L225 Difference]: With dead ends: 1995 [2024-10-14 04:59:12,364 INFO L226 Difference]: Without dead ends: 1838 [2024-10-14 04:59:12,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:12,366 INFO L432 NwaCegarLoop]: 1585 mSDtfsCounter, 1495 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1658 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-14 04:59:12,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1658 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-10-14 04:59:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1836. [2024-10-14 04:59:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1834 states have (on average 1.6117775354416575) internal successors, (2956), 1835 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2956 transitions. [2024-10-14 04:59:12,437 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2956 transitions. Word has length 55 [2024-10-14 04:59:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:12,438 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2956 transitions. [2024-10-14 04:59:12,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2956 transitions. [2024-10-14 04:59:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 04:59:12,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:12,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:59:12,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:12,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash -293855318, now seen corresponding path program 1 times [2024-10-14 04:59:12,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:12,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429231655] [2024-10-14 04:59:12,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:12,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429231655] [2024-10-14 04:59:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429231655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025719788] [2024-10-14 04:59:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:12,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:12,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:12,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:12,516 INFO L87 Difference]: Start difference. First operand 1836 states and 2956 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:12,556 INFO L93 Difference]: Finished difference Result 2396 states and 3810 transitions. [2024-10-14 04:59:12,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:12,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 04:59:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:12,564 INFO L225 Difference]: With dead ends: 2396 [2024-10-14 04:59:12,565 INFO L226 Difference]: Without dead ends: 2100 [2024-10-14 04:59:12,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:12,566 INFO L432 NwaCegarLoop]: 1583 mSDtfsCounter, 1493 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1660 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-14 04:59:12,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1660 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-10-14 04:59:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2098. [2024-10-14 04:59:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2096 states have (on average 1.5963740458015268) internal successors, (3346), 2097 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 3346 transitions. [2024-10-14 04:59:12,614 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 3346 transitions. Word has length 55 [2024-10-14 04:59:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:12,614 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 3346 transitions. [2024-10-14 04:59:12,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 3346 transitions. [2024-10-14 04:59:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 04:59:12,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:12,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:12,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:59:12,616 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:12,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash -919511382, now seen corresponding path program 1 times [2024-10-14 04:59:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175826289] [2024-10-14 04:59:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:12,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:12,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:12,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175826289] [2024-10-14 04:59:12,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175826289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:12,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:12,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:12,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507133307] [2024-10-14 04:59:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:12,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:12,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:12,682 INFO L87 Difference]: Start difference. First operand 2098 states and 3346 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:12,726 INFO L93 Difference]: Finished difference Result 3150 states and 4924 transitions. [2024-10-14 04:59:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:12,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 04:59:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:12,736 INFO L225 Difference]: With dead ends: 3150 [2024-10-14 04:59:12,736 INFO L226 Difference]: Without dead ends: 2592 [2024-10-14 04:59:12,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:12,738 INFO L432 NwaCegarLoop]: 1581 mSDtfsCounter, 1491 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1662 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-14 04:59:12,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1662 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2024-10-14 04:59:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2590. [2024-10-14 04:59:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2588 states have (on average 1.5695517774343122) internal successors, (4062), 2589 states have internal predecessors, (4062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4062 transitions. [2024-10-14 04:59:12,802 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4062 transitions. Word has length 55 [2024-10-14 04:59:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:12,802 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 4062 transitions. [2024-10-14 04:59:12,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4062 transitions. [2024-10-14 04:59:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 04:59:12,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:12,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:12,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:59:12,804 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:12,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash -30777942, now seen corresponding path program 1 times [2024-10-14 04:59:12,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:12,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72846501] [2024-10-14 04:59:12,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:12,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72846501] [2024-10-14 04:59:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72846501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:12,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:12,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906110149] [2024-10-14 04:59:12,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:12,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:12,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:12,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:12,897 INFO L87 Difference]: Start difference. First operand 2590 states and 4062 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:12,973 INFO L93 Difference]: Finished difference Result 4562 states and 6960 transitions. [2024-10-14 04:59:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:12,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 04:59:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:12,986 INFO L225 Difference]: With dead ends: 4562 [2024-10-14 04:59:12,986 INFO L226 Difference]: Without dead ends: 3512 [2024-10-14 04:59:12,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:12,989 INFO L432 NwaCegarLoop]: 1579 mSDtfsCounter, 1489 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1664 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-14 04:59:12,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1664 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2024-10-14 04:59:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3510. [2024-10-14 04:59:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 3508 states have (on average 1.5296465222348916) internal successors, (5366), 3509 states have internal predecessors, (5366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5366 transitions. [2024-10-14 04:59:13,077 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5366 transitions. Word has length 55 [2024-10-14 04:59:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:13,077 INFO L471 AbstractCegarLoop]: Abstraction has 3510 states and 5366 transitions. [2024-10-14 04:59:13,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5366 transitions. [2024-10-14 04:59:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 04:59:13,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:13,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:13,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:59:13,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:13,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1407843185, now seen corresponding path program 1 times [2024-10-14 04:59:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:13,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335919531] [2024-10-14 04:59:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:13,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:13,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:13,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335919531] [2024-10-14 04:59:13,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335919531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:13,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:13,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:13,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323800646] [2024-10-14 04:59:13,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:13,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:13,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:13,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:13,130 INFO L87 Difference]: Start difference. First operand 3510 states and 5366 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:13,208 INFO L93 Difference]: Finished difference Result 5565 states and 8412 transitions. [2024-10-14 04:59:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-14 04:59:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:13,224 INFO L225 Difference]: With dead ends: 5565 [2024-10-14 04:59:13,224 INFO L226 Difference]: Without dead ends: 4442 [2024-10-14 04:59:13,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:13,228 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1494 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1659 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-14 04:59:13,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2024-10-14 04:59:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4440. [2024-10-14 04:59:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 4438 states have (on average 1.5087877422262281) internal successors, (6696), 4439 states have internal predecessors, (6696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6696 transitions. [2024-10-14 04:59:13,365 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6696 transitions. Word has length 57 [2024-10-14 04:59:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:13,365 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 6696 transitions. [2024-10-14 04:59:13,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6696 transitions. [2024-10-14 04:59:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 04:59:13,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:13,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:13,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:59:13,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:13,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:13,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1643923532, now seen corresponding path program 1 times [2024-10-14 04:59:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:13,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435539172] [2024-10-14 04:59:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 04:59:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435539172] [2024-10-14 04:59:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435539172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:13,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:59:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480701850] [2024-10-14 04:59:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:13,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:59:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:59:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:59:13,571 INFO L87 Difference]: Start difference. First operand 4440 states and 6696 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:13,968 INFO L93 Difference]: Finished difference Result 19540 states and 28510 transitions. [2024-10-14 04:59:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:59:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 73 [2024-10-14 04:59:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:14,011 INFO L225 Difference]: With dead ends: 19540 [2024-10-14 04:59:14,011 INFO L226 Difference]: Without dead ends: 16642 [2024-10-14 04:59:14,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:59:14,023 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 6318 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6318 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:14,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6318 Valid, 3609 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:59:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16642 states. [2024-10-14 04:59:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 7336. [2024-10-14 04:59:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7336 states, 7334 states have (on average 1.478047450231797) internal successors, (10840), 7335 states have internal predecessors, (10840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7336 states to 7336 states and 10840 transitions. [2024-10-14 04:59:14,421 INFO L78 Accepts]: Start accepts. Automaton has 7336 states and 10840 transitions. Word has length 73 [2024-10-14 04:59:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:14,421 INFO L471 AbstractCegarLoop]: Abstraction has 7336 states and 10840 transitions. [2024-10-14 04:59:14,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 7336 states and 10840 transitions. [2024-10-14 04:59:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 04:59:14,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:14,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:14,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:59:14,424 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:14,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1683867468, now seen corresponding path program 1 times [2024-10-14 04:59:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:14,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554883261] [2024-10-14 04:59:14,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 04:59:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:14,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554883261] [2024-10-14 04:59:14,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554883261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:14,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:14,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:59:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798617630] [2024-10-14 04:59:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:14,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:59:14,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:14,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:59:14,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:59:14,626 INFO L87 Difference]: Start difference. First operand 7336 states and 10840 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:15,177 INFO L93 Difference]: Finished difference Result 22436 states and 32654 transitions. [2024-10-14 04:59:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:59:15,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 73 [2024-10-14 04:59:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:15,216 INFO L225 Difference]: With dead ends: 22436 [2024-10-14 04:59:15,216 INFO L226 Difference]: Without dead ends: 19538 [2024-10-14 04:59:15,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:59:15,227 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 6338 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6338 SdHoareTripleChecker+Valid, 3557 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:15,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6338 Valid, 3557 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:59:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19538 states. [2024-10-14 04:59:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19538 to 11688. [2024-10-14 04:59:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11688 states, 11686 states have (on average 1.4561013178161903) internal successors, (17016), 11687 states have internal predecessors, (17016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11688 states to 11688 states and 17016 transitions. [2024-10-14 04:59:15,622 INFO L78 Accepts]: Start accepts. Automaton has 11688 states and 17016 transitions. Word has length 73 [2024-10-14 04:59:15,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:15,622 INFO L471 AbstractCegarLoop]: Abstraction has 11688 states and 17016 transitions. [2024-10-14 04:59:15,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 11688 states and 17016 transitions. [2024-10-14 04:59:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 04:59:15,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:15,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:15,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:59:15,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:15,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1058211404, now seen corresponding path program 1 times [2024-10-14 04:59:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:15,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663447347] [2024-10-14 04:59:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 04:59:15,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:15,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663447347] [2024-10-14 04:59:15,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663447347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:15,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:15,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:59:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534611312] [2024-10-14 04:59:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:15,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:59:15,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:59:15,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:59:15,829 INFO L87 Difference]: Start difference. First operand 11688 states and 17016 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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-14 04:59:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:16,364 INFO L93 Difference]: Finished difference Result 25332 states and 36798 transitions. [2024-10-14 04:59:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:59:16,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 73 [2024-10-14 04:59:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:16,409 INFO L225 Difference]: With dead ends: 25332 [2024-10-14 04:59:16,409 INFO L226 Difference]: Without dead ends: 22434 [2024-10-14 04:59:16,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:59:16,425 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 6382 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6382 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:16,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6382 Valid, 3520 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:59:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2024-10-14 04:59:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 14584. [2024-10-14 04:59:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14584 states, 14582 states have (on average 1.4511041009463723) internal successors, (21160), 14583 states have internal predecessors, (21160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14584 states to 14584 states and 21160 transitions. [2024-10-14 04:59:16,911 INFO L78 Accepts]: Start accepts. Automaton has 14584 states and 21160 transitions. Word has length 73 [2024-10-14 04:59:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:16,912 INFO L471 AbstractCegarLoop]: Abstraction has 14584 states and 21160 transitions. [2024-10-14 04:59:16,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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-14 04:59:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 14584 states and 21160 transitions. [2024-10-14 04:59:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 04:59:16,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:16,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:16,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 04:59:16,915 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:16,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1946944844, now seen corresponding path program 1 times [2024-10-14 04:59:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:16,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678481839] [2024-10-14 04:59:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 04:59:17,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:17,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678481839] [2024-10-14 04:59:17,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678481839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:17,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:59:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588811469] [2024-10-14 04:59:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:17,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:59:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:59:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:59:17,096 INFO L87 Difference]: Start difference. First operand 14584 states and 21160 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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-14 04:59:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:17,682 INFO L93 Difference]: Finished difference Result 28228 states and 40942 transitions. [2024-10-14 04:59:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:59:17,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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 73 [2024-10-14 04:59:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:17,737 INFO L225 Difference]: With dead ends: 28228 [2024-10-14 04:59:17,737 INFO L226 Difference]: Without dead ends: 25330 [2024-10-14 04:59:17,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:59:17,751 INFO L432 NwaCegarLoop]: 1603 mSDtfsCounter, 6333 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6333 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:17,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6333 Valid, 3568 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:59:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25330 states. [2024-10-14 04:59:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25330 to 17480. [2024-10-14 04:59:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17480 states, 17478 states have (on average 1.4477629019338598) internal successors, (25304), 17479 states have internal predecessors, (25304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17480 states to 17480 states and 25304 transitions. [2024-10-14 04:59:18,254 INFO L78 Accepts]: Start accepts. Automaton has 17480 states and 25304 transitions. Word has length 73 [2024-10-14 04:59:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:18,254 INFO L471 AbstractCegarLoop]: Abstraction has 17480 states and 25304 transitions. [2024-10-14 04:59:18,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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-14 04:59:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 17480 states and 25304 transitions. [2024-10-14 04:59:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 04:59:18,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:18,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:18,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 04:59:18,257 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:18,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:18,258 INFO L85 PathProgramCache]: Analyzing trace with hash -881055308, now seen corresponding path program 1 times [2024-10-14 04:59:18,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:18,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744697477] [2024-10-14 04:59:18,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:18,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:18,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:18,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744697477] [2024-10-14 04:59:18,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744697477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:18,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:18,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834159194] [2024-10-14 04:59:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:18,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:18,426 INFO L87 Difference]: Start difference. First operand 17480 states and 25304 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:18,711 INFO L93 Difference]: Finished difference Result 28767 states and 41694 transitions. [2024-10-14 04:59:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:18,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-14 04:59:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:18,738 INFO L225 Difference]: With dead ends: 28767 [2024-10-14 04:59:18,738 INFO L226 Difference]: Without dead ends: 12829 [2024-10-14 04:59:18,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:18,760 INFO L432 NwaCegarLoop]: 1580 mSDtfsCounter, 50 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3106 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-14 04:59:18,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3106 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2024-10-14 04:59:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 12827. [2024-10-14 04:59:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12827 states, 12825 states have (on average 1.4592592592592593) internal successors, (18715), 12826 states have internal predecessors, (18715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12827 states to 12827 states and 18715 transitions. [2024-10-14 04:59:19,218 INFO L78 Accepts]: Start accepts. Automaton has 12827 states and 18715 transitions. Word has length 75 [2024-10-14 04:59:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:19,219 INFO L471 AbstractCegarLoop]: Abstraction has 12827 states and 18715 transitions. [2024-10-14 04:59:19,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 12827 states and 18715 transitions. [2024-10-14 04:59:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 04:59:19,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:19,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:19,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 04:59:19,222 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:19,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash 808209329, now seen corresponding path program 1 times [2024-10-14 04:59:19,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929663371] [2024-10-14 04:59:19,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:19,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 04:59:19,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:19,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929663371] [2024-10-14 04:59:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929663371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:19,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:19,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:59:19,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755905533] [2024-10-14 04:59:19,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:19,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:59:19,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:19,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:59:19,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:59:19,379 INFO L87 Difference]: Start difference. First operand 12827 states and 18715 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:19,794 INFO L93 Difference]: Finished difference Result 23079 states and 33601 transitions. [2024-10-14 04:59:19,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:59:19,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 75 [2024-10-14 04:59:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:19,828 INFO L225 Difference]: With dead ends: 23079 [2024-10-14 04:59:19,829 INFO L226 Difference]: Without dead ends: 21029 [2024-10-14 04:59:19,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:59:19,841 INFO L432 NwaCegarLoop]: 1597 mSDtfsCounter, 6321 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6321 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:19,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6321 Valid, 3692 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:59:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21029 states. [2024-10-14 04:59:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21029 to 14875. [2024-10-14 04:59:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14875 states, 14873 states have (on average 1.4562630269616084) internal successors, (21659), 14874 states have internal predecessors, (21659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14875 states to 14875 states and 21659 transitions. [2024-10-14 04:59:20,348 INFO L78 Accepts]: Start accepts. Automaton has 14875 states and 21659 transitions. Word has length 75 [2024-10-14 04:59:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:20,349 INFO L471 AbstractCegarLoop]: Abstraction has 14875 states and 21659 transitions. [2024-10-14 04:59:20,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 14875 states and 21659 transitions. [2024-10-14 04:59:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 04:59:20,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:20,352 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:20,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 04:59:20,353 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:20,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 448668534, now seen corresponding path program 1 times [2024-10-14 04:59:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:20,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267752633] [2024-10-14 04:59:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267752633] [2024-10-14 04:59:20,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267752633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:20,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:20,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:20,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728009541] [2024-10-14 04:59:20,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:20,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:20,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:20,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:20,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:20,460 INFO L87 Difference]: Start difference. First operand 14875 states and 21659 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:20,631 INFO L93 Difference]: Finished difference Result 21535 states and 31229 transitions. [2024-10-14 04:59:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:20,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-14 04:59:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:20,643 INFO L225 Difference]: With dead ends: 21535 [2024-10-14 04:59:20,644 INFO L226 Difference]: Without dead ends: 8221 [2024-10-14 04:59:20,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:20,657 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 45 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3091 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-14 04:59:20,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3091 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:20,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8221 states. [2024-10-14 04:59:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8221 to 8219. [2024-10-14 04:59:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8219 states, 8217 states have (on average 1.458804916636242) internal successors, (11987), 8218 states have internal predecessors, (11987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8219 states to 8219 states and 11987 transitions. [2024-10-14 04:59:20,838 INFO L78 Accepts]: Start accepts. Automaton has 8219 states and 11987 transitions. Word has length 76 [2024-10-14 04:59:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:20,839 INFO L471 AbstractCegarLoop]: Abstraction has 8219 states and 11987 transitions. [2024-10-14 04:59:20,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8219 states and 11987 transitions. [2024-10-14 04:59:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 04:59:20,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:20,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:20,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 04:59:20,844 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:20,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1891792292, now seen corresponding path program 1 times [2024-10-14 04:59:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:20,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655684067] [2024-10-14 04:59:20,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:20,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655684067] [2024-10-14 04:59:20,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655684067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:20,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:20,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:20,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349253918] [2024-10-14 04:59:20,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:20,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:20,945 INFO L87 Difference]: Start difference. First operand 8219 states and 11987 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:21,041 INFO L93 Difference]: Finished difference Result 11551 states and 16721 transitions. [2024-10-14 04:59:21,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-14 04:59:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:21,049 INFO L225 Difference]: With dead ends: 11551 [2024-10-14 04:59:21,049 INFO L226 Difference]: Without dead ends: 4893 [2024-10-14 04:59:21,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:21,056 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 42 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3076 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-14 04:59:21,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3076 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2024-10-14 04:59:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4891. [2024-10-14 04:59:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4889 states have (on average 1.4733074248312539) internal successors, (7203), 4890 states have internal predecessors, (7203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 7203 transitions. [2024-10-14 04:59:21,165 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 7203 transitions. Word has length 78 [2024-10-14 04:59:21,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:21,165 INFO L471 AbstractCegarLoop]: Abstraction has 4891 states and 7203 transitions. [2024-10-14 04:59:21,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 7203 transitions. [2024-10-14 04:59:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 04:59:21,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:21,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:21,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 04:59:21,168 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:21,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2071422638, now seen corresponding path program 1 times [2024-10-14 04:59:21,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328298400] [2024-10-14 04:59:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:21,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:21,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328298400] [2024-10-14 04:59:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328298400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:21,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102733577] [2024-10-14 04:59:21,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:21,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:21,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:21,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:21,262 INFO L87 Difference]: Start difference. First operand 4891 states and 7203 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:21,323 INFO L93 Difference]: Finished difference Result 6559 states and 9545 transitions. [2024-10-14 04:59:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:21,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-14 04:59:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:21,329 INFO L225 Difference]: With dead ends: 6559 [2024-10-14 04:59:21,329 INFO L226 Difference]: Without dead ends: 3229 [2024-10-14 04:59:21,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:21,333 INFO L432 NwaCegarLoop]: 1559 mSDtfsCounter, 39 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3061 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-14 04:59:21,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3061 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2024-10-14 04:59:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3227. [2024-10-14 04:59:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3225 states have (on average 1.49984496124031) internal successors, (4837), 3226 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4837 transitions. [2024-10-14 04:59:21,395 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4837 transitions. Word has length 80 [2024-10-14 04:59:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:21,396 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 4837 transitions. [2024-10-14 04:59:21,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4837 transitions. [2024-10-14 04:59:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 04:59:21,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:21,397 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:21,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 04:59:21,398 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash -838373760, now seen corresponding path program 1 times [2024-10-14 04:59:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628501612] [2024-10-14 04:59:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:21,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628501612] [2024-10-14 04:59:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628501612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:59:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:59:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:59:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485302583] [2024-10-14 04:59:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:59:21,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:59:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:21,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:59:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:21,483 INFO L87 Difference]: Start difference. First operand 3227 states and 4837 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:21,525 INFO L93 Difference]: Finished difference Result 4063 states and 5996 transitions. [2024-10-14 04:59:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:59:21,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-10-14 04:59:21,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:21,530 INFO L225 Difference]: With dead ends: 4063 [2024-10-14 04:59:21,530 INFO L226 Difference]: Without dead ends: 2397 [2024-10-14 04:59:21,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:59:21,533 INFO L432 NwaCegarLoop]: 1552 mSDtfsCounter, 36 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3046 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-14 04:59:21,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3046 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:59:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2024-10-14 04:59:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2395. [2024-10-14 04:59:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2393 states have (on average 1.532386126201421) internal successors, (3667), 2394 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3667 transitions. [2024-10-14 04:59:21,571 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3667 transitions. Word has length 82 [2024-10-14 04:59:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:21,572 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3667 transitions. [2024-10-14 04:59:21,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:21,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3667 transitions. [2024-10-14 04:59:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 04:59:21,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:21,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:21,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 04:59:21,573 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:21,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash 726521134, now seen corresponding path program 1 times [2024-10-14 04:59:21,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:21,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522887981] [2024-10-14 04:59:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:22,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:22,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522887981] [2024-10-14 04:59:22,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522887981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:59:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463176806] [2024-10-14 04:59:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:22,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:59:22,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:59:22,837 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-14 04:59:22,838 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-14 04:59:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:22,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 04:59:23,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:59:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 04:59:23,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 04:59:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 04:59:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463176806] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 04:59:23,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 04:59:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-14 04:59:23,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660625677] [2024-10-14 04:59:23,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 04:59:23,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 04:59:23,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:23,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 04:59:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-14 04:59:23,445 INFO L87 Difference]: Start difference. First operand 2395 states and 3667 transitions. Second operand has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:25,919 INFO L93 Difference]: Finished difference Result 7990 states and 11205 transitions. [2024-10-14 04:59:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-14 04:59:25,920 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 states have internal predecessors, (238), 0 states have call successors, (0), 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 84 [2024-10-14 04:59:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:25,928 INFO L225 Difference]: With dead ends: 7990 [2024-10-14 04:59:25,929 INFO L226 Difference]: Without dead ends: 7156 [2024-10-14 04:59:25,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=714, Invalid=2946, Unknown=0, NotChecked=0, Total=3660 [2024-10-14 04:59:25,932 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 17879 mSDsluCounter, 6390 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17879 SdHoareTripleChecker+Valid, 7908 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:25,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17879 Valid, 7908 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 04:59:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7156 states. [2024-10-14 04:59:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7156 to 7108. [2024-10-14 04:59:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 7106 states have (on average 1.3627920067548551) internal successors, (9684), 7107 states have internal predecessors, (9684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 9684 transitions. [2024-10-14 04:59:26,104 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 9684 transitions. Word has length 84 [2024-10-14 04:59:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:26,105 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 9684 transitions. [2024-10-14 04:59:26,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 9684 transitions. [2024-10-14 04:59:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 04:59:26,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:26,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:26,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 04:59:26,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-14 04:59:26,308 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:26,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:26,308 INFO L85 PathProgramCache]: Analyzing trace with hash -648800735, now seen corresponding path program 1 times [2024-10-14 04:59:26,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:26,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942579047] [2024-10-14 04:59:26,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:27,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942579047] [2024-10-14 04:59:27,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942579047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:59:27,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435774298] [2024-10-14 04:59:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:27,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:59:27,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:59:27,161 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-14 04:59:27,162 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-14 04:59:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:27,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 04:59:27,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:59:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:27,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 04:59:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435774298] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 04:59:29,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 04:59:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-10-14 04:59:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25815250] [2024-10-14 04:59:29,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 04:59:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 04:59:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:29,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 04:59:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 04:59:29,052 INFO L87 Difference]: Start difference. First operand 7108 states and 9684 transitions. Second operand has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:32,119 INFO L93 Difference]: Finished difference Result 25403 states and 33841 transitions. [2024-10-14 04:59:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-14 04:59:32,120 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 0 states have call successors, (0), 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 85 [2024-10-14 04:59:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:32,141 INFO L225 Difference]: With dead ends: 25403 [2024-10-14 04:59:32,141 INFO L226 Difference]: Without dead ends: 20003 [2024-10-14 04:59:32,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1158, Invalid=5004, Unknown=0, NotChecked=0, Total=6162 [2024-10-14 04:59:32,148 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 22165 mSDsluCounter, 11050 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22165 SdHoareTripleChecker+Valid, 12562 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:32,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22165 Valid, 12562 Invalid, 1326 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 04:59:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20003 states. [2024-10-14 04:59:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20003 to 19845. [2024-10-14 04:59:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19845 states, 19843 states have (on average 1.3113944464042735) internal successors, (26022), 19844 states have internal predecessors, (26022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19845 states to 19845 states and 26022 transitions. [2024-10-14 04:59:32,872 INFO L78 Accepts]: Start accepts. Automaton has 19845 states and 26022 transitions. Word has length 85 [2024-10-14 04:59:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:32,873 INFO L471 AbstractCegarLoop]: Abstraction has 19845 states and 26022 transitions. [2024-10-14 04:59:32,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 19845 states and 26022 transitions. [2024-10-14 04:59:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 04:59:32,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:32,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:32,891 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-14 04:59:33,079 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,SelfDestructingSolverStorable23 [2024-10-14 04:59:33,080 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:33,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash 695558255, now seen corresponding path program 1 times [2024-10-14 04:59:33,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:33,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082369402] [2024-10-14 04:59:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:33,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:34,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:34,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082369402] [2024-10-14 04:59:34,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082369402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:59:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652914553] [2024-10-14 04:59:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:59:34,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:59:34,773 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-14 04:59:34,781 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-14 04:59:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:34,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 04:59:34,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:59:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:35,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 04:59:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:35,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652914553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 04:59:35,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 04:59:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-10-14 04:59:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012614908] [2024-10-14 04:59:35,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 04:59:35,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 04:59:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 04:59:35,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-10-14 04:59:35,950 INFO L87 Difference]: Start difference. First operand 19845 states and 26022 transitions. Second operand has 28 states, 28 states have (on average 8.142857142857142) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:38,416 INFO L93 Difference]: Finished difference Result 60463 states and 78403 transitions. [2024-10-14 04:59:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-14 04:59:38,416 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.142857142857142) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 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 85 [2024-10-14 04:59:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:38,460 INFO L225 Difference]: With dead ends: 60463 [2024-10-14 04:59:38,460 INFO L226 Difference]: Without dead ends: 44160 [2024-10-14 04:59:38,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=684, Invalid=2976, Unknown=0, NotChecked=0, Total=3660 [2024-10-14 04:59:38,471 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 21172 mSDsluCounter, 9732 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21172 SdHoareTripleChecker+Valid, 11261 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:38,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21172 Valid, 11261 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 04:59:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44160 states. [2024-10-14 04:59:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44160 to 40863. [2024-10-14 04:59:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40863 states, 40861 states have (on average 1.286189765301877) internal successors, (52555), 40862 states have internal predecessors, (52555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40863 states to 40863 states and 52555 transitions. [2024-10-14 04:59:39,444 INFO L78 Accepts]: Start accepts. Automaton has 40863 states and 52555 transitions. Word has length 85 [2024-10-14 04:59:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:39,445 INFO L471 AbstractCegarLoop]: Abstraction has 40863 states and 52555 transitions. [2024-10-14 04:59:39,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.142857142857142) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 40863 states and 52555 transitions. [2024-10-14 04:59:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 04:59:39,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:39,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:39,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 04:59:39,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:59:39,648 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:39,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash 556628988, now seen corresponding path program 1 times [2024-10-14 04:59:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:39,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647871825] [2024-10-14 04:59:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:39,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:39,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647871825] [2024-10-14 04:59:39,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647871825] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:59:39,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472392535] [2024-10-14 04:59:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:39,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:59:39,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:59:39,995 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-14 04:59:39,996 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-14 04:59:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:40,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 04:59:40,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:59:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:40,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 04:59:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:41,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472392535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 04:59:41,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 04:59:41,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2024-10-14 04:59:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406825357] [2024-10-14 04:59:41,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 04:59:41,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 04:59:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:41,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 04:59:41,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2024-10-14 04:59:41,719 INFO L87 Difference]: Start difference. First operand 40863 states and 52555 transitions. Second operand has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:44,969 INFO L93 Difference]: Finished difference Result 88170 states and 113063 transitions. [2024-10-14 04:59:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 04:59:44,969 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-14 04:59:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:45,029 INFO L225 Difference]: With dead ends: 88170 [2024-10-14 04:59:45,029 INFO L226 Difference]: Without dead ends: 49531 [2024-10-14 04:59:45,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=734, Invalid=2926, Unknown=0, NotChecked=0, Total=3660 [2024-10-14 04:59:45,059 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 18650 mSDsluCounter, 6587 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18650 SdHoareTripleChecker+Valid, 8095 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:45,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18650 Valid, 8095 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 04:59:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49531 states. [2024-10-14 04:59:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49531 to 47157. [2024-10-14 04:59:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47157 states, 47155 states have (on average 1.268370268264235) internal successors, (59810), 47156 states have internal predecessors, (59810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47157 states to 47157 states and 59810 transitions. [2024-10-14 04:59:46,668 INFO L78 Accepts]: Start accepts. Automaton has 47157 states and 59810 transitions. Word has length 86 [2024-10-14 04:59:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:46,668 INFO L471 AbstractCegarLoop]: Abstraction has 47157 states and 59810 transitions. [2024-10-14 04:59:46,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 47157 states and 59810 transitions. [2024-10-14 04:59:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 04:59:46,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:46,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:46,682 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-14 04:59:46,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 04:59:46,871 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:46,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:46,871 INFO L85 PathProgramCache]: Analyzing trace with hash -849144929, now seen corresponding path program 1 times [2024-10-14 04:59:46,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:46,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924036275] [2024-10-14 04:59:46,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:47,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:47,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924036275] [2024-10-14 04:59:47,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924036275] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:59:47,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15852168] [2024-10-14 04:59:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:47,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:59:47,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:59:47,213 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-14 04:59:47,215 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-14 04:59:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:47,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 04:59:47,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:59:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:47,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 04:59:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:48,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15852168] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 04:59:48,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 04:59:48,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-14 04:59:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231703001] [2024-10-14 04:59:48,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 04:59:48,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 04:59:48,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:59:48,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 04:59:48,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-10-14 04:59:48,494 INFO L87 Difference]: Start difference. First operand 47157 states and 59810 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 21 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:59:50,730 INFO L93 Difference]: Finished difference Result 124144 states and 157178 transitions. [2024-10-14 04:59:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 04:59:50,731 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 21 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-14 04:59:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:59:50,858 INFO L225 Difference]: With dead ends: 124144 [2024-10-14 04:59:50,858 INFO L226 Difference]: Without dead ends: 83002 [2024-10-14 04:59:50,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2024-10-14 04:59:50,891 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 7854 mSDsluCounter, 4795 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7854 SdHoareTripleChecker+Valid, 6318 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:59:50,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7854 Valid, 6318 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 04:59:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83002 states. [2024-10-14 04:59:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83002 to 78642. [2024-10-14 04:59:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78642 states, 78640 states have (on average 1.250851983723296) internal successors, (98367), 78641 states have internal predecessors, (98367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78642 states to 78642 states and 98367 transitions. [2024-10-14 04:59:54,045 INFO L78 Accepts]: Start accepts. Automaton has 78642 states and 98367 transitions. Word has length 87 [2024-10-14 04:59:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:59:54,046 INFO L471 AbstractCegarLoop]: Abstraction has 78642 states and 98367 transitions. [2024-10-14 04:59:54,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 21 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:59:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 78642 states and 98367 transitions. [2024-10-14 04:59:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 04:59:54,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:59:54,049 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:59:54,066 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-14 04:59:54,249 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,SelfDestructingSolverStorable26 [2024-10-14 04:59:54,250 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:59:54,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:59:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash -226728868, now seen corresponding path program 1 times [2024-10-14 04:59:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:59:54,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875934020] [2024-10-14 04:59:54,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:54,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:59:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:59:58,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:59:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875934020] [2024-10-14 04:59:58,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875934020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:59:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186097199] [2024-10-14 04:59:58,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:59:58,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:59:58,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:59:58,231 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-14 04:59:58,232 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-14 04:59:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:59:58,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-14 04:59:58,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:00:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:00:04,696 INFO L311 TraceCheckSpWp]: Computing backward predicates...