./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/Problem01_label59.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 c7803525370200aabfab7aff9768b555209ce32125d445cdaf8def0c5a28cd1e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:27:28,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:27:28,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:27:28,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:27:29,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:27:29,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:27:29,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:27:29,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:27:29,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:27:29,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:27:29,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:27:29,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:27:29,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:27:29,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:27:29,029 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:27:29,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:27:29,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:27:29,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:27:29,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:27:29,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:27:29,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:27:29,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:27:29,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:27:29,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:27:29,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:27:29,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:27:29,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:27:29,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:27:29,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:27:29,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:27:29,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:27:29,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:27:29,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:29,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:27:29,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:27:29,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:27:29,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:27:29,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:27:29,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:27:29,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:27:29,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:27:29,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:27:29,045 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 -> c7803525370200aabfab7aff9768b555209ce32125d445cdaf8def0c5a28cd1e [2024-11-08 10:27:29,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:27:29,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:27:29,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:27:29,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:27:29,322 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:27:29,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2024-11-08 10:27:30,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:27:31,042 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:27:31,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2024-11-08 10:27:31,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27289811a/b1b881ff78e345aeb0f11dcf5a6a746d/FLAG6ce83eab9 [2024-11-08 10:27:31,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27289811a/b1b881ff78e345aeb0f11dcf5a6a746d [2024-11-08 10:27:31,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:27:31,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:27:31,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:31,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:27:31,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:27:31,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bda5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31, skipping insertion in model container [2024-11-08 10:27:31,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:27:31,509 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/Problem01_label59.c[16624,16637] [2024-11-08 10:27:31,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:31,604 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:27:31,693 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/Problem01_label59.c[16624,16637] [2024-11-08 10:27:31,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:31,741 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:27:31,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31 WrapperNode [2024-11-08 10:27:31,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:31,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:31,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:27:31,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:27:31,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,825 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-11-08 10:27:31,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:31,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:27:31,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:27:31,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:27:31,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,881 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-08 10:27:31,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:27:31,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:27:31,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:27:31,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:27:31,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (1/1) ... [2024-11-08 10:27:31,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:31,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:27:31,958 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-08 10:27:31,961 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-08 10:27:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:27:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:27:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:27:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:27:32,072 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:27:32,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:27:32,947 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 10:27:32,947 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:27:32,973 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:27:32,973 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:27:32,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:32 BoogieIcfgContainer [2024-11-08 10:27:32,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:27:32,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:27:32,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:27:32,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:27:32,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:27:31" (1/3) ... [2024-11-08 10:27:32,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77db5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:32, skipping insertion in model container [2024-11-08 10:27:32,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:31" (2/3) ... [2024-11-08 10:27:32,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77db5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:32, skipping insertion in model container [2024-11-08 10:27:32,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:32" (3/3) ... [2024-11-08 10:27:32,984 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label59.c [2024-11-08 10:27:33,000 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:27:33,000 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:27:33,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:27:33,075 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;@33e62e2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:27:33,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:27:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-08 10:27:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 10:27:33,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:33,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:33,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:33,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:33,101 INFO L85 PathProgramCache]: Analyzing trace with hash 806224438, now seen corresponding path program 1 times [2024-11-08 10:27:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:33,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271886708] [2024-11-08 10:27:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:33,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:33,641 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-08 10:27:33,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:33,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271886708] [2024-11-08 10:27:33,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271886708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:33,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:33,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36985861] [2024-11-08 10:27:33,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:33,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:33,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:33,704 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 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 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-08 10:27:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:34,415 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2024-11-08 10:27:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:34,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-08 10:27:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:34,432 INFO L225 Difference]: With dead ends: 528 [2024-11-08 10:27:34,433 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 10:27:34,436 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-08 10:27:34,439 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 99 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:34,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 51 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:27:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 10:27:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-08 10:27:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4566037735849056) internal successors, (386), 265 states have internal predecessors, (386), 0 states have call successors, (0), 0 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-08 10:27:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 386 transitions. [2024-11-08 10:27:34,489 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 386 transitions. Word has length 89 [2024-11-08 10:27:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:34,491 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 386 transitions. [2024-11-08 10:27:34,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-08 10:27:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 386 transitions. [2024-11-08 10:27:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 10:27:34,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:34,497 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:34,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:27:34,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:34,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash -802111485, now seen corresponding path program 1 times [2024-11-08 10:27:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170879878] [2024-11-08 10:27:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:34,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170879878] [2024-11-08 10:27:34,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170879878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:34,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:34,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:34,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305916219] [2024-11-08 10:27:34,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:34,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:34,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:34,643 INFO L87 Difference]: Start difference. First operand 266 states and 386 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-08 10:27:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:35,034 INFO L93 Difference]: Finished difference Result 792 states and 1153 transitions. [2024-11-08 10:27:35,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:35,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-08 10:27:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:35,037 INFO L225 Difference]: With dead ends: 792 [2024-11-08 10:27:35,037 INFO L226 Difference]: Without dead ends: 528 [2024-11-08 10:27:35,038 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-08 10:27:35,040 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:35,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:27:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-08 10:27:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2024-11-08 10:27:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3795066413662238) internal successors, (727), 527 states have internal predecessors, (727), 0 states have call successors, (0), 0 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-08 10:27:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 727 transitions. [2024-11-08 10:27:35,079 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 727 transitions. Word has length 95 [2024-11-08 10:27:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:35,079 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 727 transitions. [2024-11-08 10:27:35,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-08 10:27:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 727 transitions. [2024-11-08 10:27:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 10:27:35,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:35,084 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:35,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:27:35,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:35,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:35,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1182931709, now seen corresponding path program 1 times [2024-11-08 10:27:35,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:35,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683582213] [2024-11-08 10:27:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:35,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683582213] [2024-11-08 10:27:35,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683582213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:35,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:35,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:35,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543795960] [2024-11-08 10:27:35,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:35,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:35,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:35,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:35,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:35,248 INFO L87 Difference]: Start difference. First operand 528 states and 727 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-08 10:27:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:35,641 INFO L93 Difference]: Finished difference Result 1447 states and 1991 transitions. [2024-11-08 10:27:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:35,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-08 10:27:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:35,645 INFO L225 Difference]: With dead ends: 1447 [2024-11-08 10:27:35,645 INFO L226 Difference]: Without dead ends: 921 [2024-11-08 10:27:35,647 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-08 10:27:35,649 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 45 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:35,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 211 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:27:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-08 10:27:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 659. [2024-11-08 10:27:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3404255319148937) internal successors, (882), 658 states have internal predecessors, (882), 0 states have call successors, (0), 0 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-08 10:27:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 882 transitions. [2024-11-08 10:27:35,674 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 882 transitions. Word has length 96 [2024-11-08 10:27:35,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:35,675 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 882 transitions. [2024-11-08 10:27:35,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-08 10:27:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 882 transitions. [2024-11-08 10:27:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 10:27:35,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:35,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:35,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:27:35,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:35,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1354380786, now seen corresponding path program 1 times [2024-11-08 10:27:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:35,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072074331] [2024-11-08 10:27:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:35,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:35,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072074331] [2024-11-08 10:27:35,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072074331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:35,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251562702] [2024-11-08 10:27:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:35,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:35,863 INFO L87 Difference]: Start difference. First operand 659 states and 882 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:36,283 INFO L93 Difference]: Finished difference Result 1971 states and 2641 transitions. [2024-11-08 10:27:36,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:36,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-08 10:27:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:36,288 INFO L225 Difference]: With dead ends: 1971 [2024-11-08 10:27:36,288 INFO L226 Difference]: Without dead ends: 1183 [2024-11-08 10:27:36,289 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-08 10:27:36,290 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:36,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 54 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:27:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2024-11-08 10:27:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2024-11-08 10:27:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1742808798646363) internal successors, (1388), 1182 states have internal predecessors, (1388), 0 states have call successors, (0), 0 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-08 10:27:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1388 transitions. [2024-11-08 10:27:36,313 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1388 transitions. Word has length 102 [2024-11-08 10:27:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:36,314 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1388 transitions. [2024-11-08 10:27:36,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1388 transitions. [2024-11-08 10:27:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 10:27:36,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:36,317 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:36,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:27:36,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:36,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:36,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1552657016, now seen corresponding path program 1 times [2024-11-08 10:27:36,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:36,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653475389] [2024-11-08 10:27:36,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:36,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:27:36,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:36,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653475389] [2024-11-08 10:27:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653475389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:36,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:36,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759830734] [2024-11-08 10:27:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:36,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:36,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:36,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:36,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:36,456 INFO L87 Difference]: Start difference. First operand 1183 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:36,830 INFO L93 Difference]: Finished difference Result 2757 states and 3262 transitions. [2024-11-08 10:27:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:36,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-08 10:27:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:36,835 INFO L225 Difference]: With dead ends: 2757 [2024-11-08 10:27:36,836 INFO L226 Difference]: Without dead ends: 1707 [2024-11-08 10:27:36,837 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-08 10:27:36,840 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:36,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 39 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-08 10:27:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2024-11-08 10:27:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.175207756232687) internal successors, (1697), 1444 states have internal predecessors, (1697), 0 states have call successors, (0), 0 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-08 10:27:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1697 transitions. [2024-11-08 10:27:36,875 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1697 transitions. Word has length 115 [2024-11-08 10:27:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:36,876 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1697 transitions. [2024-11-08 10:27:36,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1697 transitions. [2024-11-08 10:27:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 10:27:36,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:36,880 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:36,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:27:36,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:36,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:36,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1456433713, now seen corresponding path program 1 times [2024-11-08 10:27:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:36,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771078067] [2024-11-08 10:27:36,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:27:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:37,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771078067] [2024-11-08 10:27:37,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771078067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:37,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009735524] [2024-11-08 10:27:37,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:37,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:37,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:37,057 INFO L87 Difference]: Start difference. First operand 1445 states and 1697 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:37,442 INFO L93 Difference]: Finished difference Result 2888 states and 3407 transitions. [2024-11-08 10:27:37,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:37,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-08 10:27:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:37,451 INFO L225 Difference]: With dead ends: 2888 [2024-11-08 10:27:37,452 INFO L226 Difference]: Without dead ends: 1576 [2024-11-08 10:27:37,454 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-08 10:27:37,457 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 119 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:37,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 54 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:27:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-08 10:27:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2024-11-08 10:27:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1657142857142857) internal successors, (1836), 1575 states have internal predecessors, (1836), 0 states have call successors, (0), 0 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-08 10:27:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1836 transitions. [2024-11-08 10:27:37,494 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1836 transitions. Word has length 117 [2024-11-08 10:27:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:37,497 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1836 transitions. [2024-11-08 10:27:37,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1836 transitions. [2024-11-08 10:27:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 10:27:37,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:37,501 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:37,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:27:37,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:37,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1305364217, now seen corresponding path program 1 times [2024-11-08 10:27:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:37,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222772308] [2024-11-08 10:27:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:27:37,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:37,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222772308] [2024-11-08 10:27:37,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222772308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:37,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:37,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:37,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449776066] [2024-11-08 10:27:37,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:37,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:27:37,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:37,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:27:37,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:27:37,715 INFO L87 Difference]: Start difference. First operand 1576 states and 1836 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 10:27:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:38,325 INFO L93 Difference]: Finished difference Result 3281 states and 3836 transitions. [2024-11-08 10:27:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:27:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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-08 10:27:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:38,332 INFO L225 Difference]: With dead ends: 3281 [2024-11-08 10:27:38,332 INFO L226 Difference]: Without dead ends: 1838 [2024-11-08 10:27:38,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:27:38,335 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 251 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:38,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 58 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:27:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-08 10:27:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2024-11-08 10:27:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1547479484173506) internal successors, (1970), 1706 states have internal predecessors, (1970), 0 states have call successors, (0), 0 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-08 10:27:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1970 transitions. [2024-11-08 10:27:38,367 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1970 transitions. Word has length 121 [2024-11-08 10:27:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:38,367 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1970 transitions. [2024-11-08 10:27:38,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 10:27:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1970 transitions. [2024-11-08 10:27:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 10:27:38,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:38,371 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:38,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:27:38,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:38,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash -810309254, now seen corresponding path program 1 times [2024-11-08 10:27:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:38,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525812563] [2024-11-08 10:27:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:38,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:38,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525812563] [2024-11-08 10:27:38,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525812563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:38,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:38,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:38,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625995246] [2024-11-08 10:27:38,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:38,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:27:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:38,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:27:38,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:27:38,575 INFO L87 Difference]: Start difference. First operand 1707 states and 1970 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 10:27:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:39,173 INFO L93 Difference]: Finished difference Result 3674 states and 4270 transitions. [2024-11-08 10:27:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:27:39,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-11-08 10:27:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:39,181 INFO L225 Difference]: With dead ends: 3674 [2024-11-08 10:27:39,181 INFO L226 Difference]: Without dead ends: 1969 [2024-11-08 10:27:39,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:27:39,184 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 219 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:39,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 56 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:27:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-11-08 10:27:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2024-11-08 10:27:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1322808927599346) internal successors, (2080), 1837 states have internal predecessors, (2080), 0 states have call successors, (0), 0 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-08 10:27:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2080 transitions. [2024-11-08 10:27:39,217 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2080 transitions. Word has length 139 [2024-11-08 10:27:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:39,218 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2080 transitions. [2024-11-08 10:27:39,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 10:27:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2080 transitions. [2024-11-08 10:27:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 10:27:39,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:39,222 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, 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] [2024-11-08 10:27:39,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:27:39,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:39,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:39,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1246749755, now seen corresponding path program 1 times [2024-11-08 10:27:39,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:39,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569352428] [2024-11-08 10:27:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:39,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569352428] [2024-11-08 10:27:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569352428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:39,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:39,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:39,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598379314] [2024-11-08 10:27:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:39,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:39,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:39,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:39,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:39,404 INFO L87 Difference]: Start difference. First operand 1838 states and 2080 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-08 10:27:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:39,777 INFO L93 Difference]: Finished difference Result 3674 states and 4176 transitions. [2024-11-08 10:27:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:39,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-11-08 10:27:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:39,787 INFO L225 Difference]: With dead ends: 3674 [2024-11-08 10:27:39,787 INFO L226 Difference]: Without dead ends: 1969 [2024-11-08 10:27:39,790 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-08 10:27:39,791 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:39,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 158 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-11-08 10:27:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2024-11-08 10:27:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.0985302123026675) internal successors, (2018), 1837 states have internal predecessors, (2018), 0 states have call successors, (0), 0 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-08 10:27:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2018 transitions. [2024-11-08 10:27:39,821 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2018 transitions. Word has length 148 [2024-11-08 10:27:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:39,821 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2018 transitions. [2024-11-08 10:27:39,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-08 10:27:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2018 transitions. [2024-11-08 10:27:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 10:27:39,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:39,825 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:39,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:27:39,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:39,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash 691080292, now seen corresponding path program 1 times [2024-11-08 10:27:39,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:39,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172724809] [2024-11-08 10:27:39,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:39,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 10:27:39,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172724809] [2024-11-08 10:27:39,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172724809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:39,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:39,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271831498] [2024-11-08 10:27:39,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:39,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:39,942 INFO L87 Difference]: Start difference. First operand 1838 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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-08 10:27:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:40,269 INFO L93 Difference]: Finished difference Result 3674 states and 4047 transitions. [2024-11-08 10:27:40,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:40,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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 161 [2024-11-08 10:27:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:40,276 INFO L225 Difference]: With dead ends: 3674 [2024-11-08 10:27:40,276 INFO L226 Difference]: Without dead ends: 1969 [2024-11-08 10:27:40,279 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-08 10:27:40,280 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 55 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:40,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 163 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-11-08 10:27:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2024-11-08 10:27:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.080021774632553) internal successors, (1984), 1837 states have internal predecessors, (1984), 0 states have call successors, (0), 0 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-08 10:27:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1984 transitions. [2024-11-08 10:27:40,315 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1984 transitions. Word has length 161 [2024-11-08 10:27:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:40,315 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 1984 transitions. [2024-11-08 10:27:40,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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-08 10:27:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1984 transitions. [2024-11-08 10:27:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 10:27:40,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:40,319 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 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, 3, 3, 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-08 10:27:40,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:27:40,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:40,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1702778154, now seen corresponding path program 1 times [2024-11-08 10:27:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078690445] [2024-11-08 10:27:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 120 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 10:27:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078690445] [2024-11-08 10:27:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078690445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:27:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260390498] [2024-11-08 10:27:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:40,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:27:40,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:27:40,607 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-08 10:27:40,608 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-08 10:27:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:40,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:27:40,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:27:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-08 10:27:40,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:27:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260390498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:40,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:27:40,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 10:27:40,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199188344] [2024-11-08 10:27:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:40,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:40,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:27:40,880 INFO L87 Difference]: Start difference. First operand 1838 states and 1984 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 10:27:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:41,240 INFO L93 Difference]: Finished difference Result 3934 states and 4271 transitions. [2024-11-08 10:27:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:41,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 190 [2024-11-08 10:27:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:41,242 INFO L225 Difference]: With dead ends: 3934 [2024-11-08 10:27:41,242 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:27:41,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:27:41,245 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 47 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:41,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 174 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:27:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:27:41,246 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-08 10:27:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:27:41,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2024-11-08 10:27:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:41,247 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:27:41,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 10:27:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:27:41,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:27:41,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:27:41,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:27:41,451 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,SelfDestructingSolverStorable10 [2024-11-08 10:27:41,454 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:41,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:27:41,674 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:27:41,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:27:41 BoogieIcfgContainer [2024-11-08 10:27:41,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:27:41,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:27:41,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:27:41,695 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:27:41,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:32" (3/4) ... [2024-11-08 10:27:41,698 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:27:41,719 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:27:41,720 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:27:41,721 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:27:41,722 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:27:41,875 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:27:41,876 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:27:41,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:27:41,877 INFO L158 Benchmark]: Toolchain (without parser) took 10798.47ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 95.3MB in the beginning and 203.9MB in the end (delta: -108.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,878 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:27:41,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.23ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 124.1MB in the end (delta: -29.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.46ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 117.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,879 INFO L158 Benchmark]: Boogie Preprocessor took 92.61ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 112.2MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,879 INFO L158 Benchmark]: RCFGBuilder took 1054.09ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 113.9MB in the end (delta: -1.6MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,880 INFO L158 Benchmark]: TraceAbstraction took 8717.55ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 113.1MB in the beginning and 216.6MB in the end (delta: -103.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,880 INFO L158 Benchmark]: Witness Printer took 182.18ms. Allocated memory is still 302.0MB. Free memory was 216.6MB in the beginning and 203.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,881 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.21ms. Allocated memory is still 167.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.23ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 124.1MB in the end (delta: -29.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.46ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 117.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.61ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 112.2MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1054.09ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 113.9MB in the end (delta: -1.6MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8717.55ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 113.1MB in the beginning and 216.6MB in the end (delta: -103.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Witness Printer took 182.18ms. Allocated memory is still 302.0MB. Free memory was 216.6MB in the beginning and 203.9MB in the end (delta: 12.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: 453]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1291 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1291 mSDsluCounter, 1054 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 567 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4206 IncrementalHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 567 mSolverCounterUnsat, 982 mSDtfsCounter, 4206 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1551 ConstructedInterpolants, 0 QuantifiedInterpolants, 3388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 701/712 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: 593]: Loop Invariant Derived loop invariant: (((((((((((a8 <= 13) && (a7 != 1)) || (((((a7 != 1) && (a8 <= 14)) && (a21 == 1)) && (a17 == 1)) && (a16 <= 5))) || (((a20 != 1) && (a21 == 1)) && (a17 == 1))) || ((a8 <= 13) && (a17 == 0))) || ((a8 <= 13) && (a17 == 1))) || ((a20 != 1) && (a17 == 0))) || ((((5 == a16) && (a7 != 1)) && (a21 == 1)) && (a17 == 1))) || (((5 <= a16) && (a8 <= 14)) && (a17 == 0))) || ((a7 != 1) && (a17 == 0))) || ((a20 != 1) && (a8 <= 13))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:27:41,909 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