./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label32.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba084f2fa236db54388aca511060366bb6c01451f2201814c167025a30650a8b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:22:17,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:22:17,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:22:17,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:22:17,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:22:17,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:22:17,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:22:17,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:22:17,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:22:17,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:22:17,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:22:17,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:22:17,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:22:17,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:22:17,745 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:22:17,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:22:17,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:22:17,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:22:17,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:22:17,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:22:17,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:22:17,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:22:17,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:22:17,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:22:17,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:22:17,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:22:17,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:22:17,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:22:17,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:22:17,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:22:17,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:22:17,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:22:17,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:22:17,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:22:17,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:22:17,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:22:17,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:22:17,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:22:17,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:22:17,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:22:17,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:22:17,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:22:17,757 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 -> ba084f2fa236db54388aca511060366bb6c01451f2201814c167025a30650a8b [2024-11-18 10:22:18,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:22:18,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:22:18,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:22:18,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:22:18,055 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:22:18,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label32.c [2024-11-18 10:22:19,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:22:19,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:22:19,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label32.c [2024-11-18 10:22:19,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143aa8046/2aa2898dc04d4c7da2b1aabf36d30db3/FLAGce7a31b2e [2024-11-18 10:22:20,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143aa8046/2aa2898dc04d4c7da2b1aabf36d30db3 [2024-11-18 10:22:20,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:22:20,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:22:20,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:22:20,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:22:20,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:22:20,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:20,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6495ba31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20, skipping insertion in model container [2024-11-18 10:22:20,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:20,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:22:20,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label32.c[5857,5870] [2024-11-18 10:22:20,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:22:20,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:22:20,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label32.c[5857,5870] [2024-11-18 10:22:20,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:22:20,861 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:22:20,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20 WrapperNode [2024-11-18 10:22:20,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:22:20,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:22:20,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:22:20,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:22:20,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:20,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,007 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-18 10:22:21,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:22:21,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:22:21,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:22:21,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:22:21,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,147 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-18 10:22:21,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:22:21,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:22:21,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:22:21,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:22:21,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (1/1) ... [2024-11-18 10:22:21,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:22:21,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:22:21,316 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-18 10:22:21,320 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-18 10:22:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:22:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:22:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:22:21,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:22:21,450 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:22:21,452 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:22:23,008 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-18 10:22:23,008 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:22:23,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:22:23,035 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:22:23,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:23 BoogieIcfgContainer [2024-11-18 10:22:23,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:22:23,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:22:23,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:22:23,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:22:23,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:22:20" (1/3) ... [2024-11-18 10:22:23,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ec8e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:22:23, skipping insertion in model container [2024-11-18 10:22:23,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:20" (2/3) ... [2024-11-18 10:22:23,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ec8e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:22:23, skipping insertion in model container [2024-11-18 10:22:23,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:23" (3/3) ... [2024-11-18 10:22:23,047 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label32.c [2024-11-18 10:22:23,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:22:23,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:22:23,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:22:23,146 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;@56af268c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:22:23,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:22:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 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-18 10:22:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 10:22:23,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:23,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:23,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:23,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2102454322, now seen corresponding path program 1 times [2024-11-18 10:22:23,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814621034] [2024-11-18 10:22:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:23,590 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-18 10:22:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814621034] [2024-11-18 10:22:23,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814621034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:23,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:23,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:22:23,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687515822] [2024-11-18 10:22:23,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:23,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:23,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:23,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:23,621 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-18 10:22:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:24,716 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-18 10:22:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-11-18 10:22:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:24,731 INFO L225 Difference]: With dead ends: 761 [2024-11-18 10:22:24,731 INFO L226 Difference]: Without dead ends: 413 [2024-11-18 10:22:24,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:24,737 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 188 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:24,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-18 10:22:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-18 10:22:24,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-18 10:22:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 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-18 10:22:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-18 10:22:24,802 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 40 [2024-11-18 10:22:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:24,802 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-18 10:22:24,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-18 10:22:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-18 10:22:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 10:22:24,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:24,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:22:24,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:22:24,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:24,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash 590745834, now seen corresponding path program 1 times [2024-11-18 10:22:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:24,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344404554] [2024-11-18 10:22:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:22:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:25,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344404554] [2024-11-18 10:22:25,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344404554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:25,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:25,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:22:25,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056096595] [2024-11-18 10:22:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:25,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:25,062 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-18 10:22:25,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:25,886 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-18 10:22:25,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:25,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-18 10:22:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:25,891 INFO L225 Difference]: With dead ends: 1211 [2024-11-18 10:22:25,891 INFO L226 Difference]: Without dead ends: 800 [2024-11-18 10:22:25,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:25,893 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:25,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 10:22:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-18 10:22:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-18 10:22:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 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-18 10:22:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-18 10:22:25,928 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 108 [2024-11-18 10:22:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:25,928 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-18 10:22:25,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-18 10:22:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-18 10:22:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-18 10:22:25,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:25,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:22:25,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:22:25,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:25,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash 857011589, now seen corresponding path program 1 times [2024-11-18 10:22:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:25,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217232768] [2024-11-18 10:22:25,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:25,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:22:26,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217232768] [2024-11-18 10:22:26,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217232768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:26,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:26,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:22:26,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362038036] [2024-11-18 10:22:26,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:26,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:26,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:26,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:26,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:26,354 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-18 10:22:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:27,029 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-18 10:22:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:27,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-18 10:22:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:27,036 INFO L225 Difference]: With dead ends: 1945 [2024-11-18 10:22:27,036 INFO L226 Difference]: Without dead ends: 1158 [2024-11-18 10:22:27,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:27,039 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:27,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:22:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-18 10:22:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-18 10:22:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 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-18 10:22:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-18 10:22:27,071 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 110 [2024-11-18 10:22:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:27,072 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-18 10:22:27,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-18 10:22:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-18 10:22:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-18 10:22:27,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:27,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:22:27,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:22:27,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1721122937, now seen corresponding path program 1 times [2024-11-18 10:22:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:27,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575509935] [2024-11-18 10:22:27,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:22:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:27,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575509935] [2024-11-18 10:22:27,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575509935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:27,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:27,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642072203] [2024-11-18 10:22:27,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:27,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:27,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:27,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:27,401 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:22:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:28,164 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2024-11-18 10:22:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:28,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-11-18 10:22:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:28,170 INFO L225 Difference]: With dead ends: 2519 [2024-11-18 10:22:28,171 INFO L226 Difference]: Without dead ends: 1548 [2024-11-18 10:22:28,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:28,173 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 195 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:28,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:22:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-18 10:22:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-18 10:22:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 0 states have call successors, (0), 0 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-18 10:22:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2024-11-18 10:22:28,206 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 167 [2024-11-18 10:22:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:28,208 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2024-11-18 10:22:28,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:22:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2024-11-18 10:22:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-18 10:22:28,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:28,215 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:28,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:22:28,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:28,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1285696513, now seen corresponding path program 1 times [2024-11-18 10:22:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:28,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687040314] [2024-11-18 10:22:28,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:28,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-18 10:22:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687040314] [2024-11-18 10:22:28,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687040314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495491700] [2024-11-18 10:22:28,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:28,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:28,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:28,505 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-18 10:22:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:29,363 INFO L93 Difference]: Finished difference Result 3650 states and 4815 transitions. [2024-11-18 10:22:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:29,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 222 [2024-11-18 10:22:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:29,373 INFO L225 Difference]: With dead ends: 3650 [2024-11-18 10:22:29,373 INFO L226 Difference]: Without dead ends: 2291 [2024-11-18 10:22:29,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:29,377 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:29,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 10:22:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2024-11-18 10:22:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2098. [2024-11-18 10:22:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.2675250357653791) internal successors, (2658), 2097 states have internal predecessors, (2658), 0 states have call successors, (0), 0 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-18 10:22:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2658 transitions. [2024-11-18 10:22:29,418 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2658 transitions. Word has length 222 [2024-11-18 10:22:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:29,419 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 2658 transitions. [2024-11-18 10:22:29,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-18 10:22:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2658 transitions. [2024-11-18 10:22:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-18 10:22:29,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:29,424 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:29,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:22:29,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:29,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:29,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1823656750, now seen corresponding path program 1 times [2024-11-18 10:22:29,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:29,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155122159] [2024-11-18 10:22:29,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-18 10:22:29,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:29,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155122159] [2024-11-18 10:22:29,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155122159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:29,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:29,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:29,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790968469] [2024-11-18 10:22:29,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:29,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:29,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:29,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:29,649 INFO L87 Difference]: Start difference. First operand 2098 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-18 10:22:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:30,419 INFO L93 Difference]: Finished difference Result 5851 states and 7488 transitions. [2024-11-18 10:22:30,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 228 [2024-11-18 10:22:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:30,436 INFO L225 Difference]: With dead ends: 5851 [2024-11-18 10:22:30,437 INFO L226 Difference]: Without dead ends: 3755 [2024-11-18 10:22:30,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:30,445 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:30,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 144 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:22:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-11-18 10:22:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3755. [2024-11-18 10:22:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 1.245338305807139) internal successors, (4675), 3754 states have internal predecessors, (4675), 0 states have call successors, (0), 0 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-18 10:22:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 4675 transitions. [2024-11-18 10:22:30,514 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 4675 transitions. Word has length 228 [2024-11-18 10:22:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:30,518 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 4675 transitions. [2024-11-18 10:22:30,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-18 10:22:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 4675 transitions. [2024-11-18 10:22:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-18 10:22:30,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:30,523 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:30,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 10:22:30,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:30,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash -963193821, now seen corresponding path program 1 times [2024-11-18 10:22:30,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:30,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990917319] [2024-11-18 10:22:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:30,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-18 10:22:30,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:30,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990917319] [2024-11-18 10:22:30,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990917319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:30,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:30,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:30,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344519439] [2024-11-18 10:22:30,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:30,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:30,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:30,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:30,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:30,804 INFO L87 Difference]: Start difference. First operand 3755 states and 4675 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-18 10:22:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:31,661 INFO L93 Difference]: Finished difference Result 8622 states and 10849 transitions. [2024-11-18 10:22:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:31,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 259 [2024-11-18 10:22:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:31,679 INFO L225 Difference]: With dead ends: 8622 [2024-11-18 10:22:31,679 INFO L226 Difference]: Without dead ends: 4869 [2024-11-18 10:22:31,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:31,686 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:31,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 10:22:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2024-11-18 10:22:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4860. [2024-11-18 10:22:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4860 states, 4859 states have (on average 1.2251492076558963) internal successors, (5953), 4859 states have internal predecessors, (5953), 0 states have call successors, (0), 0 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-18 10:22:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 5953 transitions. [2024-11-18 10:22:31,773 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 5953 transitions. Word has length 259 [2024-11-18 10:22:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:31,773 INFO L471 AbstractCegarLoop]: Abstraction has 4860 states and 5953 transitions. [2024-11-18 10:22:31,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-18 10:22:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 5953 transitions. [2024-11-18 10:22:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-18 10:22:31,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:31,781 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:22:31,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:22:31,781 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:31,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:31,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1306009242, now seen corresponding path program 1 times [2024-11-18 10:22:31,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:31,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112445448] [2024-11-18 10:22:31,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:31,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-18 10:22:32,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112445448] [2024-11-18 10:22:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112445448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:32,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188876931] [2024-11-18 10:22:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:32,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:32,044 INFO L87 Difference]: Start difference. First operand 4860 states and 5953 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-18 10:22:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:32,783 INFO L93 Difference]: Finished difference Result 11005 states and 13678 transitions. [2024-11-18 10:22:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 305 [2024-11-18 10:22:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:32,803 INFO L225 Difference]: With dead ends: 11005 [2024-11-18 10:22:32,803 INFO L226 Difference]: Without dead ends: 6147 [2024-11-18 10:22:32,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:32,811 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 184 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:32,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 151 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:22:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2024-11-18 10:22:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 4853. [2024-11-18 10:22:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 4852 states have (on average 1.224855729596043) internal successors, (5943), 4852 states have internal predecessors, (5943), 0 states have call successors, (0), 0 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-18 10:22:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 5943 transitions. [2024-11-18 10:22:32,955 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 5943 transitions. Word has length 305 [2024-11-18 10:22:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:32,956 INFO L471 AbstractCegarLoop]: Abstraction has 4853 states and 5943 transitions. [2024-11-18 10:22:32,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-18 10:22:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 5943 transitions. [2024-11-18 10:22:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-18 10:22:32,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:32,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:32,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 10:22:32,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:32,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:32,966 INFO L85 PathProgramCache]: Analyzing trace with hash -114766810, now seen corresponding path program 1 times [2024-11-18 10:22:32,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:32,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447531186] [2024-11-18 10:22:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 143 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:22:33,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:33,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447531186] [2024-11-18 10:22:33,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447531186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:22:33,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81513693] [2024-11-18 10:22:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:33,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:22:33,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:22:33,677 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-18 10:22:33,679 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-18 10:22:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:33,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 10:22:33,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:22:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 143 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:22:35,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 10:22:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 143 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:22:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81513693] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 10:22:37,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 10:22:37,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-18 10:22:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699702530] [2024-11-18 10:22:37,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 10:22:37,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 10:22:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 10:22:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-18 10:22:37,796 INFO L87 Difference]: Start difference. First operand 4853 states and 5943 transitions. Second operand has 8 states, 8 states have (on average 73.25) internal successors, (586), 7 states have internal predecessors, (586), 0 states have call successors, (0), 0 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-18 10:22:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:40,399 INFO L93 Difference]: Finished difference Result 13800 states and 16837 transitions. [2024-11-18 10:22:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 10:22:40,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 73.25) internal successors, (586), 7 states have internal predecessors, (586), 0 states have call successors, (0), 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 324 [2024-11-18 10:22:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:40,425 INFO L225 Difference]: With dead ends: 13800 [2024-11-18 10:22:40,425 INFO L226 Difference]: Without dead ends: 8949 [2024-11-18 10:22:40,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-18 10:22:40,432 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 887 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:40,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 214 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-18 10:22:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8949 states. [2024-11-18 10:22:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8949 to 5035. [2024-11-18 10:22:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5034 states have (on average 1.22248708780294) internal successors, (6154), 5034 states have internal predecessors, (6154), 0 states have call successors, (0), 0 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-18 10:22:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6154 transitions. [2024-11-18 10:22:40,538 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6154 transitions. Word has length 324 [2024-11-18 10:22:40,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:40,538 INFO L471 AbstractCegarLoop]: Abstraction has 5035 states and 6154 transitions. [2024-11-18 10:22:40,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.25) internal successors, (586), 7 states have internal predecessors, (586), 0 states have call successors, (0), 0 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-18 10:22:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6154 transitions. [2024-11-18 10:22:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-18 10:22:40,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:40,548 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:40,565 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-18 10:22:40,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:22:40,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:40,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1735440730, now seen corresponding path program 1 times [2024-11-18 10:22:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:40,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525754156] [2024-11-18 10:22:40,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:22:41,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:41,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525754156] [2024-11-18 10:22:41,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525754156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:41,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:41,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 10:22:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550315395] [2024-11-18 10:22:41,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:41,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:22:41,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:41,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:22:41,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:22:41,172 INFO L87 Difference]: Start difference. First operand 5035 states and 6154 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 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-18 10:22:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:42,179 INFO L93 Difference]: Finished difference Result 13948 states and 17066 transitions. [2024-11-18 10:22:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:22:42,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 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 345 [2024-11-18 10:22:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:42,195 INFO L225 Difference]: With dead ends: 13948 [2024-11-18 10:22:42,196 INFO L226 Difference]: Without dead ends: 8915 [2024-11-18 10:22:42,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:22:42,203 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 249 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:42,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 65 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 10:22:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8915 states. [2024-11-18 10:22:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 7441. [2024-11-18 10:22:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7441 states, 7440 states have (on average 1.1923387096774194) internal successors, (8871), 7440 states have internal predecessors, (8871), 0 states have call successors, (0), 0 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-18 10:22:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 8871 transitions. [2024-11-18 10:22:42,339 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 8871 transitions. Word has length 345 [2024-11-18 10:22:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:42,340 INFO L471 AbstractCegarLoop]: Abstraction has 7441 states and 8871 transitions. [2024-11-18 10:22:42,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 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-18 10:22:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 8871 transitions. [2024-11-18 10:22:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-18 10:22:42,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:42,356 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:22:42,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 10:22:42,357 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:42,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:42,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1765974553, now seen corresponding path program 1 times [2024-11-18 10:22:42,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:42,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314142930] [2024-11-18 10:22:42,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:42,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-18 10:22:42,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:42,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314142930] [2024-11-18 10:22:42,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314142930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:42,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:42,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 10:22:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342935669] [2024-11-18 10:22:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:42,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:22:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:22:42,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:22:42,953 INFO L87 Difference]: Start difference. First operand 7441 states and 8871 transitions. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-18 10:22:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:43,985 INFO L93 Difference]: Finished difference Result 16170 states and 19194 transitions. [2024-11-18 10:22:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:22:43,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 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 419 [2024-11-18 10:22:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:44,002 INFO L225 Difference]: With dead ends: 16170 [2024-11-18 10:22:44,002 INFO L226 Difference]: Without dead ends: 8731 [2024-11-18 10:22:44,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:22:44,011 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 250 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:44,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 64 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-18 10:22:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8731 states. [2024-11-18 10:22:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8731 to 7441. [2024-11-18 10:22:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7441 states, 7440 states have (on average 1.1923387096774194) internal successors, (8871), 7440 states have internal predecessors, (8871), 0 states have call successors, (0), 0 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-18 10:22:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 8871 transitions. [2024-11-18 10:22:44,107 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 8871 transitions. Word has length 419 [2024-11-18 10:22:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:44,108 INFO L471 AbstractCegarLoop]: Abstraction has 7441 states and 8871 transitions. [2024-11-18 10:22:44,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-18 10:22:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 8871 transitions. [2024-11-18 10:22:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-18 10:22:44,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:44,122 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:44,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 10:22:44,123 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:44,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:44,123 INFO L85 PathProgramCache]: Analyzing trace with hash -361740358, now seen corresponding path program 1 times [2024-11-18 10:22:44,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:44,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358308612] [2024-11-18 10:22:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-18 10:22:44,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:44,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358308612] [2024-11-18 10:22:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358308612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621555519] [2024-11-18 10:22:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:44,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:44,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:44,470 INFO L87 Difference]: Start difference. First operand 7441 states and 8871 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-18 10:22:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:45,072 INFO L93 Difference]: Finished difference Result 15080 states and 17958 transitions. [2024-11-18 10:22:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:45,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 419 [2024-11-18 10:22:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:45,085 INFO L225 Difference]: With dead ends: 15080 [2024-11-18 10:22:45,085 INFO L226 Difference]: Without dead ends: 7641 [2024-11-18 10:22:45,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:45,093 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 107 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:45,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 329 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:22:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2024-11-18 10:22:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 7257. [2024-11-18 10:22:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7257 states, 7256 states have (on average 1.160005512679162) internal successors, (8417), 7256 states have internal predecessors, (8417), 0 states have call successors, (0), 0 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-18 10:22:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 8417 transitions. [2024-11-18 10:22:45,181 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 8417 transitions. Word has length 419 [2024-11-18 10:22:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:45,182 INFO L471 AbstractCegarLoop]: Abstraction has 7257 states and 8417 transitions. [2024-11-18 10:22:45,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-18 10:22:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 8417 transitions. [2024-11-18 10:22:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-18 10:22:45,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:45,193 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:45,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 10:22:45,193 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:45,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 123583838, now seen corresponding path program 1 times [2024-11-18 10:22:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772984895] [2024-11-18 10:22:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-18 10:22:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772984895] [2024-11-18 10:22:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772984895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:45,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:45,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:22:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399205956] [2024-11-18 10:22:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:45,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:45,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:45,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:45,550 INFO L87 Difference]: Start difference. First operand 7257 states and 8417 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-18 10:22:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:45,903 INFO L93 Difference]: Finished difference Result 14132 states and 16360 transitions. [2024-11-18 10:22:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:45,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 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 476 [2024-11-18 10:22:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:45,914 INFO L225 Difference]: With dead ends: 14132 [2024-11-18 10:22:45,914 INFO L226 Difference]: Without dead ends: 6877 [2024-11-18 10:22:45,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:45,922 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:45,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 37 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 10:22:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6877 states. [2024-11-18 10:22:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 6875. [2024-11-18 10:22:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6875 states, 6874 states have (on average 1.1544951993017165) internal successors, (7936), 6874 states have internal predecessors, (7936), 0 states have call successors, (0), 0 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-18 10:22:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 7936 transitions. [2024-11-18 10:22:46,003 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 7936 transitions. Word has length 476 [2024-11-18 10:22:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:46,004 INFO L471 AbstractCegarLoop]: Abstraction has 6875 states and 7936 transitions. [2024-11-18 10:22:46,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-18 10:22:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 7936 transitions. [2024-11-18 10:22:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-11-18 10:22:46,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:46,015 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:46,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 10:22:46,015 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:46,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1967892408, now seen corresponding path program 1 times [2024-11-18 10:22:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391940313] [2024-11-18 10:22:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-18 10:22:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:46,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391940313] [2024-11-18 10:22:46,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391940313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:46,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:46,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638163632] [2024-11-18 10:22:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:46,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:46,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:46,322 INFO L87 Difference]: Start difference. First operand 6875 states and 7936 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-18 10:22:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:46,849 INFO L93 Difference]: Finished difference Result 12621 states and 14535 transitions. [2024-11-18 10:22:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:46,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 492 [2024-11-18 10:22:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:46,857 INFO L225 Difference]: With dead ends: 12621 [2024-11-18 10:22:46,858 INFO L226 Difference]: Without dead ends: 5748 [2024-11-18 10:22:46,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:46,864 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:46,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 123 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:22:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5748 states. [2024-11-18 10:22:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 4828. [2024-11-18 10:22:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4828 states, 4827 states have (on average 1.1247151439817693) internal successors, (5429), 4827 states have internal predecessors, (5429), 0 states have call successors, (0), 0 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-18 10:22:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 5429 transitions. [2024-11-18 10:22:46,916 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 5429 transitions. Word has length 492 [2024-11-18 10:22:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:46,917 INFO L471 AbstractCegarLoop]: Abstraction has 4828 states and 5429 transitions. [2024-11-18 10:22:46,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-18 10:22:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 5429 transitions. [2024-11-18 10:22:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2024-11-18 10:22:46,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:46,927 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:46,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 10:22:46,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:46,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1851466277, now seen corresponding path program 1 times [2024-11-18 10:22:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:46,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504001017] [2024-11-18 10:22:46,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:46,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1238 backedges. 848 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-18 10:22:47,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:47,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504001017] [2024-11-18 10:22:47,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504001017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:47,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:47,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:47,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734069374] [2024-11-18 10:22:47,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:47,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:22:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:47,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:22:47,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:22:47,459 INFO L87 Difference]: Start difference. First operand 4828 states and 5429 transitions. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 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-18 10:22:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:48,531 INFO L93 Difference]: Finished difference Result 14635 states and 16469 transitions. [2024-11-18 10:22:48,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:22:48,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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 670 [2024-11-18 10:22:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:48,546 INFO L225 Difference]: With dead ends: 14635 [2024-11-18 10:22:48,547 INFO L226 Difference]: Without dead ends: 9809 [2024-11-18 10:22:48,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:22:48,554 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 197 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:48,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 60 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-18 10:22:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9809 states. [2024-11-18 10:22:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9809 to 9620. [2024-11-18 10:22:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9620 states, 9619 states have (on average 1.1143570017673354) internal successors, (10719), 9619 states have internal predecessors, (10719), 0 states have call successors, (0), 0 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-18 10:22:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 10719 transitions. [2024-11-18 10:22:48,675 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 10719 transitions. Word has length 670 [2024-11-18 10:22:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:48,676 INFO L471 AbstractCegarLoop]: Abstraction has 9620 states and 10719 transitions. [2024-11-18 10:22:48,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 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-18 10:22:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 10719 transitions. [2024-11-18 10:22:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2024-11-18 10:22:48,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:48,692 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:48,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 10:22:48,692 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:48,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1937440453, now seen corresponding path program 1 times [2024-11-18 10:22:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:48,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193031910] [2024-11-18 10:22:48,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 987 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-11-18 10:22:49,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:49,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193031910] [2024-11-18 10:22:49,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193031910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:49,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:49,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555593057] [2024-11-18 10:22:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:49,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:49,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:49,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:49,159 INFO L87 Difference]: Start difference. First operand 9620 states and 10719 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-18 10:22:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:49,739 INFO L93 Difference]: Finished difference Result 20341 states and 22719 transitions. [2024-11-18 10:22:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:49,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 748 [2024-11-18 10:22:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:49,753 INFO L225 Difference]: With dead ends: 20341 [2024-11-18 10:22:49,753 INFO L226 Difference]: Without dead ends: 10170 [2024-11-18 10:22:49,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:49,763 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 195 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:49,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 339 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:22:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10170 states. [2024-11-18 10:22:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10170 to 10170. [2024-11-18 10:22:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10170 states, 10169 states have (on average 1.0946995771462287) internal successors, (11132), 10169 states have internal predecessors, (11132), 0 states have call successors, (0), 0 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-18 10:22:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 11132 transitions. [2024-11-18 10:22:49,880 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 11132 transitions. Word has length 748 [2024-11-18 10:22:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:49,881 INFO L471 AbstractCegarLoop]: Abstraction has 10170 states and 11132 transitions. [2024-11-18 10:22:49,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-18 10:22:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 11132 transitions. [2024-11-18 10:22:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2024-11-18 10:22:49,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:22:49,898 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:49,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 10:22:49,898 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:22:49,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:22:49,899 INFO L85 PathProgramCache]: Analyzing trace with hash -707401101, now seen corresponding path program 1 times [2024-11-18 10:22:49,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:22:49,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051493578] [2024-11-18 10:22:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:22:49,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:22:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:22:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 1453 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-18 10:22:50,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:22:50,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051493578] [2024-11-18 10:22:50,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051493578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:22:50,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:22:50,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:22:50,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636218626] [2024-11-18 10:22:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:22:50,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:22:50,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:22:50,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:22:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:50,364 INFO L87 Difference]: Start difference. First operand 10170 states and 11132 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 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-18 10:22:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:22:50,945 INFO L93 Difference]: Finished difference Result 20887 states and 22855 transitions. [2024-11-18 10:22:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:22:50,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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 838 [2024-11-18 10:22:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:22:50,946 INFO L225 Difference]: With dead ends: 20887 [2024-11-18 10:22:50,946 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 10:22:50,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:22:50,957 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:22:50,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 320 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:22:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 10:22:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 10:22:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:22:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 10:22:50,958 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 838 [2024-11-18 10:22:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:22:50,959 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 10:22:50,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 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-18 10:22:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 10:22:50,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 10:22:50,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 10:22:50,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-18 10:22:50,968 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:22:50,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 10:22:53,382 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 10:22:53,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:22:53 BoogieIcfgContainer [2024-11-18 10:22:53,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 10:22:53,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 10:22:53,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 10:22:53,421 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 10:22:53,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:23" (3/4) ... [2024-11-18 10:22:53,425 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 10:22:53,446 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-18 10:22:53,448 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 10:22:53,449 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 10:22:53,450 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 10:22:53,643 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 10:22:53,644 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 10:22:53,644 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 10:22:53,644 INFO L158 Benchmark]: Toolchain (without parser) took 33508.38ms. Allocated memory was 159.4MB in the beginning and 717.2MB in the end (delta: 557.8MB). Free memory was 127.9MB in the beginning and 501.8MB in the end (delta: -373.9MB). Peak memory consumption was 185.5MB. Max. memory is 16.1GB. [2024-11-18 10:22:53,645 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 10:22:53,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 725.35ms. Allocated memory is still 159.4MB. Free memory was 127.4MB in the beginning and 80.2MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-18 10:22:53,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.54ms. Allocated memory is still 159.4MB. Free memory was 80.2MB in the beginning and 62.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 10:22:53,646 INFO L158 Benchmark]: Boogie Preprocessor took 269.90ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 62.8MB in the beginning and 160.9MB in the end (delta: -98.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-18 10:22:53,646 INFO L158 Benchmark]: RCFGBuilder took 1755.46ms. Allocated memory is still 209.7MB. Free memory was 160.9MB in the beginning and 90.2MB in the end (delta: 70.8MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. [2024-11-18 10:22:53,647 INFO L158 Benchmark]: TraceAbstraction took 30379.34ms. Allocated memory was 209.7MB in the beginning and 717.2MB in the end (delta: 507.5MB). Free memory was 89.1MB in the beginning and 518.6MB in the end (delta: -429.5MB). Peak memory consumption was 380.7MB. Max. memory is 16.1GB. [2024-11-18 10:22:53,647 INFO L158 Benchmark]: Witness Printer took 223.51ms. Allocated memory is still 717.2MB. Free memory was 518.6MB in the beginning and 501.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 10:22:53,651 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 725.35ms. Allocated memory is still 159.4MB. Free memory was 127.4MB in the beginning and 80.2MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.54ms. Allocated memory is still 159.4MB. Free memory was 80.2MB in the beginning and 62.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 269.90ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 62.8MB in the beginning and 160.9MB in the end (delta: -98.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1755.46ms. Allocated memory is still 209.7MB. Free memory was 160.9MB in the beginning and 90.2MB in the end (delta: 70.8MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30379.34ms. Allocated memory was 209.7MB in the beginning and 717.2MB in the end (delta: 507.5MB). Free memory was 89.1MB in the beginning and 518.6MB in the end (delta: -429.5MB). Peak memory consumption was 380.7MB. Max. memory is 16.1GB. * Witness Printer took 223.51ms. Allocated memory is still 717.2MB. Free memory was 518.6MB in the beginning and 501.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 136]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3509 SdHoareTripleChecker+Valid, 13.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3509 mSDsluCounter, 3483 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 455 mSDsCounter, 2113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12788 IncrementalHoareTripleChecker+Invalid, 14901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2113 mSolverCounterUnsat, 3028 mSDtfsCounter, 12788 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10170occurred in iteration=16, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 9684 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 6494 NumberOfCodeBlocks, 6494 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 6799 ConstructedInterpolants, 0 QuantifiedInterpolants, 20725 SizeOfPredicates, 8 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 8354/8513 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a25 <= 10) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || ((((a25 == 11) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599998)) && (a8 == 15))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 13) && (307 <= a23)) || ((a25 == 13) && (a3 == 1))) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 <= 10) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 <= 10) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312)) && (a8 == 15))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (a8 == 15))) || (((((((long long) a29 + 21) <= 0) && (a25 == 12)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 <= 10)) && (a29 <= 245)) && (a23 <= 138)) && (a8 == 15))) || ((((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-11-18 10:22:53,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE