./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/bitvector/byte_add-1.i -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 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 15:58:50,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 15:58:50,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 15:58:50,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 15:58:50,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 15:58:50,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 15:58:50,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 15:58:50,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 15:58:50,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 15:58:50,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 15:58:50,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 15:58:50,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 15:58:50,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 15:58:50,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 15:58:50,955 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 15:58:50,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 15:58:50,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 15:58:50,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 15:58:50,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 15:58:50,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 15:58:50,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 15:58:50,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 15:58:50,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 15:58:50,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 15:58:50,959 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 15:58:50,960 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 15:58:50,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 15:58:50,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 15:58:50,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 15:58:50,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 15:58:50,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 15:58:50,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 15:58:50,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:58:50,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 15:58:50,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 15:58:50,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 15:58:50,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 15:58:50,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 15:58:50,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 15:58:50,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 15:58:50,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 15:58:50,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 15:58:50,964 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 -> 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 [2024-11-11 15:58:51,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 15:58:51,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 15:58:51,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 15:58:51,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 15:58:51,247 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 15:58:51,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2024-11-11 15:58:52,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 15:58:52,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 15:58:52,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2024-11-11 15:58:52,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccfb1af8/e6abdcec14af4e0693fcf41e5c1c25e4/FLAGf201caeb6 [2024-11-11 15:58:52,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccfb1af8/e6abdcec14af4e0693fcf41e5c1c25e4 [2024-11-11 15:58:52,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 15:58:52,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 15:58:52,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 15:58:52,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 15:58:52,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 15:58:52,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:58:52" (1/1) ... [2024-11-11 15:58:52,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3764afc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:52, skipping insertion in model container [2024-11-11 15:58:52,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:58:52" (1/1) ... [2024-11-11 15:58:52,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 15:58:53,048 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/bitvector/byte_add-1.i[1166,1179] [2024-11-11 15:58:53,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:58:53,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 15:58:53,121 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/bitvector/byte_add-1.i[1166,1179] [2024-11-11 15:58:53,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:58:53,174 INFO L204 MainTranslator]: Completed translation [2024-11-11 15:58:53,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53 WrapperNode [2024-11-11 15:58:53,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 15:58:53,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 15:58:53,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 15:58:53,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 15:58:53,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,264 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 149 [2024-11-11 15:58:53,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 15:58:53,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 15:58:53,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 15:58:53,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 15:58:53,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,332 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-11 15:58:53,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 15:58:53,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 15:58:53,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 15:58:53,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 15:58:53,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (1/1) ... [2024-11-11 15:58:53,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:58:53,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:58:53,388 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-11 15:58:53,391 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-11 15:58:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 15:58:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 15:58:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 15:58:53,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 15:58:53,498 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 15:58:53,499 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 15:58:53,840 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-11 15:58:53,840 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 15:58:53,856 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 15:58:53,856 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 15:58:53,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:58:53 BoogieIcfgContainer [2024-11-11 15:58:53,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 15:58:53,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 15:58:53,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 15:58:53,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 15:58:53,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 03:58:52" (1/3) ... [2024-11-11 15:58:53,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef687ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:58:53, skipping insertion in model container [2024-11-11 15:58:53,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:53" (2/3) ... [2024-11-11 15:58:53,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef687ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:58:53, skipping insertion in model container [2024-11-11 15:58:53,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:58:53" (3/3) ... [2024-11-11 15:58:53,865 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2024-11-11 15:58:53,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 15:58:53,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 15:58:53,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 15:58:53,930 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;@32e393b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 15:58:53,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 15:58:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 50 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-11 15:58:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 15:58:53,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:53,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:53,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:53,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1425856197, now seen corresponding path program 1 times [2024-11-11 15:58:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367527499] [2024-11-11 15:58:53,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:53,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:54,151 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-11 15:58:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:54,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367527499] [2024-11-11 15:58:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367527499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:54,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:54,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 15:58:54,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406776100] [2024-11-11 15:58:54,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:54,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 15:58:54,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:54,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 15:58:54,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 15:58:54,186 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 50 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-11 15:58:54,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:54,206 INFO L93 Difference]: Finished difference Result 75 states and 122 transitions. [2024-11-11 15:58:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 15:58:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-11 15:58:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:54,216 INFO L225 Difference]: With dead ends: 75 [2024-11-11 15:58:54,216 INFO L226 Difference]: Without dead ends: 47 [2024-11-11 15:58:54,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 15:58:54,224 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:54,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:58:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-11 15:58:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-11 15:58:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 46 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-11 15:58:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2024-11-11 15:58:54,256 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 15 [2024-11-11 15:58:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:54,257 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 79 transitions. [2024-11-11 15:58:54,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-11 15:58:54,257 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 79 transitions. [2024-11-11 15:58:54,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 15:58:54,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:54,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:54,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 15:58:54,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:54,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash -518266215, now seen corresponding path program 1 times [2024-11-11 15:58:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:54,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200201713] [2024-11-11 15:58:54,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:54,450 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-11 15:58:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200201713] [2024-11-11 15:58:54,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200201713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:54,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:54,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:58:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687301739] [2024-11-11 15:58:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:54,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:58:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:54,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:58:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:58:54,454 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-11 15:58:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:54,608 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2024-11-11 15:58:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:58:54,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-11 15:58:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:54,610 INFO L225 Difference]: With dead ends: 107 [2024-11-11 15:58:54,611 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 15:58:54,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 15:58:54,614 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:54,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:58:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 15:58:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-11 15:58:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 67 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-11 15:58:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-11-11 15:58:54,627 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15 [2024-11-11 15:58:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:54,628 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-11-11 15:58:54,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-11 15:58:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-11-11 15:58:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 15:58:54,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:54,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:54,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 15:58:54,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:54,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash 458302340, now seen corresponding path program 1 times [2024-11-11 15:58:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:54,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075403418] [2024-11-11 15:58:54,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:58:54,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075403418] [2024-11-11 15:58:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075403418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:54,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:54,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:58:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826103299] [2024-11-11 15:58:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:54,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:54,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:54,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:58:54,835 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:55,076 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2024-11-11 15:58:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:58:55,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-11 15:58:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:55,079 INFO L225 Difference]: With dead ends: 164 [2024-11-11 15:58:55,079 INFO L226 Difference]: Without dead ends: 127 [2024-11-11 15:58:55,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:58:55,082 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:55,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:58:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-11 15:58:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2024-11-11 15:58:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 90 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-11 15:58:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2024-11-11 15:58:55,098 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21 [2024-11-11 15:58:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:55,098 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2024-11-11 15:58:55,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-11-11 15:58:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 15:58:55,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:55,102 INFO L218 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] [2024-11-11 15:58:55,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 15:58:55,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:55,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:55,103 INFO L85 PathProgramCache]: Analyzing trace with hash 93424243, now seen corresponding path program 1 times [2024-11-11 15:58:55,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:55,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160547581] [2024-11-11 15:58:55,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 15:58:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:55,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160547581] [2024-11-11 15:58:55,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160547581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:55,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:55,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:58:55,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852307613] [2024-11-11 15:58:55,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:55,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:55,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:55,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:55,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:58:55,275 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:55,431 INFO L93 Difference]: Finished difference Result 234 states and 354 transitions. [2024-11-11 15:58:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:58:55,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 15:58:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:55,434 INFO L225 Difference]: With dead ends: 234 [2024-11-11 15:58:55,434 INFO L226 Difference]: Without dead ends: 156 [2024-11-11 15:58:55,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:58:55,435 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 70 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:55,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 180 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:58:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-11 15:58:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2024-11-11 15:58:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.510204081632653) internal successors, (148), 98 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-11 15:58:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2024-11-11 15:58:55,452 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 27 [2024-11-11 15:58:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:55,452 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2024-11-11 15:58:55,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2024-11-11 15:58:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 15:58:55,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:55,453 INFO L218 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] [2024-11-11 15:58:55,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 15:58:55,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:55,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash -302937854, now seen corresponding path program 1 times [2024-11-11 15:58:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392228281] [2024-11-11 15:58:55,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 15:58:55,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392228281] [2024-11-11 15:58:55,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392228281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:55,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:55,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:58:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986072402] [2024-11-11 15:58:55,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:55,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:55,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:55,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:55,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:58:55,609 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-11 15:58:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:55,757 INFO L93 Difference]: Finished difference Result 255 states and 380 transitions. [2024-11-11 15:58:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:58:55,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 28 [2024-11-11 15:58:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:55,759 INFO L225 Difference]: With dead ends: 255 [2024-11-11 15:58:55,759 INFO L226 Difference]: Without dead ends: 176 [2024-11-11 15:58:55,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:58:55,761 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 74 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:55,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:58:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-11 15:58:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2024-11-11 15:58:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-11 15:58:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-11 15:58:55,770 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28 [2024-11-11 15:58:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:55,771 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-11 15:58:55,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-11 15:58:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-11 15:58:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 15:58:55,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:55,773 INFO L218 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] [2024-11-11 15:58:55,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 15:58:55,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:55,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1297586116, now seen corresponding path program 1 times [2024-11-11 15:58:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:55,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732971132] [2024-11-11 15:58:55,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:58:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:55,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732971132] [2024-11-11 15:58:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732971132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:58:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139113065] [2024-11-11 15:58:55,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:55,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:58:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:58:55,892 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-11 15:58:55,894 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-11 15:58:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:55,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 15:58:55,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:58:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 15:58:56,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:58:56,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139113065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:56,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:58:56,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-11 15:58:56,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814857481] [2024-11-11 15:58:56,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:56,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:56,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:56,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:56,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:58:56,044 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-11 15:58:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:56,251 INFO L93 Difference]: Finished difference Result 230 states and 363 transitions. [2024-11-11 15:58:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:58:56,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-11 15:58:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:56,256 INFO L225 Difference]: With dead ends: 230 [2024-11-11 15:58:56,257 INFO L226 Difference]: Without dead ends: 154 [2024-11-11 15:58:56,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:58:56,258 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:56,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:58:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-11 15:58:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2024-11-11 15:58:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 137 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-11 15:58:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-11 15:58:56,279 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 29 [2024-11-11 15:58:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:56,280 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-11 15:58:56,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-11 15:58:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-11 15:58:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 15:58:56,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:56,285 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 15:58:56,302 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-11 15:58:56,485 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,SelfDestructingSolverStorable5 [2024-11-11 15:58:56,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:56,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:56,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1927695377, now seen corresponding path program 1 times [2024-11-11 15:58:56,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921551283] [2024-11-11 15:58:56,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:56,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:58:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921551283] [2024-11-11 15:58:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921551283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:58:56,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325639512] [2024-11-11 15:58:56,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:56,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:58:56,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:58:56,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:58:56,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 15:58:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:56,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 15:58:56,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:58:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 15:58:56,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:58:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325639512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:56,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:58:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-11 15:58:56,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076752804] [2024-11-11 15:58:56,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:56,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:56,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:56,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:56,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:58:56,793 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-11 15:58:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:56,955 INFO L93 Difference]: Finished difference Result 288 states and 427 transitions. [2024-11-11 15:58:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:58:56,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 35 [2024-11-11 15:58:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:56,957 INFO L225 Difference]: With dead ends: 288 [2024-11-11 15:58:56,957 INFO L226 Difference]: Without dead ends: 183 [2024-11-11 15:58:56,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:58:56,960 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:56,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 151 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:58:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-11 15:58:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2024-11-11 15:58:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-11 15:58:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2024-11-11 15:58:56,978 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 35 [2024-11-11 15:58:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:56,978 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2024-11-11 15:58:56,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-11 15:58:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2024-11-11 15:58:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 15:58:56,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:56,980 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:56,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 15:58:57,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-11 15:58:57,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:57,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:57,186 INFO L85 PathProgramCache]: Analyzing trace with hash -977713378, now seen corresponding path program 1 times [2024-11-11 15:58:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:57,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642014819] [2024-11-11 15:58:57,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:57,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 15:58:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642014819] [2024-11-11 15:58:57,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642014819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:57,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:57,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 15:58:57,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997711489] [2024-11-11 15:58:57,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:57,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:58:57,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:58:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:58:57,317 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-11 15:58:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:57,545 INFO L93 Difference]: Finished difference Result 516 states and 714 transitions. [2024-11-11 15:58:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 15:58:57,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-11 15:58:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:57,547 INFO L225 Difference]: With dead ends: 516 [2024-11-11 15:58:57,547 INFO L226 Difference]: Without dead ends: 385 [2024-11-11 15:58:57,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:58:57,548 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 152 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:57,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 307 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:58:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-11 15:58:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 161. [2024-11-11 15:58:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-11 15:58:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2024-11-11 15:58:57,573 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 41 [2024-11-11 15:58:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:57,573 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2024-11-11 15:58:57,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-11 15:58:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2024-11-11 15:58:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 15:58:57,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:57,575 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 15:58:57,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:57,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash 915767303, now seen corresponding path program 1 times [2024-11-11 15:58:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680466616] [2024-11-11 15:58:57,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 15:58:57,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:57,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680466616] [2024-11-11 15:58:57,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680466616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:57,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:57,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 15:58:57,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310305479] [2024-11-11 15:58:57,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:57,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:58:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:57,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:58:57,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:58:57,736 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-11 15:58:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:57,965 INFO L93 Difference]: Finished difference Result 496 states and 689 transitions. [2024-11-11 15:58:57,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 15:58:57,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-11 15:58:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:57,967 INFO L225 Difference]: With dead ends: 496 [2024-11-11 15:58:57,967 INFO L226 Difference]: Without dead ends: 366 [2024-11-11 15:58:57,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:58:57,970 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 141 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:57,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 272 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:58:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-11 15:58:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 161. [2024-11-11 15:58:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-11 15:58:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2024-11-11 15:58:57,980 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 42 [2024-11-11 15:58:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:57,981 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2024-11-11 15:58:57,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-11 15:58:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2024-11-11 15:58:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 15:58:57,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:57,986 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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-11 15:58:57,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 15:58:57,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:57,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1504518361, now seen corresponding path program 1 times [2024-11-11 15:58:57,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:57,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991574648] [2024-11-11 15:58:57,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 15:58:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991574648] [2024-11-11 15:58:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991574648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:58,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 15:58:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312639286] [2024-11-11 15:58:58,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:58,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 15:58:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:58,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 15:58:58,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:58:58,140 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:58,501 INFO L93 Difference]: Finished difference Result 604 states and 837 transitions. [2024-11-11 15:58:58,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 15:58:58,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-11 15:58:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:58,503 INFO L225 Difference]: With dead ends: 604 [2024-11-11 15:58:58,503 INFO L226 Difference]: Without dead ends: 474 [2024-11-11 15:58:58,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 15:58:58,504 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 212 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:58,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 405 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 15:58:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-11 15:58:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 161. [2024-11-11 15:58:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-11 15:58:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2024-11-11 15:58:58,513 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 43 [2024-11-11 15:58:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:58,513 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2024-11-11 15:58:58,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2024-11-11 15:58:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 15:58:58,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:58,516 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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-11 15:58:58,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 15:58:58,517 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:58,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1946443433, now seen corresponding path program 1 times [2024-11-11 15:58:58,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:58,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732562641] [2024-11-11 15:58:58,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:58,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 15:58:58,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:58,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732562641] [2024-11-11 15:58:58,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732562641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:58,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:58,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 15:58:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477294160] [2024-11-11 15:58:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:58,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 15:58:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:58,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 15:58:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:58:58,683 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:59,111 INFO L93 Difference]: Finished difference Result 645 states and 888 transitions. [2024-11-11 15:58:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 15:58:59,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-11 15:58:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:59,115 INFO L225 Difference]: With dead ends: 645 [2024-11-11 15:58:59,115 INFO L226 Difference]: Without dead ends: 514 [2024-11-11 15:58:59,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-11 15:58:59,116 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 307 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:59,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 574 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 15:58:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-11 15:58:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 149. [2024-11-11 15:58:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.385135135135135) internal successors, (205), 148 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 205 transitions. [2024-11-11 15:58:59,126 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 205 transitions. Word has length 43 [2024-11-11 15:58:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:59,126 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 205 transitions. [2024-11-11 15:58:59,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2024-11-11 15:58:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 15:58:59,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:59,128 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 15:58:59,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 15:58:59,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:59,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:59,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1777229586, now seen corresponding path program 1 times [2024-11-11 15:58:59,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:59,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058800951] [2024-11-11 15:58:59,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:59,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 15:58:59,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:59,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058800951] [2024-11-11 15:58:59,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058800951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:59,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:59,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:58:59,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056955892] [2024-11-11 15:58:59,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:59,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:58:59,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:59,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:58:59,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:58:59,205 INFO L87 Difference]: Start difference. First operand 149 states and 205 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:59,222 INFO L93 Difference]: Finished difference Result 220 states and 298 transitions. [2024-11-11 15:58:59,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:58:59,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-11 15:58:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:59,223 INFO L225 Difference]: With dead ends: 220 [2024-11-11 15:58:59,223 INFO L226 Difference]: Without dead ends: 179 [2024-11-11 15:58:59,224 INFO L434 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-11 15:58:59,224 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:59,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:58:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-11 15:58:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-11 15:58:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.353932584269663) internal successors, (241), 178 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 241 transitions. [2024-11-11 15:58:59,234 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 241 transitions. Word has length 48 [2024-11-11 15:58:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:59,235 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 241 transitions. [2024-11-11 15:58:59,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 241 transitions. [2024-11-11 15:58:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 15:58:59,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:59,236 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 15:58:59,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 15:58:59,236 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:59,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1704843028, now seen corresponding path program 1 times [2024-11-11 15:58:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670055654] [2024-11-11 15:58:59,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 15:58:59,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:59,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670055654] [2024-11-11 15:58:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670055654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:58:59,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577085391] [2024-11-11 15:58:59,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:59,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:58:59,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:58:59,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:58:59,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 15:58:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:59,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 15:58:59,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:58:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:58:59,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:58:59,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577085391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:59,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:58:59,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-11-11 15:58:59,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834675752] [2024-11-11 15:58:59,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:59,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:59,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:58:59,500 INFO L87 Difference]: Start difference. First operand 179 states and 241 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:59,618 INFO L93 Difference]: Finished difference Result 526 states and 711 transitions. [2024-11-11 15:58:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:58:59,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-11 15:58:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:59,620 INFO L225 Difference]: With dead ends: 526 [2024-11-11 15:58:59,620 INFO L226 Difference]: Without dead ends: 333 [2024-11-11 15:58:59,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:58:59,621 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:59,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 184 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:58:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-11 15:58:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 304. [2024-11-11 15:58:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.33003300330033) internal successors, (403), 303 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-11 15:58:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 403 transitions. [2024-11-11 15:58:59,637 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 403 transitions. Word has length 48 [2024-11-11 15:58:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:59,637 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 403 transitions. [2024-11-11 15:58:59,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 403 transitions. [2024-11-11 15:58:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-11 15:58:59,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:59,638 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 15:58:59,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 15:58:59,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:58:59,839 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:59,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash -10817322, now seen corresponding path program 1 times [2024-11-11 15:58:59,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:59,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470565953] [2024-11-11 15:58:59,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:59,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 15:59:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:00,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470565953] [2024-11-11 15:59:00,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470565953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:00,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117012041] [2024-11-11 15:59:00,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:00,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:00,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:00,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:59:00,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 15:59:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:00,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 15:59:00,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:59:00,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117012041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:00,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:59:00,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-11-11 15:59:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051582268] [2024-11-11 15:59:00,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:00,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 15:59:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:00,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 15:59:00,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 15:59:00,191 INFO L87 Difference]: Start difference. First operand 304 states and 403 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:00,507 INFO L93 Difference]: Finished difference Result 981 states and 1333 transitions. [2024-11-11 15:59:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 15:59:00,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-11 15:59:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:00,512 INFO L225 Difference]: With dead ends: 981 [2024-11-11 15:59:00,513 INFO L226 Difference]: Without dead ends: 669 [2024-11-11 15:59:00,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-11 15:59:00,514 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 142 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:00,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 414 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 15:59:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-11 15:59:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 592. [2024-11-11 15:59:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.3096446700507614) internal successors, (774), 591 states have internal predecessors, (774), 0 states have call successors, (0), 0 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-11 15:59:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 774 transitions. [2024-11-11 15:59:00,543 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 774 transitions. Word has length 49 [2024-11-11 15:59:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:00,544 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 774 transitions. [2024-11-11 15:59:00,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 774 transitions. [2024-11-11 15:59:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 15:59:00,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:00,545 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 15:59:00,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 15:59:00,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:00,750 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:00,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1094176577, now seen corresponding path program 1 times [2024-11-11 15:59:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:00,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575350786] [2024-11-11 15:59:00,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 15:59:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575350786] [2024-11-11 15:59:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575350786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:00,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 15:59:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906027734] [2024-11-11 15:59:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:00,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 15:59:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 15:59:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:00,924 INFO L87 Difference]: Start difference. First operand 592 states and 774 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:01,370 INFO L93 Difference]: Finished difference Result 2209 states and 2869 transitions. [2024-11-11 15:59:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 15:59:01,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-11 15:59:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:01,376 INFO L225 Difference]: With dead ends: 2209 [2024-11-11 15:59:01,377 INFO L226 Difference]: Without dead ends: 1793 [2024-11-11 15:59:01,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-11 15:59:01,378 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 251 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:01,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 487 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 15:59:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2024-11-11 15:59:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 580. [2024-11-11 15:59:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.3160621761658031) internal successors, (762), 579 states have internal predecessors, (762), 0 states have call successors, (0), 0 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-11 15:59:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 762 transitions. [2024-11-11 15:59:01,412 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 762 transitions. Word has length 50 [2024-11-11 15:59:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:01,412 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 762 transitions. [2024-11-11 15:59:01,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 762 transitions. [2024-11-11 15:59:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 15:59:01,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:01,414 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 15:59:01,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 15:59:01,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:01,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash 214290304, now seen corresponding path program 1 times [2024-11-11 15:59:01,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:01,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551699306] [2024-11-11 15:59:01,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:01,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:59:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:01,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551699306] [2024-11-11 15:59:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551699306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:01,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 15:59:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213724955] [2024-11-11 15:59:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:01,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:59:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:59:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:01,550 INFO L87 Difference]: Start difference. First operand 580 states and 762 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:01,708 INFO L93 Difference]: Finished difference Result 1393 states and 1826 transitions. [2024-11-11 15:59:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:59:01,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-11 15:59:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:01,712 INFO L225 Difference]: With dead ends: 1393 [2024-11-11 15:59:01,712 INFO L226 Difference]: Without dead ends: 922 [2024-11-11 15:59:01,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:59:01,714 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 44 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:01,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 144 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-11 15:59:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 821. [2024-11-11 15:59:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 1.3060975609756098) internal successors, (1071), 820 states have internal predecessors, (1071), 0 states have call successors, (0), 0 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-11 15:59:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1071 transitions. [2024-11-11 15:59:01,753 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1071 transitions. Word has length 52 [2024-11-11 15:59:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:01,753 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1071 transitions. [2024-11-11 15:59:01,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1071 transitions. [2024-11-11 15:59:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 15:59:01,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:01,755 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 15:59:01,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 15:59:01,755 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:01,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 159713179, now seen corresponding path program 1 times [2024-11-11 15:59:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:01,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299890168] [2024-11-11 15:59:01,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 15:59:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299890168] [2024-11-11 15:59:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299890168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546334274] [2024-11-11 15:59:01,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:01,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:01,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:01,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:59:01,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 15:59:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:01,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 15:59:01,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:59:02,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:02,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546334274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:02,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:59:02,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-11-11 15:59:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161066013] [2024-11-11 15:59:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:02,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 15:59:02,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 15:59:02,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-11 15:59:02,044 INFO L87 Difference]: Start difference. First operand 821 states and 1071 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-11 15:59:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:02,421 INFO L93 Difference]: Finished difference Result 1841 states and 2416 transitions. [2024-11-11 15:59:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 15:59:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-11 15:59:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:02,426 INFO L225 Difference]: With dead ends: 1841 [2024-11-11 15:59:02,426 INFO L226 Difference]: Without dead ends: 1384 [2024-11-11 15:59:02,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-11 15:59:02,427 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 230 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:02,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 403 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 15:59:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-11 15:59:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1180. [2024-11-11 15:59:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 1.2994062765055132) internal successors, (1532), 1179 states have internal predecessors, (1532), 0 states have call successors, (0), 0 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-11 15:59:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1532 transitions. [2024-11-11 15:59:02,478 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1532 transitions. Word has length 53 [2024-11-11 15:59:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:02,478 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1532 transitions. [2024-11-11 15:59:02,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-11 15:59:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1532 transitions. [2024-11-11 15:59:02,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 15:59:02,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:02,480 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 15:59:02,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 15:59:02,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 15:59:02,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:02,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash 958599049, now seen corresponding path program 1 times [2024-11-11 15:59:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:02,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003882965] [2024-11-11 15:59:02,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 15:59:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:02,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003882965] [2024-11-11 15:59:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003882965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:02,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858459915] [2024-11-11 15:59:02,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:02,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:02,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:59:02,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 15:59:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:02,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 15:59:02,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:59:03,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:03,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858459915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:03,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:59:03,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-11-11 15:59:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730468072] [2024-11-11 15:59:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:03,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 15:59:03,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:03,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 15:59:03,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-11 15:59:03,008 INFO L87 Difference]: Start difference. First operand 1180 states and 1532 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-11 15:59:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:03,373 INFO L93 Difference]: Finished difference Result 2271 states and 2961 transitions. [2024-11-11 15:59:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 15:59:03,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-11 15:59:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:03,380 INFO L225 Difference]: With dead ends: 2271 [2024-11-11 15:59:03,380 INFO L226 Difference]: Without dead ends: 1836 [2024-11-11 15:59:03,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-11 15:59:03,382 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 145 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:03,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 417 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 15:59:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-11 15:59:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1562. [2024-11-11 15:59:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1561 states have (on average 1.295964125560538) internal successors, (2023), 1561 states have internal predecessors, (2023), 0 states have call successors, (0), 0 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-11 15:59:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2023 transitions. [2024-11-11 15:59:03,450 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2023 transitions. Word has length 54 [2024-11-11 15:59:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:03,450 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2023 transitions. [2024-11-11 15:59:03,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-11 15:59:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2023 transitions. [2024-11-11 15:59:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 15:59:03,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:03,452 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 15:59:03,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 15:59:03,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 15:59:03,656 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:03,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -969673653, now seen corresponding path program 1 times [2024-11-11 15:59:03,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:03,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525858583] [2024-11-11 15:59:03,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:03,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 15:59:05,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:05,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525858583] [2024-11-11 15:59:05,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525858583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:05,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815219227] [2024-11-11 15:59:05,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:05,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:05,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:05,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:59:05,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 15:59:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:06,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-11 15:59:06,029 INFO L279 TraceCheckSpWp]: Computing forward predicates...