./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/eca-rers2012/Problem10_label40.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 be7ecc9aa1c7e8dfb9739700094e29609bf8bf38dd295ce34c37d7f9597d2a6e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:20:23,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:20:23,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:20:23,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:20:23,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:20:23,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:20:23,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:20:23,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:20:23,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:20:23,205 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:20:23,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:20:23,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:20:23,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:20:23,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:20:23,207 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:20:23,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:20:23,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:20:23,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:20:23,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:20:23,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:20:23,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:20:23,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:20:23,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:20:23,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:20:23,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:20:23,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:20:23,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:20:23,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:20:23,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:20:23,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:20:23,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:20:23,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:20:23,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:23,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:20:23,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:20:23,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:20:23,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:20:23,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:20:23,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:20:23,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:20:23,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:20:23,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:20:23,218 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 -> be7ecc9aa1c7e8dfb9739700094e29609bf8bf38dd295ce34c37d7f9597d2a6e [2024-11-09 19:20:23,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:20:23,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:20:23,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:20:23,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:20:23,458 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:20:23,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label40.c [2024-11-09 19:20:24,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:20:25,029 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:20:25,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label40.c [2024-11-09 19:20:25,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0efc757b/c393496faa434fd7adce1764f60dff21/FLAG649f8428b [2024-11-09 19:20:25,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0efc757b/c393496faa434fd7adce1764f60dff21 [2024-11-09 19:20:25,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:20:25,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:20:25,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:25,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:20:25,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:20:25,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d89f894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25, skipping insertion in model container [2024-11-09 19:20:25,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:20:25,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label40.c[5662,5675] [2024-11-09 19:20:25,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:25,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:20:25,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label40.c[5662,5675] [2024-11-09 19:20:25,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:25,503 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:20:25,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25 WrapperNode [2024-11-09 19:20:25,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:25,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:25,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:20:25,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:20:25,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,586 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-09 19:20:25,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:25,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:20:25,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:20:25,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:20:25,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,633 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-11-09 19:20:25,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:20:25,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:20:25,671 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:20:25,671 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:20:25,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (1/1) ... [2024-11-09 19:20:25,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:25,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:20:25,704 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-11-09 19:20:25,710 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-11-09 19:20:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:20:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:20:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:20:25,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:20:25,797 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:20:25,798 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:20:26,697 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-09 19:20:26,697 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:20:26,716 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:20:26,716 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:20:26,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:26 BoogieIcfgContainer [2024-11-09 19:20:26,717 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:20:26,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:20:26,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:20:26,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:20:26,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:20:25" (1/3) ... [2024-11-09 19:20:26,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43e72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:26, skipping insertion in model container [2024-11-09 19:20:26,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:25" (2/3) ... [2024-11-09 19:20:26,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43e72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:26, skipping insertion in model container [2024-11-09 19:20:26,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:26" (3/3) ... [2024-11-09 19:20:26,725 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label40.c [2024-11-09 19:20:26,740 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:20:26,740 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:20:26,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:20:26,805 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;@57146226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:20:26,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:20:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 19:20:26,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:26,820 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-11-09 19:20:26,820 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:26,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:26,825 INFO L85 PathProgramCache]: Analyzing trace with hash -432281429, now seen corresponding path program 1 times [2024-11-09 19:20:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352261657] [2024-11-09 19:20:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:26,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:27,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-11-09 19:20:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352261657] [2024-11-09 19:20:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352261657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:27,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703465648] [2024-11-09 19:20:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:27,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:27,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:27,187 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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-11-09 19:20:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:28,004 INFO L93 Difference]: Finished difference Result 558 states and 1194 transitions. [2024-11-09 19:20:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:28,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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-11-09 19:20:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:28,016 INFO L225 Difference]: With dead ends: 558 [2024-11-09 19:20:28,016 INFO L226 Difference]: Without dead ends: 285 [2024-11-09 19:20:28,019 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-11-09 19:20:28,022 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 213 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:28,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 80 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:20:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-09 19:20:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-09 19:20:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.0528169014084505) internal successors, (583), 284 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 583 transitions. [2024-11-09 19:20:28,066 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 583 transitions. Word has length 51 [2024-11-09 19:20:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:28,067 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 583 transitions. [2024-11-09 19:20:28,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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-11-09 19:20:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 583 transitions. [2024-11-09 19:20:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 19:20:28,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:28,070 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:28,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:20:28,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:28,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash -22527618, now seen corresponding path program 1 times [2024-11-09 19:20:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:28,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403139684] [2024-11-09 19:20:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:28,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:28,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403139684] [2024-11-09 19:20:28,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403139684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:28,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:28,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:28,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033463859] [2024-11-09 19:20:28,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:28,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:28,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:28,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:28,250 INFO L87 Difference]: Start difference. First operand 285 states and 583 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:28,829 INFO L93 Difference]: Finished difference Result 708 states and 1453 transitions. [2024-11-09 19:20:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:28,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-09 19:20:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:28,835 INFO L225 Difference]: With dead ends: 708 [2024-11-09 19:20:28,835 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 19:20:28,837 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-11-09 19:20:28,838 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 184 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:28,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 37 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 19:20:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-09 19:20:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.9386792452830188) internal successors, (822), 424 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 822 transitions. [2024-11-09 19:20:28,861 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 822 transitions. Word has length 121 [2024-11-09 19:20:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:28,862 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 822 transitions. [2024-11-09 19:20:28,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 822 transitions. [2024-11-09 19:20:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 19:20:28,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:28,867 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:28,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:20:28,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:28,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -981782320, now seen corresponding path program 1 times [2024-11-09 19:20:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:28,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524948246] [2024-11-09 19:20:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:29,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:29,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524948246] [2024-11-09 19:20:29,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524948246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:29,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:29,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:29,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329112707] [2024-11-09 19:20:29,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:29,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:29,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:29,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:29,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:29,050 INFO L87 Difference]: Start difference. First operand 425 states and 822 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:29,599 INFO L93 Difference]: Finished difference Result 1268 states and 2460 transitions. [2024-11-09 19:20:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-09 19:20:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:29,604 INFO L225 Difference]: With dead ends: 1268 [2024-11-09 19:20:29,604 INFO L226 Difference]: Without dead ends: 845 [2024-11-09 19:20:29,606 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-11-09 19:20:29,607 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:29,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 284 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-09 19:20:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 705. [2024-11-09 19:20:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.8465909090909092) internal successors, (1300), 704 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1300 transitions. [2024-11-09 19:20:29,630 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1300 transitions. Word has length 127 [2024-11-09 19:20:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1300 transitions. [2024-11-09 19:20:29,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1300 transitions. [2024-11-09 19:20:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 19:20:29,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:29,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:29,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:20:29,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:29,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:29,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1441939548, now seen corresponding path program 1 times [2024-11-09 19:20:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552212433] [2024-11-09 19:20:29,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:29,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:29,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:29,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552212433] [2024-11-09 19:20:29,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552212433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:29,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:29,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:29,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701405174] [2024-11-09 19:20:29,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:29,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:29,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:29,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:29,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:29,833 INFO L87 Difference]: Start difference. First operand 705 states and 1300 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:30,361 INFO L93 Difference]: Finished difference Result 1688 states and 3127 transitions. [2024-11-09 19:20:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:30,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-11-09 19:20:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:30,365 INFO L225 Difference]: With dead ends: 1688 [2024-11-09 19:20:30,366 INFO L226 Difference]: Without dead ends: 985 [2024-11-09 19:20:30,367 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-11-09 19:20:30,368 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:30,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 73 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-09 19:20:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2024-11-09 19:20:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 1.7215447154471544) internal successors, (1694), 984 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1694 transitions. [2024-11-09 19:20:30,385 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1694 transitions. Word has length 138 [2024-11-09 19:20:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:30,385 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1694 transitions. [2024-11-09 19:20:30,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1694 transitions. [2024-11-09 19:20:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 19:20:30,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:30,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:30,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:20:30,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:30,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash -700365694, now seen corresponding path program 1 times [2024-11-09 19:20:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:30,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315211147] [2024-11-09 19:20:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:30,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315211147] [2024-11-09 19:20:30,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315211147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:30,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:30,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:30,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056020447] [2024-11-09 19:20:30,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:30,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:30,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:30,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:30,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:30,618 INFO L87 Difference]: Start difference. First operand 985 states and 1694 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:31,083 INFO L93 Difference]: Finished difference Result 2108 states and 3610 transitions. [2024-11-09 19:20:31,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:31,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-11-09 19:20:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:31,088 INFO L225 Difference]: With dead ends: 2108 [2024-11-09 19:20:31,088 INFO L226 Difference]: Without dead ends: 1125 [2024-11-09 19:20:31,090 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-11-09 19:20:31,091 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 102 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:31,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 86 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:20:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-09 19:20:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2024-11-09 19:20:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.7019572953736655) internal successors, (1913), 1124 states have internal predecessors, (1913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1913 transitions. [2024-11-09 19:20:31,111 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1913 transitions. Word has length 165 [2024-11-09 19:20:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:31,112 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1913 transitions. [2024-11-09 19:20:31,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1913 transitions. [2024-11-09 19:20:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-09 19:20:31,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:31,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:31,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:20:31,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:31,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:31,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1951799481, now seen corresponding path program 1 times [2024-11-09 19:20:31,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:31,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645310434] [2024-11-09 19:20:31,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:31,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645310434] [2024-11-09 19:20:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645310434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:31,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:31,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116566218] [2024-11-09 19:20:31,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:31,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:31,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:31,322 INFO L87 Difference]: Start difference. First operand 1125 states and 1913 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:31,882 INFO L93 Difference]: Finished difference Result 2388 states and 4134 transitions. [2024-11-09 19:20:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:31,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2024-11-09 19:20:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:31,889 INFO L225 Difference]: With dead ends: 2388 [2024-11-09 19:20:31,890 INFO L226 Difference]: Without dead ends: 1405 [2024-11-09 19:20:31,891 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-11-09 19:20:31,893 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:31,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 294 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-09 19:20:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1265. [2024-11-09 19:20:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.6906645569620253) internal successors, (2137), 1264 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2137 transitions. [2024-11-09 19:20:31,914 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2137 transitions. Word has length 205 [2024-11-09 19:20:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:31,916 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2137 transitions. [2024-11-09 19:20:31,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2137 transitions. [2024-11-09 19:20:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 19:20:31,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:31,919 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:31,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:20:31,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:31,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 611763273, now seen corresponding path program 1 times [2024-11-09 19:20:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426589677] [2024-11-09 19:20:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 19:20:32,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:32,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426589677] [2024-11-09 19:20:32,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426589677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:32,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:32,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:20:32,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275860906] [2024-11-09 19:20:32,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:32,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:20:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:32,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:20:32,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:20:32,256 INFO L87 Difference]: Start difference. First operand 1265 states and 2137 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:32,632 INFO L93 Difference]: Finished difference Result 2407 states and 4072 transitions. [2024-11-09 19:20:32,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 19:20:32,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 227 [2024-11-09 19:20:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:32,636 INFO L225 Difference]: With dead ends: 2407 [2024-11-09 19:20:32,636 INFO L226 Difference]: Without dead ends: 1265 [2024-11-09 19:20:32,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:20:32,638 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 182 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:32,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 23 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:20:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-09 19:20:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2024-11-09 19:20:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.6882911392405062) internal successors, (2134), 1264 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2134 transitions. [2024-11-09 19:20:32,656 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2134 transitions. Word has length 227 [2024-11-09 19:20:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:32,656 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2134 transitions. [2024-11-09 19:20:32,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2134 transitions. [2024-11-09 19:20:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 19:20:32,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:32,659 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:32,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:20:32,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:32,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1461702297, now seen corresponding path program 1 times [2024-11-09 19:20:32,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:32,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442351261] [2024-11-09 19:20:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:33,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:33,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442351261] [2024-11-09 19:20:33,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442351261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:33,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:33,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:20:33,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273863705] [2024-11-09 19:20:33,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:33,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:20:33,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:33,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:20:33,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:20:33,036 INFO L87 Difference]: Start difference. First operand 1265 states and 2134 transitions. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:33,677 INFO L93 Difference]: Finished difference Result 2444 states and 4103 transitions. [2024-11-09 19:20:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 19:20:33,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2024-11-09 19:20:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:33,682 INFO L225 Difference]: With dead ends: 2444 [2024-11-09 19:20:33,682 INFO L226 Difference]: Without dead ends: 1265 [2024-11-09 19:20:33,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:20:33,683 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 216 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:33,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 41 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-09 19:20:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2024-11-09 19:20:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.6835443037974684) internal successors, (2128), 1264 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2128 transitions. [2024-11-09 19:20:33,702 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2128 transitions. Word has length 241 [2024-11-09 19:20:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:33,702 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2128 transitions. [2024-11-09 19:20:33,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2128 transitions. [2024-11-09 19:20:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-09 19:20:33,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:33,705 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:33,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:20:33,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:33,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash -250076589, now seen corresponding path program 1 times [2024-11-09 19:20:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:33,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904390214] [2024-11-09 19:20:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:33,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 19:20:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904390214] [2024-11-09 19:20:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904390214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:34,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:20:34,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603816026] [2024-11-09 19:20:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:34,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:20:34,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:34,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:20:34,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:20:34,209 INFO L87 Difference]: Start difference. First operand 1265 states and 2128 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:34,694 INFO L93 Difference]: Finished difference Result 2407 states and 4055 transitions. [2024-11-09 19:20:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:20:34,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 277 [2024-11-09 19:20:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:34,699 INFO L225 Difference]: With dead ends: 2407 [2024-11-09 19:20:34,699 INFO L226 Difference]: Without dead ends: 1265 [2024-11-09 19:20:34,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:20:34,701 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 190 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:34,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 26 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-09 19:20:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2024-11-09 19:20:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.678006329113924) internal successors, (2121), 1264 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2121 transitions. [2024-11-09 19:20:34,717 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2121 transitions. Word has length 277 [2024-11-09 19:20:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:34,718 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2121 transitions. [2024-11-09 19:20:34,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2121 transitions. [2024-11-09 19:20:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-09 19:20:34,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:34,721 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:34,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:20:34,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:34,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:34,722 INFO L85 PathProgramCache]: Analyzing trace with hash 127560859, now seen corresponding path program 1 times [2024-11-09 19:20:34,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:34,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901817373] [2024-11-09 19:20:34,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:34,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 43 proven. 52 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 19:20:35,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:35,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901817373] [2024-11-09 19:20:35,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901817373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:20:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041747487] [2024-11-09 19:20:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:35,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:20:35,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:20:35,069 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-11-09 19:20:35,073 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-11-09 19:20:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:35,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:20:35,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:20:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 19:20:35,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:20:35,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041747487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:35,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:20:35,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 19:20:35,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376420646] [2024-11-09 19:20:35,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:35,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:35,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:35,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:35,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:20:35,334 INFO L87 Difference]: Start difference. First operand 1265 states and 2121 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:35,838 INFO L93 Difference]: Finished difference Result 2668 states and 4545 transitions. [2024-11-09 19:20:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:35,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 301 [2024-11-09 19:20:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:35,844 INFO L225 Difference]: With dead ends: 2668 [2024-11-09 19:20:35,844 INFO L226 Difference]: Without dead ends: 1545 [2024-11-09 19:20:35,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:20:35,846 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:35,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 302 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-09 19:20:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1405. [2024-11-09 19:20:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.6737891737891737) internal successors, (2350), 1404 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2350 transitions. [2024-11-09 19:20:35,871 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2350 transitions. Word has length 301 [2024-11-09 19:20:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:35,871 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2350 transitions. [2024-11-09 19:20:35,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2350 transitions. [2024-11-09 19:20:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-09 19:20:35,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:35,875 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:35,892 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-11-09 19:20:36,076 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,SelfDestructingSolverStorable9 [2024-11-09 19:20:36,076 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:36,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash -637552776, now seen corresponding path program 1 times [2024-11-09 19:20:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:36,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242214057] [2024-11-09 19:20:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:36,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-09 19:20:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242214057] [2024-11-09 19:20:36,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242214057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:36,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:36,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:36,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564976344] [2024-11-09 19:20:36,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:36,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:36,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:36,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:36,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:36,268 INFO L87 Difference]: Start difference. First operand 1405 states and 2350 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:36,781 INFO L93 Difference]: Finished difference Result 2805 states and 4707 transitions. [2024-11-09 19:20:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:36,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353 [2024-11-09 19:20:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:36,782 INFO L225 Difference]: With dead ends: 2805 [2024-11-09 19:20:36,782 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:20:36,784 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-11-09 19:20:36,785 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:36,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 297 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:20:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:20:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:20:36,786 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 353 [2024-11-09 19:20:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:36,787 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:20:36,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:20:36,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:20:36,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:20:36,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:20:36,793 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:36,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:20:36,942 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:20:36,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:20:36 BoogieIcfgContainer [2024-11-09 19:20:36,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:20:36,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:20:36,957 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:20:36,957 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:20:36,958 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:26" (3/4) ... [2024-11-09 19:20:36,960 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:20:36,977 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:20:36,980 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:20:36,981 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:20:36,982 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:20:37,121 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:20:37,122 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:20:37,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:20:37,123 INFO L158 Benchmark]: Toolchain (without parser) took 12062.27ms. Allocated memory was 201.3MB in the beginning and 377.5MB in the end (delta: 176.2MB). Free memory was 169.9MB in the beginning and 275.0MB in the end (delta: -105.1MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2024-11-09 19:20:37,123 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:20:37,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.38ms. Allocated memory is still 201.3MB. Free memory was 169.9MB in the beginning and 139.8MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 19:20:37,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.13ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 132.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 19:20:37,124 INFO L158 Benchmark]: Boogie Preprocessor took 82.99ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 123.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 19:20:37,124 INFO L158 Benchmark]: IcfgBuilder took 1045.86ms. Allocated memory is still 201.3MB. Free memory was 122.6MB in the beginning and 151.4MB in the end (delta: -28.9MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-11-09 19:20:37,124 INFO L158 Benchmark]: TraceAbstraction took 10235.89ms. Allocated memory was 201.3MB in the beginning and 377.5MB in the end (delta: 176.2MB). Free memory was 150.4MB in the beginning and 288.6MB in the end (delta: -138.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-11-09 19:20:37,125 INFO L158 Benchmark]: Witness Printer took 165.89ms. Allocated memory is still 377.5MB. Free memory was 288.6MB in the beginning and 275.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 19:20:37,126 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.38ms. Allocated memory is still 201.3MB. Free memory was 169.9MB in the beginning and 139.8MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.13ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 132.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.99ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 123.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1045.86ms. Allocated memory is still 201.3MB. Free memory was 122.6MB in the beginning and 151.4MB in the end (delta: -28.9MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10235.89ms. Allocated memory was 201.3MB in the beginning and 377.5MB in the end (delta: 176.2MB). Free memory was 150.4MB in the beginning and 288.6MB in the end (delta: -138.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 165.89ms. Allocated memory is still 377.5MB. Free memory was 288.6MB in the beginning and 275.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 161]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 209 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1863 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1863 mSDsluCounter, 1543 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 521 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6783 IncrementalHoareTripleChecker+Invalid, 7304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 521 mSolverCounterUnsat, 1440 mSDtfsCounter, 6783 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1405occurred in iteration=10, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 420 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2507 NumberOfCodeBlocks, 2507 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2495 ConstructedInterpolants, 0 QuantifiedInterpolants, 9773 SizeOfPredicates, 0 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1647/1699 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:20:37,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE