./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label17.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 e8f177d03f4f60423a896dbe491efae793eb2062a8d25f45f05aed5ed36051f8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:58:43,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:58:43,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:58:43,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:58:43,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:58:43,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:58:43,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:58:43,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:58:43,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:58:43,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:58:43,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:58:43,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:58:43,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:58:43,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:58:43,930 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:58:43,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:58:43,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:58:43,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:58:43,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:58:43,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:58:43,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:58:43,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:58:43,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:58:43,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:58:43,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:58:43,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:58:43,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:58:43,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:58:43,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:58:43,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:58:43,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:58:43,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:58:43,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:58:43,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:58:43,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:58:43,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:58:43,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:58:43,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:58:43,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:58:43,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:58:43,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:58:43,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:58:43,937 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 -> e8f177d03f4f60423a896dbe491efae793eb2062a8d25f45f05aed5ed36051f8 [2024-11-11 16:58:44,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:58:44,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:58:44,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:58:44,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:58:44,152 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:58:44,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label17.c [2024-11-11 16:58:45,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:58:45,753 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:58:45,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label17.c [2024-11-11 16:58:45,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5be9a02/6cfd44eee30b4252914a905e00075d85/FLAGdea9405ea [2024-11-11 16:58:46,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5be9a02/6cfd44eee30b4252914a905e00075d85 [2024-11-11 16:58:46,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:58:46,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:58:46,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:58:46,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:58:46,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:58:46,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:58:46" (1/1) ... [2024-11-11 16:58:46,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ce3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:46, skipping insertion in model container [2024-11-11 16:58:46,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:58:46" (1/1) ... [2024-11-11 16:58:46,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:58:46,324 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/Problem13_label17.c[4917,4930] [2024-11-11 16:58:46,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:58:46,918 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:58:46,935 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/Problem13_label17.c[4917,4930] [2024-11-11 16:58:47,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:58:47,314 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:58:47,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47 WrapperNode [2024-11-11 16:58:47,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:58:47,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:58:47,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:58:47,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:58:47,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:47,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:47,778 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-11 16:58:47,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:58:47,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:58:47,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:58:47,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:58:47,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:47,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:47,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:48,044 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:58:48,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:48,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:48,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:48,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:48,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:48,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:48,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:58:48,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:58:48,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:58:48,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:58:48,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (1/1) ... [2024-11-11 16:58:48,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:58:48,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:58:48,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:58:48,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:58:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:58:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:58:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:58:48,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:58:48,457 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:58:48,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:58:52,699 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-11 16:58:52,699 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:58:52,730 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:58:52,730 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:58:52,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:58:52 BoogieIcfgContainer [2024-11-11 16:58:52,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:58:52,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:58:52,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:58:52,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:58:52,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:58:46" (1/3) ... [2024-11-11 16:58:52,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b262a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:58:52, skipping insertion in model container [2024-11-11 16:58:52,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:58:47" (2/3) ... [2024-11-11 16:58:52,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b262a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:58:52, skipping insertion in model container [2024-11-11 16:58:52,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:58:52" (3/3) ... [2024-11-11 16:58:52,738 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label17.c [2024-11-11 16:58:52,750 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:58:52,751 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:58:52,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:58:52,828 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;@6231e71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:58:52,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:58:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:58:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 16:58:52,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:58:52,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:58:52,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:58:52,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:58:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2113343065, now seen corresponding path program 1 times [2024-11-11 16:58:52,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:58:52,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49185801] [2024-11-11 16:58:52,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:58:52,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:58:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:58:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:58:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:58:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49185801] [2024-11-11 16:58:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49185801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:58:53,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:58:53,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:58:53,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246406158] [2024-11-11 16:58:53,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:58:53,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:58:53,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:58:53,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:58:53,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:58:53,171 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:58:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:58:56,574 INFO L93 Difference]: Finished difference Result 3035 states and 5643 transitions. [2024-11-11 16:58:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:58:56,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-11 16:58:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:58:56,596 INFO L225 Difference]: With dead ends: 3035 [2024-11-11 16:58:56,596 INFO L226 Difference]: Without dead ends: 1873 [2024-11-11 16:58:56,605 INFO L434 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-11 16:58:56,607 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 872 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:58:56,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 16:58:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-11-11 16:58:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2024-11-11 16:58:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:58:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2024-11-11 16:58:56,713 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 33 [2024-11-11 16:58:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:58:56,714 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2024-11-11 16:58:56,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:58:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2024-11-11 16:58:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 16:58:56,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:58:56,718 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:58:56,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:58:56,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:58:56,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:58:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1756463341, now seen corresponding path program 1 times [2024-11-11 16:58:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:58:56,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499859687] [2024-11-11 16:58:56,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:58:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:58:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:58:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:58:56,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:58:56,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499859687] [2024-11-11 16:58:56,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499859687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:58:56,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:58:56,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:58:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986566001] [2024-11-11 16:58:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:58:56,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:58:56,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:58:56,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:58:56,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:58:56,921 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:58:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:58:59,888 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2024-11-11 16:58:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:58:59,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-11 16:58:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:58:59,899 INFO L225 Difference]: With dead ends: 5317 [2024-11-11 16:58:59,899 INFO L226 Difference]: Without dead ends: 3460 [2024-11-11 16:58:59,902 INFO L434 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-11 16:58:59,902 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:58:59,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 16:58:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-11-11 16:58:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2024-11-11 16:58:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:58:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2024-11-11 16:58:59,954 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 105 [2024-11-11 16:58:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:58:59,955 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2024-11-11 16:58:59,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:58:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2024-11-11 16:58:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 16:58:59,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:58:59,957 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:58:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:58:59,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:58:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:58:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash -506428778, now seen corresponding path program 1 times [2024-11-11 16:58:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:58:59,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019427436] [2024-11-11 16:58:59,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:58:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:58:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:59:00,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:00,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019427436] [2024-11-11 16:59:00,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019427436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:00,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:00,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:59:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353152078] [2024-11-11 16:59:00,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:00,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:59:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:59:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:59:00,327 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:03,861 INFO L93 Difference]: Finished difference Result 10870 states and 14768 transitions. [2024-11-11 16:59:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:59:03,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-11 16:59:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:03,881 INFO L225 Difference]: With dead ends: 10870 [2024-11-11 16:59:03,881 INFO L226 Difference]: Without dead ends: 7413 [2024-11-11 16:59:03,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:59:03,888 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 2582 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 4117 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 4948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 4117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:03,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 1003 Invalid, 4948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 4117 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-11 16:59:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7413 states. [2024-11-11 16:59:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7413 to 7412. [2024-11-11 16:59:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7412 states, 7411 states have (on average 1.2698691134799622) internal successors, (9411), 7411 states have internal predecessors, (9411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 9411 transitions. [2024-11-11 16:59:03,987 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 9411 transitions. Word has length 119 [2024-11-11 16:59:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:03,988 INFO L471 AbstractCegarLoop]: Abstraction has 7412 states and 9411 transitions. [2024-11-11 16:59:03,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 9411 transitions. [2024-11-11 16:59:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-11 16:59:03,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:03,995 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 16:59:03,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:59:03,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:03,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:03,996 INFO L85 PathProgramCache]: Analyzing trace with hash 853748547, now seen corresponding path program 1 times [2024-11-11 16:59:03,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:03,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086820572] [2024-11-11 16:59:03,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 16:59:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086820572] [2024-11-11 16:59:04,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086820572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:04,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:04,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:59:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032577551] [2024-11-11 16:59:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:04,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:59:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:59:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:04,177 INFO L87 Difference]: Start difference. First operand 7412 states and 9411 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:06,793 INFO L93 Difference]: Finished difference Result 20355 states and 26251 transitions. [2024-11-11 16:59:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:59:06,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 200 [2024-11-11 16:59:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:06,824 INFO L225 Difference]: With dead ends: 20355 [2024-11-11 16:59:06,824 INFO L226 Difference]: Without dead ends: 13732 [2024-11-11 16:59:06,832 INFO L434 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-11 16:59:06,833 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 888 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:06,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 978 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [748 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 16:59:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2024-11-11 16:59:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 12937. [2024-11-11 16:59:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12937 states, 12936 states have (on average 1.215213358070501) internal successors, (15720), 12936 states have internal predecessors, (15720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12937 states to 12937 states and 15720 transitions. [2024-11-11 16:59:07,002 INFO L78 Accepts]: Start accepts. Automaton has 12937 states and 15720 transitions. Word has length 200 [2024-11-11 16:59:07,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:07,002 INFO L471 AbstractCegarLoop]: Abstraction has 12937 states and 15720 transitions. [2024-11-11 16:59:07,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 12937 states and 15720 transitions. [2024-11-11 16:59:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-11 16:59:07,006 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:07,007 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:59:07,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:59:07,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:07,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -269504365, now seen corresponding path program 1 times [2024-11-11 16:59:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187852918] [2024-11-11 16:59:07,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:59:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:07,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187852918] [2024-11-11 16:59:07,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187852918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:07,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:59:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693092509] [2024-11-11 16:59:07,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:07,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:59:07,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:59:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:07,167 INFO L87 Difference]: Start difference. First operand 12937 states and 15720 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:10,327 INFO L93 Difference]: Finished difference Result 31392 states and 39119 transitions. [2024-11-11 16:59:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:59:10,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-11-11 16:59:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:10,363 INFO L225 Difference]: With dead ends: 31392 [2024-11-11 16:59:10,363 INFO L226 Difference]: Without dead ends: 19244 [2024-11-11 16:59:10,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:10,376 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 858 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:10,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 926 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 16:59:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states. [2024-11-11 16:59:10,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 18447. [2024-11-11 16:59:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18447 states, 18446 states have (on average 1.2024287108316165) internal successors, (22180), 18446 states have internal predecessors, (22180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 22180 transitions. [2024-11-11 16:59:10,631 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 22180 transitions. Word has length 232 [2024-11-11 16:59:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:10,632 INFO L471 AbstractCegarLoop]: Abstraction has 18447 states and 22180 transitions. [2024-11-11 16:59:10,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 22180 transitions. [2024-11-11 16:59:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-11 16:59:10,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:10,637 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:59:10,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:59:10,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1622019590, now seen corresponding path program 1 times [2024-11-11 16:59:10,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:10,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912510612] [2024-11-11 16:59:10,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-11 16:59:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:11,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912510612] [2024-11-11 16:59:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912510612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:59:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793416316] [2024-11-11 16:59:11,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:11,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:59:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:11,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:59:11,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:59:11,199 INFO L87 Difference]: Start difference. First operand 18447 states and 22180 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:15,478 INFO L93 Difference]: Finished difference Result 59761 states and 73268 transitions. [2024-11-11 16:59:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:59:15,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2024-11-11 16:59:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:15,529 INFO L225 Difference]: With dead ends: 59761 [2024-11-11 16:59:15,529 INFO L226 Difference]: Without dead ends: 42103 [2024-11-11 16:59:15,546 INFO L434 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-11 16:59:15,548 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 1791 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 4633 mSolverCounterSat, 1179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1791 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 5812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1179 IncrementalHoareTripleChecker+Valid, 4633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:15,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1791 Valid, 771 Invalid, 5812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1179 Valid, 4633 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-11 16:59:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42103 states. [2024-11-11 16:59:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42103 to 42101. [2024-11-11 16:59:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42101 states, 42100 states have (on average 1.186959619952494) internal successors, (49971), 42100 states have internal predecessors, (49971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42101 states to 42101 states and 49971 transitions. [2024-11-11 16:59:15,951 INFO L78 Accepts]: Start accepts. Automaton has 42101 states and 49971 transitions. Word has length 321 [2024-11-11 16:59:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:15,952 INFO L471 AbstractCegarLoop]: Abstraction has 42101 states and 49971 transitions. [2024-11-11 16:59:15,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 42101 states and 49971 transitions. [2024-11-11 16:59:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-11 16:59:15,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:15,957 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:59:15,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:59:15,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:15,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash -515432322, now seen corresponding path program 1 times [2024-11-11 16:59:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:15,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730362688] [2024-11-11 16:59:15,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 16:59:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730362688] [2024-11-11 16:59:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730362688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:16,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:59:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683078950] [2024-11-11 16:59:16,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:16,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:59:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:59:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:59:16,141 INFO L87 Difference]: Start difference. First operand 42101 states and 49971 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:21,300 INFO L93 Difference]: Finished difference Result 142668 states and 170381 transitions. [2024-11-11 16:59:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:59:21,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 321 [2024-11-11 16:59:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:21,415 INFO L225 Difference]: With dead ends: 142668 [2024-11-11 16:59:21,415 INFO L226 Difference]: Without dead ends: 101356 [2024-11-11 16:59:21,451 INFO L434 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-11 16:59:21,452 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1738 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 6065 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 7252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 6065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:21,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 689 Invalid, 7252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 6065 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-11 16:59:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101356 states. [2024-11-11 16:59:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101356 to 100436. [2024-11-11 16:59:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100436 states, 100435 states have (on average 1.1701498481605017) internal successors, (117524), 100435 states have internal predecessors, (117524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100436 states to 100436 states and 117524 transitions. [2024-11-11 16:59:22,317 INFO L78 Accepts]: Start accepts. Automaton has 100436 states and 117524 transitions. Word has length 321 [2024-11-11 16:59:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:22,317 INFO L471 AbstractCegarLoop]: Abstraction has 100436 states and 117524 transitions. [2024-11-11 16:59:22,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 100436 states and 117524 transitions. [2024-11-11 16:59:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-11 16:59:22,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:22,322 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:59:22,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:59:22,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:22,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash -811172309, now seen corresponding path program 1 times [2024-11-11 16:59:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:22,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855635194] [2024-11-11 16:59:22,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:22,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-11 16:59:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855635194] [2024-11-11 16:59:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855635194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:59:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516298105] [2024-11-11 16:59:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:22,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:59:22,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:22,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:59:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:23,008 INFO L87 Difference]: Start difference. First operand 100436 states and 117524 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:26,127 INFO L93 Difference]: Finished difference Result 189847 states and 223207 transitions. [2024-11-11 16:59:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:59:26,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 330 [2024-11-11 16:59:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:26,236 INFO L225 Difference]: With dead ends: 189847 [2024-11-11 16:59:26,237 INFO L226 Difference]: Without dead ends: 100444 [2024-11-11 16:59:26,254 INFO L434 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-11 16:59:26,255 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 728 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:26,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1200 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 16:59:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100444 states. [2024-11-11 16:59:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100444 to 100436. [2024-11-11 16:59:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100436 states, 100435 states have (on average 1.1695026634141485) internal successors, (117459), 100435 states have internal predecessors, (117459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100436 states to 100436 states and 117459 transitions. [2024-11-11 16:59:27,186 INFO L78 Accepts]: Start accepts. Automaton has 100436 states and 117459 transitions. Word has length 330 [2024-11-11 16:59:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:27,186 INFO L471 AbstractCegarLoop]: Abstraction has 100436 states and 117459 transitions. [2024-11-11 16:59:27,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 100436 states and 117459 transitions. [2024-11-11 16:59:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-11 16:59:27,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:27,192 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:59:27,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:59:27,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:27,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:27,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1819442547, now seen corresponding path program 1 times [2024-11-11 16:59:27,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:27,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555859055] [2024-11-11 16:59:27,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:27,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 230 proven. 113 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 16:59:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555859055] [2024-11-11 16:59:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555859055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:59:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212210277] [2024-11-11 16:59:28,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:28,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:59:28,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:59:28,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:59:28,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:59:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:28,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:59:28,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:59:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-11 16:59:28,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:59:28,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212210277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:28,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:59:28,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-11 16:59:28,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553160518] [2024-11-11 16:59:28,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:28,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:59:28,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:28,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:59:28,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:59:28,908 INFO L87 Difference]: Start difference. First operand 100436 states and 117459 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:32,354 INFO L93 Difference]: Finished difference Result 200082 states and 234124 transitions. [2024-11-11 16:59:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:59:32,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 359 [2024-11-11 16:59:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:32,470 INFO L225 Difference]: With dead ends: 200082 [2024-11-11 16:59:32,471 INFO L226 Difference]: Without dead ends: 100435 [2024-11-11 16:59:32,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:59:32,509 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 1123 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:32,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1446 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 16:59:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100435 states. [2024-11-11 16:59:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100435 to 99646. [2024-11-11 16:59:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99646 states, 99645 states have (on average 1.1240102363390034) internal successors, (112002), 99645 states have internal predecessors, (112002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99646 states to 99646 states and 112002 transitions. [2024-11-11 16:59:33,534 INFO L78 Accepts]: Start accepts. Automaton has 99646 states and 112002 transitions. Word has length 359 [2024-11-11 16:59:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:33,534 INFO L471 AbstractCegarLoop]: Abstraction has 99646 states and 112002 transitions. [2024-11-11 16:59:33,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 99646 states and 112002 transitions. [2024-11-11 16:59:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-11 16:59:33,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:33,540 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2024-11-11 16:59:33,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:59:33,740 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-11 16:59:33,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:33,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1112506830, now seen corresponding path program 1 times [2024-11-11 16:59:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:33,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152364917] [2024-11-11 16:59:33,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:33,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-11 16:59:34,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:34,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152364917] [2024-11-11 16:59:34,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152364917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:34,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:59:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190169549] [2024-11-11 16:59:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:34,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:59:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:34,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:59:34,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:34,111 INFO L87 Difference]: Start difference. First operand 99646 states and 112002 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:37,454 INFO L93 Difference]: Finished difference Result 226845 states and 257623 transitions. [2024-11-11 16:59:37,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:59:37,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 389 [2024-11-11 16:59:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:37,594 INFO L225 Difference]: With dead ends: 226845 [2024-11-11 16:59:37,594 INFO L226 Difference]: Without dead ends: 127988 [2024-11-11 16:59:37,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:37,641 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 888 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:37,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 953 Invalid, 3361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 16:59:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127988 states. [2024-11-11 16:59:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127988 to 126394. [2024-11-11 16:59:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126394 states, 126393 states have (on average 1.1274516784948534) internal successors, (142502), 126393 states have internal predecessors, (142502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126394 states to 126394 states and 142502 transitions. [2024-11-11 16:59:39,123 INFO L78 Accepts]: Start accepts. Automaton has 126394 states and 142502 transitions. Word has length 389 [2024-11-11 16:59:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:39,124 INFO L471 AbstractCegarLoop]: Abstraction has 126394 states and 142502 transitions. [2024-11-11 16:59:39,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 126394 states and 142502 transitions. [2024-11-11 16:59:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-11 16:59:39,142 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:39,143 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2024-11-11 16:59:39,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:59:39,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:39,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1062572237, now seen corresponding path program 1 times [2024-11-11 16:59:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:39,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105753461] [2024-11-11 16:59:39,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-11 16:59:39,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:39,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105753461] [2024-11-11 16:59:39,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105753461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:39,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:59:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977375433] [2024-11-11 16:59:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:39,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:59:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:59:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:39,534 INFO L87 Difference]: Start difference. First operand 126394 states and 142502 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:43,399 INFO L93 Difference]: Finished difference Result 281133 states and 319659 transitions. [2024-11-11 16:59:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:59:43,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2024-11-11 16:59:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:43,571 INFO L225 Difference]: With dead ends: 281133 [2024-11-11 16:59:43,572 INFO L226 Difference]: Without dead ends: 155528 [2024-11-11 16:59:43,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:43,617 INFO L435 NwaCegarLoop]: 1787 mSDtfsCounter, 779 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:43,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1938 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 16:59:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155528 states. [2024-11-11 16:59:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155528 to 153937. [2024-11-11 16:59:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153937 states, 153936 states have (on average 1.110916224924644) internal successors, (171010), 153936 states have internal predecessors, (171010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153937 states to 153937 states and 171010 transitions. [2024-11-11 16:59:45,662 INFO L78 Accepts]: Start accepts. Automaton has 153937 states and 171010 transitions. Word has length 427 [2024-11-11 16:59:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:45,664 INFO L471 AbstractCegarLoop]: Abstraction has 153937 states and 171010 transitions. [2024-11-11 16:59:45,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 153937 states and 171010 transitions. [2024-11-11 16:59:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2024-11-11 16:59:45,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:45,714 INFO L218 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:59:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:59:45,715 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:45,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1708302603, now seen corresponding path program 1 times [2024-11-11 16:59:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081537446] [2024-11-11 16:59:45,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-11 16:59:45,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:45,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081537446] [2024-11-11 16:59:45,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081537446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:45,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:45,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:59:45,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026971494] [2024-11-11 16:59:45,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:45,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:59:45,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:45,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:59:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:45,984 INFO L87 Difference]: Start difference. First operand 153937 states and 171010 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:49,167 INFO L93 Difference]: Finished difference Result 307095 states and 341246 transitions. [2024-11-11 16:59:49,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:59:49,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 546 [2024-11-11 16:59:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:49,357 INFO L225 Difference]: With dead ends: 307095 [2024-11-11 16:59:49,357 INFO L226 Difference]: Without dead ends: 153947 [2024-11-11 16:59:49,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:49,414 INFO L435 NwaCegarLoop]: 1416 mSDtfsCounter, 936 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:49,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1508 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 16:59:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153947 states. [2024-11-11 16:59:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153947 to 153930. [2024-11-11 16:59:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153930 states, 153929 states have (on average 1.0836879340475154) internal successors, (166811), 153929 states have internal predecessors, (166811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153930 states to 153930 states and 166811 transitions. [2024-11-11 16:59:51,493 INFO L78 Accepts]: Start accepts. Automaton has 153930 states and 166811 transitions. Word has length 546 [2024-11-11 16:59:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:51,494 INFO L471 AbstractCegarLoop]: Abstraction has 153930 states and 166811 transitions. [2024-11-11 16:59:51,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 153930 states and 166811 transitions. [2024-11-11 16:59:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2024-11-11 16:59:51,513 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:51,514 INFO L218 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, 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:59:51,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:59:51,514 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:51,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2011980910, now seen corresponding path program 1 times [2024-11-11 16:59:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:51,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886819646] [2024-11-11 16:59:51,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-11 16:59:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:51,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886819646] [2024-11-11 16:59:51,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886819646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:51,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:59:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32064958] [2024-11-11 16:59:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:51,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:59:51,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:51,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:59:51,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:51,674 INFO L87 Difference]: Start difference. First operand 153930 states and 166811 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:59:54,572 INFO L93 Difference]: Finished difference Result 314917 states and 340710 transitions. [2024-11-11 16:59:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:59:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 582 [2024-11-11 16:59:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:59:54,742 INFO L225 Difference]: With dead ends: 314917 [2024-11-11 16:59:54,742 INFO L226 Difference]: Without dead ends: 158628 [2024-11-11 16:59:55,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:55,107 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 1018 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:59:55,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 1625 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 16:59:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158628 states. [2024-11-11 16:59:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158628 to 147599. [2024-11-11 16:59:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147599 states, 147598 states have (on average 1.0591877938725458) internal successors, (156334), 147598 states have internal predecessors, (156334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147599 states to 147599 states and 156334 transitions. [2024-11-11 16:59:56,719 INFO L78 Accepts]: Start accepts. Automaton has 147599 states and 156334 transitions. Word has length 582 [2024-11-11 16:59:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:59:56,720 INFO L471 AbstractCegarLoop]: Abstraction has 147599 states and 156334 transitions. [2024-11-11 16:59:56,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:59:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 147599 states and 156334 transitions. [2024-11-11 16:59:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2024-11-11 16:59:56,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:59:56,743 INFO L218 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:59:56,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:59:56,743 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:59:56,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:59:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1424107546, now seen corresponding path program 1 times [2024-11-11 16:59:56,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:59:56,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313693293] [2024-11-11 16:59:56,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:59:56,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:59:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:59:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2024-11-11 16:59:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:59:57,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313693293] [2024-11-11 16:59:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313693293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:59:57,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:59:57,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:59:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526920265] [2024-11-11 16:59:57,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:59:57,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:59:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:59:57,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:59:57,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:59:57,406 INFO L87 Difference]: Start difference. First operand 147599 states and 156334 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:00:00,066 INFO L93 Difference]: Finished difference Result 288864 states and 306795 transitions. [2024-11-11 17:00:00,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:00:00,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 587 [2024-11-11 17:00:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:00:00,234 INFO L225 Difference]: With dead ends: 288864 [2024-11-11 17:00:00,234 INFO L226 Difference]: Without dead ends: 157013 [2024-11-11 17:00:00,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:00,298 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 1012 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:00:00,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1477 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 17:00:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157013 states. [2024-11-11 17:00:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157013 to 157011. [2024-11-11 17:00:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157011 states, 157010 states have (on average 1.056614228393096) internal successors, (165899), 157010 states have internal predecessors, (165899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157011 states to 157011 states and 165899 transitions. [2024-11-11 17:00:02,128 INFO L78 Accepts]: Start accepts. Automaton has 157011 states and 165899 transitions. Word has length 587 [2024-11-11 17:00:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:00:02,129 INFO L471 AbstractCegarLoop]: Abstraction has 157011 states and 165899 transitions. [2024-11-11 17:00:02,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 157011 states and 165899 transitions. [2024-11-11 17:00:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2024-11-11 17:00:02,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:02,154 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:02,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 17:00:02,155 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:02,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1269831408, now seen corresponding path program 1 times [2024-11-11 17:00:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800728888] [2024-11-11 17:00:02,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-11 17:00:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:03,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800728888] [2024-11-11 17:00:03,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800728888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:03,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:03,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:00:03,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152098544] [2024-11-11 17:00:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:03,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:00:03,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:03,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:00:03,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:00:03,007 INFO L87 Difference]: Start difference. First operand 157011 states and 165899 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)