./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label01.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 65de5b720550425739629c673edc29b7a854e52f56e69a2e107d2cca3ffb2713 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:29:39,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:29:39,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:29:39,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:29:39,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:29:39,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:29:39,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:29:39,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:29:39,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:29:39,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:29:39,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:29:39,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:29:39,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:29:39,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:29:39,757 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:29:39,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:29:39,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:29:39,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:29:39,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:29:39,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:29:39,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:29:39,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:29:39,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:29:39,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:29:39,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:29:39,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:29:39,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:29:39,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:29:39,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:29:39,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:29:39,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:29:39,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:29:39,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:29:39,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:29:39,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:29:39,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:29:39,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:29:39,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:29:39,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:29:39,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:29:39,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:29:39,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:29:39,764 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 -> 65de5b720550425739629c673edc29b7a854e52f56e69a2e107d2cca3ffb2713 [2024-10-13 23:29:39,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:29:39,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:29:39,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:29:39,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:29:39,983 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:29:39,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label01.c [2024-10-13 23:29:41,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:29:41,599 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:29:41,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label01.c [2024-10-13 23:29:41,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c400bcf42/02772253a2f547df9f711b1291000748/FLAG255ad6e7a [2024-10-13 23:29:41,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c400bcf42/02772253a2f547df9f711b1291000748 [2024-10-13 23:29:41,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:29:41,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:29:41,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:29:41,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:29:41,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:29:41,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:29:41" (1/1) ... [2024-10-13 23:29:41,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702d501b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:41, skipping insertion in model container [2024-10-13 23:29:41,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:29:41" (1/1) ... [2024-10-13 23:29:41,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:29:41,974 WARN L248 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/Problem12_label01.c[5916,5929] [2024-10-13 23:29:42,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:29:42,510 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:29:42,525 WARN L248 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/Problem12_label01.c[5916,5929] [2024-10-13 23:29:42,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:29:42,846 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:29:42,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42 WrapperNode [2024-10-13 23:29:42,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:29:42,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:29:42,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:29:42,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:29:42,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:42,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,042 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-13 23:29:43,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:29:43,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:29:43,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:29:43,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:29:43,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,246 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-10-13 23:29:43,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:29:43,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:29:43,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:29:43,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:29:43,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (1/1) ... [2024-10-13 23:29:43,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:29:43,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:29:43,542 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-10-13 23:29:43,544 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-10-13 23:29:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:29:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:29:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:29:43,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:29:43,636 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:29:43,638 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:29:46,810 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-13 23:29:46,810 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:29:46,851 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:29:46,852 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:29:46,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:29:46 BoogieIcfgContainer [2024-10-13 23:29:46,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:29:46,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:29:46,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:29:46,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:29:46,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:29:41" (1/3) ... [2024-10-13 23:29:46,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4737006e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:29:46, skipping insertion in model container [2024-10-13 23:29:46,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:29:42" (2/3) ... [2024-10-13 23:29:46,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4737006e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:29:46, skipping insertion in model container [2024-10-13 23:29:46,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:29:46" (3/3) ... [2024-10-13 23:29:46,858 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label01.c [2024-10-13 23:29:46,872 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:29:46,873 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:29:46,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:29:46,941 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;@7ceca935, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:29:46,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:29:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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-10-13 23:29:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 23:29:46,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:46,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:46,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:46,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:46,955 INFO L85 PathProgramCache]: Analyzing trace with hash -299451718, now seen corresponding path program 1 times [2024-10-13 23:29:46,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:46,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508736468] [2024-10-13 23:29:46,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:29:47,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:47,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508736468] [2024-10-13 23:29:47,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508736468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:47,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:47,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:29:47,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352764620] [2024-10-13 23:29:47,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:47,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:29:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:47,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:29:47,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:29:47,203 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:47,334 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-13 23:29:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:29:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-13 23:29:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:47,355 INFO L225 Difference]: With dead ends: 1511 [2024-10-13 23:29:47,355 INFO L226 Difference]: Without dead ends: 754 [2024-10-13 23:29:47,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:29:47,370 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:47,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:29:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-13 23:29:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-13 23:29:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 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-10-13 23:29:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-13 23:29:47,448 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 46 [2024-10-13 23:29:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:47,448 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-13 23:29:47,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-13 23:29:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 23:29:47,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:47,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:29:47,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:29:47,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:47,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1658568174, now seen corresponding path program 1 times [2024-10-13 23:29:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:47,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782777303] [2024-10-13 23:29:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:47,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:29:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782777303] [2024-10-13 23:29:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782777303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:47,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:29:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403776481] [2024-10-13 23:29:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:47,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:29:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:47,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:29:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:47,619 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:50,318 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-13 23:29:50,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:29:50,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-13 23:29:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:50,323 INFO L225 Difference]: With dead ends: 2258 [2024-10-13 23:29:50,323 INFO L226 Difference]: Without dead ends: 1505 [2024-10-13 23:29:50,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:29:50,325 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 771 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:50,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 426 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:29:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-13 23:29:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-13 23:29:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 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-10-13 23:29:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2024-10-13 23:29:50,358 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 46 [2024-10-13 23:29:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:50,359 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2024-10-13 23:29:50,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2024-10-13 23:29:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 23:29:50,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:50,364 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:29:50,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:29:50,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:50,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash 187585666, now seen corresponding path program 1 times [2024-10-13 23:29:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127010977] [2024-10-13 23:29:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:29:50,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:50,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127010977] [2024-10-13 23:29:50,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127010977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:50,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:50,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:50,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140306221] [2024-10-13 23:29:50,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:50,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:29:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:50,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:29:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:50,659 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-10-13 23:29:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:53,704 INFO L93 Difference]: Finished difference Result 4550 states and 7430 transitions. [2024-10-13 23:29:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:29:53,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-10-13 23:29:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:53,713 INFO L225 Difference]: With dead ends: 4550 [2024-10-13 23:29:53,713 INFO L226 Difference]: Without dead ends: 3009 [2024-10-13 23:29:53,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:53,716 INFO L432 NwaCegarLoop]: 637 mSDtfsCounter, 705 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3077 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 3077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:53,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 651 Invalid, 3805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 3077 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 23:29:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2024-10-13 23:29:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3007. [2024-10-13 23:29:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.3419827012641383) internal successors, (4034), 3006 states have internal predecessors, (4034), 0 states have call successors, (0), 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-10-13 23:29:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4034 transitions. [2024-10-13 23:29:53,769 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4034 transitions. Word has length 117 [2024-10-13 23:29:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:53,771 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4034 transitions. [2024-10-13 23:29:53,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-10-13 23:29:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4034 transitions. [2024-10-13 23:29:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 23:29:53,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:53,777 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:29:53,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:29:53,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:53,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1910352063, now seen corresponding path program 1 times [2024-10-13 23:29:53,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:53,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102714659] [2024-10-13 23:29:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:29:54,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102714659] [2024-10-13 23:29:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102714659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:54,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:54,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142597251] [2024-10-13 23:29:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:54,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:29:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:54,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:29:54,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:54,128 INFO L87 Difference]: Start difference. First operand 3007 states and 4034 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:29:57,428 INFO L93 Difference]: Finished difference Result 9768 states and 12894 transitions. [2024-10-13 23:29:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:29:57,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-10-13 23:29:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:29:57,445 INFO L225 Difference]: With dead ends: 9768 [2024-10-13 23:29:57,445 INFO L226 Difference]: Without dead ends: 6762 [2024-10-13 23:29:57,451 INFO L431 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-10-13 23:29:57,453 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 2093 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4275 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 4842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 4275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:29:57,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 449 Invalid, 4842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 4275 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 23:29:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-13 23:29:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2024-10-13 23:29:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.28782724449046) internal successors, (8707), 6761 states have internal predecessors, (8707), 0 states have call successors, (0), 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-10-13 23:29:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 8707 transitions. [2024-10-13 23:29:57,574 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 8707 transitions. Word has length 155 [2024-10-13 23:29:57,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:29:57,575 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 8707 transitions. [2024-10-13 23:29:57,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:29:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 8707 transitions. [2024-10-13 23:29:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-13 23:29:57,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:29:57,579 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-10-13 23:29:57,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:29:57,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:29:57,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:29:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash -504924125, now seen corresponding path program 1 times [2024-10-13 23:29:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:29:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746429526] [2024-10-13 23:29:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:29:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:29:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:29:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-13 23:29:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:29:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746429526] [2024-10-13 23:29:57,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746429526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:29:57,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:29:57,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:29:57,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829357236] [2024-10-13 23:29:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:29:57,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:29:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:29:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:29:57,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:29:57,877 INFO L87 Difference]: Start difference. First operand 6762 states and 8707 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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-10-13 23:30:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:00,466 INFO L93 Difference]: Finished difference Result 15815 states and 21399 transitions. [2024-10-13 23:30:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:30:00,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 258 [2024-10-13 23:30:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:00,488 INFO L225 Difference]: With dead ends: 15815 [2024-10-13 23:30:00,488 INFO L226 Difference]: Without dead ends: 9768 [2024-10-13 23:30:00,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:30:00,497 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:00,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 491 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:30:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9768 states. [2024-10-13 23:30:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9768 to 9766. [2024-10-13 23:30:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.273425499231951) internal successors, (12435), 9765 states have internal predecessors, (12435), 0 states have call successors, (0), 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-10-13 23:30:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12435 transitions. [2024-10-13 23:30:00,618 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 12435 transitions. Word has length 258 [2024-10-13 23:30:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:00,619 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 12435 transitions. [2024-10-13 23:30:00,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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-10-13 23:30:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 12435 transitions. [2024-10-13 23:30:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-13 23:30:00,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:00,622 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:30:00,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:30:00,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:00,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1943445395, now seen corresponding path program 1 times [2024-10-13 23:30:00,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:00,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95655174] [2024-10-13 23:30:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-13 23:30:00,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:00,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95655174] [2024-10-13 23:30:00,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95655174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:00,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:00,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:30:00,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390159024] [2024-10-13 23:30:00,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:00,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:00,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:00,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:00,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:00,787 INFO L87 Difference]: Start difference. First operand 9766 states and 12435 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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-10-13 23:30:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:02,936 INFO L93 Difference]: Finished difference Result 26290 states and 34161 transitions. [2024-10-13 23:30:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:02,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 261 [2024-10-13 23:30:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:02,971 INFO L225 Difference]: With dead ends: 26290 [2024-10-13 23:30:02,973 INFO L226 Difference]: Without dead ends: 17276 [2024-10-13 23:30:02,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:02,985 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 619 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:02,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 596 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 23:30:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17276 states. [2024-10-13 23:30:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 17276. [2024-10-13 23:30:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17276 states, 17275 states have (on average 1.1980318379160637) internal successors, (20696), 17275 states have internal predecessors, (20696), 0 states have call successors, (0), 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-10-13 23:30:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17276 states to 17276 states and 20696 transitions. [2024-10-13 23:30:03,182 INFO L78 Accepts]: Start accepts. Automaton has 17276 states and 20696 transitions. Word has length 261 [2024-10-13 23:30:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:03,182 INFO L471 AbstractCegarLoop]: Abstraction has 17276 states and 20696 transitions. [2024-10-13 23:30:03,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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-10-13 23:30:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 17276 states and 20696 transitions. [2024-10-13 23:30:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-13 23:30:03,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:03,187 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:30:03,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:30:03,187 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:03,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2098943652, now seen corresponding path program 1 times [2024-10-13 23:30:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305518566] [2024-10-13 23:30:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-13 23:30:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305518566] [2024-10-13 23:30:03,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305518566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:03,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:03,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:03,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472289322] [2024-10-13 23:30:03,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:03,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:03,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:03,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:03,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:03,385 INFO L87 Difference]: Start difference. First operand 17276 states and 20696 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-10-13 23:30:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:05,708 INFO L93 Difference]: Finished difference Result 33800 states and 40635 transitions. [2024-10-13 23:30:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:05,709 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 276 [2024-10-13 23:30:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:05,733 INFO L225 Difference]: With dead ends: 33800 [2024-10-13 23:30:05,733 INFO L226 Difference]: Without dead ends: 17276 [2024-10-13 23:30:05,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:05,745 INFO L432 NwaCegarLoop]: 1231 mSDtfsCounter, 696 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:05,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1238 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 23:30:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17276 states. [2024-10-13 23:30:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 16525. [2024-10-13 23:30:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16525 states, 16524 states have (on average 1.1696320503510047) internal successors, (19327), 16524 states have internal predecessors, (19327), 0 states have call successors, (0), 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-10-13 23:30:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 19327 transitions. [2024-10-13 23:30:05,912 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 19327 transitions. Word has length 276 [2024-10-13 23:30:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:05,913 INFO L471 AbstractCegarLoop]: Abstraction has 16525 states and 19327 transitions. [2024-10-13 23:30:05,913 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-10-13 23:30:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 19327 transitions. [2024-10-13 23:30:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-13 23:30:05,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:05,917 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:30:05,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:30:05,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:05,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:05,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1558425813, now seen corresponding path program 1 times [2024-10-13 23:30:05,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:05,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857555251] [2024-10-13 23:30:05,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:05,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-13 23:30:06,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:06,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857555251] [2024-10-13 23:30:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857555251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:06,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:06,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505268532] [2024-10-13 23:30:06,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:06,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:06,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:06,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:06,100 INFO L87 Difference]: Start difference. First operand 16525 states and 19327 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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-10-13 23:30:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:08,236 INFO L93 Difference]: Finished difference Result 39808 states and 47518 transitions. [2024-10-13 23:30:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:08,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2024-10-13 23:30:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:08,267 INFO L225 Difference]: With dead ends: 39808 [2024-10-13 23:30:08,268 INFO L226 Difference]: Without dead ends: 24035 [2024-10-13 23:30:08,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:08,282 INFO L432 NwaCegarLoop]: 1194 mSDtfsCounter, 728 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:08,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1201 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 23:30:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2024-10-13 23:30:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 24035. [2024-10-13 23:30:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24035 states, 24034 states have (on average 1.144045934925522) internal successors, (27496), 24034 states have internal predecessors, (27496), 0 states have call successors, (0), 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-10-13 23:30:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 27496 transitions. [2024-10-13 23:30:08,658 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 27496 transitions. Word has length 277 [2024-10-13 23:30:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:08,659 INFO L471 AbstractCegarLoop]: Abstraction has 24035 states and 27496 transitions. [2024-10-13 23:30:08,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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-10-13 23:30:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 27496 transitions. [2024-10-13 23:30:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-10-13 23:30:08,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:08,663 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:08,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:30:08,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:08,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:08,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1484837302, now seen corresponding path program 1 times [2024-10-13 23:30:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107126257] [2024-10-13 23:30:08,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:30:08,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:08,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107126257] [2024-10-13 23:30:08,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107126257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:08,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:08,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:08,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440727172] [2024-10-13 23:30:08,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:08,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:08,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:08,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:08,920 INFO L87 Difference]: Start difference. First operand 24035 states and 27496 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-10-13 23:30:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:11,122 INFO L93 Difference]: Finished difference Result 60085 states and 68999 transitions. [2024-10-13 23:30:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 304 [2024-10-13 23:30:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:11,162 INFO L225 Difference]: With dead ends: 60085 [2024-10-13 23:30:11,163 INFO L226 Difference]: Without dead ends: 36802 [2024-10-13 23:30:11,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:11,183 INFO L432 NwaCegarLoop]: 1212 mSDtfsCounter, 646 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 2940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:11,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1218 Invalid, 2940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 23:30:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36802 states. [2024-10-13 23:30:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36802 to 36051. [2024-10-13 23:30:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36051 states, 36050 states have (on average 1.137891816920943) internal successors, (41021), 36050 states have internal predecessors, (41021), 0 states have call successors, (0), 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-10-13 23:30:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36051 states to 36051 states and 41021 transitions. [2024-10-13 23:30:11,492 INFO L78 Accepts]: Start accepts. Automaton has 36051 states and 41021 transitions. Word has length 304 [2024-10-13 23:30:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:11,493 INFO L471 AbstractCegarLoop]: Abstraction has 36051 states and 41021 transitions. [2024-10-13 23:30:11,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-10-13 23:30:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 36051 states and 41021 transitions. [2024-10-13 23:30:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-10-13 23:30:11,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:11,496 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:11,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:30:11,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:11,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1955016620, now seen corresponding path program 1 times [2024-10-13 23:30:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:11,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129028864] [2024-10-13 23:30:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 23:30:11,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:11,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129028864] [2024-10-13 23:30:11,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129028864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:11,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:11,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:11,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480503517] [2024-10-13 23:30:11,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:11,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:11,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:11,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:11,724 INFO L87 Difference]: Start difference. First operand 36051 states and 41021 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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-10-13 23:30:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:13,747 INFO L93 Difference]: Finished difference Result 71350 states and 81285 transitions. [2024-10-13 23:30:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:13,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 308 [2024-10-13 23:30:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:13,783 INFO L225 Difference]: With dead ends: 71350 [2024-10-13 23:30:13,784 INFO L226 Difference]: Without dead ends: 36051 [2024-10-13 23:30:13,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:13,806 INFO L432 NwaCegarLoop]: 1170 mSDtfsCounter, 759 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:13,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1177 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 23:30:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36051 states. [2024-10-13 23:30:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36051 to 36051. [2024-10-13 23:30:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36051 states, 36050 states have (on average 1.0893203883495146) internal successors, (39270), 36050 states have internal predecessors, (39270), 0 states have call successors, (0), 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-10-13 23:30:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36051 states to 36051 states and 39270 transitions. [2024-10-13 23:30:14,075 INFO L78 Accepts]: Start accepts. Automaton has 36051 states and 39270 transitions. Word has length 308 [2024-10-13 23:30:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:14,075 INFO L471 AbstractCegarLoop]: Abstraction has 36051 states and 39270 transitions. [2024-10-13 23:30:14,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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-10-13 23:30:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 36051 states and 39270 transitions. [2024-10-13 23:30:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-13 23:30:14,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:14,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:30:14,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:30:14,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:14,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:14,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1996931325, now seen corresponding path program 1 times [2024-10-13 23:30:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:14,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904738311] [2024-10-13 23:30:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-13 23:30:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904738311] [2024-10-13 23:30:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904738311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:14,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092508768] [2024-10-13 23:30:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:14,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:14,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:14,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:14,259 INFO L87 Difference]: Start difference. First operand 36051 states and 39270 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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-10-13 23:30:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:16,476 INFO L93 Difference]: Finished difference Result 85619 states and 94190 transitions. [2024-10-13 23:30:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:16,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 377 [2024-10-13 23:30:16,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:16,522 INFO L225 Difference]: With dead ends: 85619 [2024-10-13 23:30:16,522 INFO L226 Difference]: Without dead ends: 47316 [2024-10-13 23:30:16,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:16,547 INFO L432 NwaCegarLoop]: 1290 mSDtfsCounter, 746 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:16,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1297 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 23:30:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47316 states. [2024-10-13 23:30:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47316 to 46565. [2024-10-13 23:30:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46565 states, 46564 states have (on average 1.082016149815308) internal successors, (50383), 46564 states have internal predecessors, (50383), 0 states have call successors, (0), 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-10-13 23:30:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46565 states to 46565 states and 50383 transitions. [2024-10-13 23:30:16,894 INFO L78 Accepts]: Start accepts. Automaton has 46565 states and 50383 transitions. Word has length 377 [2024-10-13 23:30:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:16,894 INFO L471 AbstractCegarLoop]: Abstraction has 46565 states and 50383 transitions. [2024-10-13 23:30:16,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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-10-13 23:30:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 46565 states and 50383 transitions. [2024-10-13 23:30:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2024-10-13 23:30:16,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:16,902 INFO L215 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:30:16,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:30:16,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash 962095039, now seen corresponding path program 1 times [2024-10-13 23:30:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440603027] [2024-10-13 23:30:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-10-13 23:30:17,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:17,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440603027] [2024-10-13 23:30:17,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440603027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:17,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:17,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:17,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553694037] [2024-10-13 23:30:17,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:17,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:17,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:17,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:17,065 INFO L87 Difference]: Start difference. First operand 46565 states and 50383 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-10-13 23:30:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:19,231 INFO L93 Difference]: Finished difference Result 93129 states and 100783 transitions. [2024-10-13 23:30:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:19,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 446 [2024-10-13 23:30:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:19,275 INFO L225 Difference]: With dead ends: 93129 [2024-10-13 23:30:19,275 INFO L226 Difference]: Without dead ends: 47316 [2024-10-13 23:30:19,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:19,302 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 732 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:19,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 258 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 23:30:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47316 states. [2024-10-13 23:30:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47316 to 44312. [2024-10-13 23:30:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44312 states, 44311 states have (on average 1.081514748030963) internal successors, (47923), 44311 states have internal predecessors, (47923), 0 states have call successors, (0), 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-10-13 23:30:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44312 states to 44312 states and 47923 transitions. [2024-10-13 23:30:19,642 INFO L78 Accepts]: Start accepts. Automaton has 44312 states and 47923 transitions. Word has length 446 [2024-10-13 23:30:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:19,643 INFO L471 AbstractCegarLoop]: Abstraction has 44312 states and 47923 transitions. [2024-10-13 23:30:19,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-10-13 23:30:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 44312 states and 47923 transitions. [2024-10-13 23:30:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2024-10-13 23:30:19,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:19,649 INFO L215 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:19,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:30:19,650 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:19,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1038285347, now seen corresponding path program 1 times [2024-10-13 23:30:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395545910] [2024-10-13 23:30:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-13 23:30:19,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:19,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395545910] [2024-10-13 23:30:19,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395545910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:19,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:19,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:19,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958664825] [2024-10-13 23:30:19,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:19,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:19,841 INFO L87 Difference]: Start difference. First operand 44312 states and 47923 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-10-13 23:30:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:22,379 INFO L93 Difference]: Finished difference Result 123169 states and 133812 transitions. [2024-10-13 23:30:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 457 [2024-10-13 23:30:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:22,454 INFO L225 Difference]: With dead ends: 123169 [2024-10-13 23:30:22,454 INFO L226 Difference]: Without dead ends: 79609 [2024-10-13 23:30:22,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:22,486 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 705 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 632 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:22,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 503 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [632 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 23:30:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79609 states. [2024-10-13 23:30:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79609 to 77356. [2024-10-13 23:30:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77356 states, 77355 states have (on average 1.0734277034451554) internal successors, (83035), 77355 states have internal predecessors, (83035), 0 states have call successors, (0), 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-10-13 23:30:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77356 states to 77356 states and 83035 transitions. [2024-10-13 23:30:23,108 INFO L78 Accepts]: Start accepts. Automaton has 77356 states and 83035 transitions. Word has length 457 [2024-10-13 23:30:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:23,108 INFO L471 AbstractCegarLoop]: Abstraction has 77356 states and 83035 transitions. [2024-10-13 23:30:23,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-10-13 23:30:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 77356 states and 83035 transitions. [2024-10-13 23:30:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2024-10-13 23:30:23,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:23,115 INFO L215 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:23,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:30:23,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash -960282774, now seen corresponding path program 1 times [2024-10-13 23:30:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:23,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073734549] [2024-10-13 23:30:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 220 proven. 333 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-10-13 23:30:23,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:23,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073734549] [2024-10-13 23:30:23,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073734549] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:30:23,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189458938] [2024-10-13 23:30:23,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:23,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:30:23,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:30:23,846 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-10-13 23:30:23,847 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-10-13 23:30:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:24,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:30:24,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:30:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 23:30:24,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:30:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189458938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:24,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:30:24,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:30:24,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129257615] [2024-10-13 23:30:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:24,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:24,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:24,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:30:24,325 INFO L87 Difference]: Start difference. First operand 77356 states and 83035 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-10-13 23:30:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:26,572 INFO L93 Difference]: Finished difference Result 174237 states and 187906 transitions. [2024-10-13 23:30:26,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:26,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 484 [2024-10-13 23:30:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:26,661 INFO L225 Difference]: With dead ends: 174237 [2024-10-13 23:30:26,662 INFO L226 Difference]: Without dead ends: 97633 [2024-10-13 23:30:26,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:30:26,696 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 827 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:26,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1114 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 23:30:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97633 states. [2024-10-13 23:30:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97633 to 96882. [2024-10-13 23:30:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96882 states, 96881 states have (on average 1.0687544513372076) internal successors, (103542), 96881 states have internal predecessors, (103542), 0 states have call successors, (0), 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-10-13 23:30:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96882 states to 96882 states and 103542 transitions. [2024-10-13 23:30:27,717 INFO L78 Accepts]: Start accepts. Automaton has 96882 states and 103542 transitions. Word has length 484 [2024-10-13 23:30:27,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:27,718 INFO L471 AbstractCegarLoop]: Abstraction has 96882 states and 103542 transitions. [2024-10-13 23:30:27,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-10-13 23:30:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 96882 states and 103542 transitions. [2024-10-13 23:30:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2024-10-13 23:30:27,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:27,728 INFO L215 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:30:27,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:30:27,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 23:30:27,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:27,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:27,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1149995031, now seen corresponding path program 1 times [2024-10-13 23:30:27,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:27,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273329147] [2024-10-13 23:30:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-13 23:30:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273329147] [2024-10-13 23:30:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273329147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:28,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:28,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607786210] [2024-10-13 23:30:28,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:28,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:28,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:28,443 INFO L87 Difference]: Start difference. First operand 96882 states and 103542 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-10-13 23:30:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:30,677 INFO L93 Difference]: Finished difference Result 211036 states and 225646 transitions. [2024-10-13 23:30:30,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:30,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 496 [2024-10-13 23:30:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:30,791 INFO L225 Difference]: With dead ends: 211036 [2024-10-13 23:30:30,791 INFO L226 Difference]: Without dead ends: 110400 [2024-10-13 23:30:30,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:30,809 INFO L432 NwaCegarLoop]: 1325 mSDtfsCounter, 660 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:30,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1331 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 23:30:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110400 states. [2024-10-13 23:30:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110400 to 104392. [2024-10-13 23:30:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104392 states, 104391 states have (on average 1.0613941814907415) internal successors, (110800), 104391 states have internal predecessors, (110800), 0 states have call successors, (0), 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-10-13 23:30:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104392 states to 104392 states and 110800 transitions. [2024-10-13 23:30:32,128 INFO L78 Accepts]: Start accepts. Automaton has 104392 states and 110800 transitions. Word has length 496 [2024-10-13 23:30:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:32,129 INFO L471 AbstractCegarLoop]: Abstraction has 104392 states and 110800 transitions. [2024-10-13 23:30:32,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-10-13 23:30:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 104392 states and 110800 transitions. [2024-10-13 23:30:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2024-10-13 23:30:32,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:32,150 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:30:32,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:30:32,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:32,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash 453277189, now seen corresponding path program 1 times [2024-10-13 23:30:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:32,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841035994] [2024-10-13 23:30:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:32,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-13 23:30:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:33,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841035994] [2024-10-13 23:30:33,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841035994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964131707] [2024-10-13 23:30:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:33,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:33,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:33,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:33,042 INFO L87 Difference]: Start difference. First operand 104392 states and 110800 transitions. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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-10-13 23:30:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:35,192 INFO L93 Difference]: Finished difference Result 208032 states and 220843 transitions. [2024-10-13 23:30:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:35,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 660 [2024-10-13 23:30:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:35,294 INFO L225 Difference]: With dead ends: 208032 [2024-10-13 23:30:35,294 INFO L226 Difference]: Without dead ends: 104392 [2024-10-13 23:30:35,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-13 23:30:35,335 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 819 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:35,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 84 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 23:30:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104392 states. [2024-10-13 23:30:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104392 to 103641. [2024-10-13 23:30:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103641 states, 103640 states have (on average 1.0554419143187959) internal successors, (109386), 103640 states have internal predecessors, (109386), 0 states have call successors, (0), 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-10-13 23:30:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103641 states to 103641 states and 109386 transitions. [2024-10-13 23:30:36,511 INFO L78 Accepts]: Start accepts. Automaton has 103641 states and 109386 transitions. Word has length 660 [2024-10-13 23:30:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:36,511 INFO L471 AbstractCegarLoop]: Abstraction has 103641 states and 109386 transitions. [2024-10-13 23:30:36,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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-10-13 23:30:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 103641 states and 109386 transitions. [2024-10-13 23:30:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2024-10-13 23:30:36,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:36,530 INFO L215 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:30:36,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:30:36,530 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:36,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash 385140027, now seen corresponding path program 1 times [2024-10-13 23:30:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:36,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123010690] [2024-10-13 23:30:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-13 23:30:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123010690] [2024-10-13 23:30:37,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123010690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:37,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:37,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:37,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158289034] [2024-10-13 23:30:37,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:37,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:37,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:37,057 INFO L87 Difference]: Start difference. First operand 103641 states and 109386 transitions. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 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-10-13 23:30:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:39,875 INFO L93 Difference]: Finished difference Result 242578 states and 256792 transitions. [2024-10-13 23:30:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:39,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 670 [2024-10-13 23:30:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:40,020 INFO L225 Difference]: With dead ends: 242578 [2024-10-13 23:30:40,021 INFO L226 Difference]: Without dead ends: 138938 [2024-10-13 23:30:40,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:40,077 INFO L432 NwaCegarLoop]: 1294 mSDtfsCounter, 659 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:40,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1301 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 23:30:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138938 states. [2024-10-13 23:30:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138938 to 129926. [2024-10-13 23:30:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129926 states, 129925 states have (on average 1.0497671733692515) internal successors, (136391), 129925 states have internal predecessors, (136391), 0 states have call successors, (0), 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-10-13 23:30:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129926 states to 129926 states and 136391 transitions. [2024-10-13 23:30:41,704 INFO L78 Accepts]: Start accepts. Automaton has 129926 states and 136391 transitions. Word has length 670 [2024-10-13 23:30:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:41,704 INFO L471 AbstractCegarLoop]: Abstraction has 129926 states and 136391 transitions. [2024-10-13 23:30:41,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 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-10-13 23:30:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 129926 states and 136391 transitions. [2024-10-13 23:30:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2024-10-13 23:30:41,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:41,762 INFO L215 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:30:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:30:41,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 256096383, now seen corresponding path program 1 times [2024-10-13 23:30:41,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:41,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717216512] [2024-10-13 23:30:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 597 proven. 45 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-13 23:30:43,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:43,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717216512] [2024-10-13 23:30:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717216512] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:30:43,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416155695] [2024-10-13 23:30:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:43,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:30:43,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:30:43,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:30:43,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:30:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:43,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:30:43,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:30:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-13 23:30:44,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:30:44,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416155695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:44,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:30:44,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 23:30:44,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723434283] [2024-10-13 23:30:44,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:44,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:44,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:44,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:30:44,225 INFO L87 Difference]: Start difference. First operand 129926 states and 136391 transitions. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 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-10-13 23:30:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:46,459 INFO L93 Difference]: Finished difference Result 260602 states and 273556 transitions. [2024-10-13 23:30:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:46,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 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 774 [2024-10-13 23:30:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:46,578 INFO L225 Difference]: With dead ends: 260602 [2024-10-13 23:30:46,578 INFO L226 Difference]: Without dead ends: 131428 [2024-10-13 23:30:46,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 774 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:30:46,609 INFO L432 NwaCegarLoop]: 1326 mSDtfsCounter, 488 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:46,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1333 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:30:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131428 states. [2024-10-13 23:30:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131428 to 131428. [2024-10-13 23:30:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131428 states, 131427 states have (on average 1.0488712365039148) internal successors, (137850), 131427 states have internal predecessors, (137850), 0 states have call successors, (0), 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-10-13 23:30:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131428 states to 131428 states and 137850 transitions. [2024-10-13 23:30:48,079 INFO L78 Accepts]: Start accepts. Automaton has 131428 states and 137850 transitions. Word has length 774 [2024-10-13 23:30:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:48,079 INFO L471 AbstractCegarLoop]: Abstraction has 131428 states and 137850 transitions. [2024-10-13 23:30:48,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 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-10-13 23:30:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 131428 states and 137850 transitions. [2024-10-13 23:30:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2024-10-13 23:30:48,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:48,111 INFO L215 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:30:48,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:30:48,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 23:30:48,312 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:48,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 894561272, now seen corresponding path program 1 times [2024-10-13 23:30:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:48,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584195613] [2024-10-13 23:30:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 874 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 23:30:48,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:48,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584195613] [2024-10-13 23:30:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584195613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:48,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:48,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:48,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039877310] [2024-10-13 23:30:48,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:48,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:48,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:48,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:48,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:48,710 INFO L87 Difference]: Start difference. First operand 131428 states and 137850 transitions. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 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-10-13 23:30:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:51,295 INFO L93 Difference]: Finished difference Result 265108 states and 278006 transitions. [2024-10-13 23:30:51,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:51,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 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 775 [2024-10-13 23:30:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:51,437 INFO L225 Difference]: With dead ends: 265108 [2024-10-13 23:30:51,437 INFO L226 Difference]: Without dead ends: 134432 [2024-10-13 23:30:51,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:51,511 INFO L432 NwaCegarLoop]: 1149 mSDtfsCounter, 646 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:51,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1155 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 23:30:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134432 states. [2024-10-13 23:30:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134432 to 127673. [2024-10-13 23:30:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127673 states, 127672 states have (on average 1.0325756626355034) internal successors, (131831), 127672 states have internal predecessors, (131831), 0 states have call successors, (0), 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-10-13 23:30:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127673 states to 127673 states and 131831 transitions. [2024-10-13 23:30:52,961 INFO L78 Accepts]: Start accepts. Automaton has 127673 states and 131831 transitions. Word has length 775 [2024-10-13 23:30:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:52,962 INFO L471 AbstractCegarLoop]: Abstraction has 127673 states and 131831 transitions. [2024-10-13 23:30:52,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 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-10-13 23:30:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 127673 states and 131831 transitions. [2024-10-13 23:30:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2024-10-13 23:30:52,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:52,987 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:30:52,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:30:52,988 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:52,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -805547321, now seen corresponding path program 1 times [2024-10-13 23:30:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:52,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184369322] [2024-10-13 23:30:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 1186 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-13 23:30:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:54,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184369322] [2024-10-13 23:30:54,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184369322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:54,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:54,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:30:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857243509] [2024-10-13 23:30:54,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:54,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:30:54,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:54,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:30:54,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:30:54,020 INFO L87 Difference]: Start difference. First operand 127673 states and 131831 transitions. Second operand has 4 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 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-10-13 23:30:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:57,490 INFO L93 Difference]: Finished difference Result 262104 states and 270564 transitions. [2024-10-13 23:30:57,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:30:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 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 840 [2024-10-13 23:30:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:57,619 INFO L225 Difference]: With dead ends: 262104 [2024-10-13 23:30:57,619 INFO L226 Difference]: Without dead ends: 135183 [2024-10-13 23:30:57,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:30:57,687 INFO L432 NwaCegarLoop]: 1295 mSDtfsCounter, 1236 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5268 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 5456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 5268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:57,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1315 Invalid, 5456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 5268 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 23:30:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135183 states. [2024-10-13 23:30:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135183 to 135183. [2024-10-13 23:30:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135183 states, 135182 states have (on average 1.0304552381234189) internal successors, (139299), 135182 states have internal predecessors, (139299), 0 states have call successors, (0), 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-10-13 23:30:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135183 states to 135183 states and 139299 transitions. [2024-10-13 23:30:59,199 INFO L78 Accepts]: Start accepts. Automaton has 135183 states and 139299 transitions. Word has length 840 [2024-10-13 23:30:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:59,199 INFO L471 AbstractCegarLoop]: Abstraction has 135183 states and 139299 transitions. [2024-10-13 23:30:59,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 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-10-13 23:30:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 135183 states and 139299 transitions. [2024-10-13 23:30:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-10-13 23:30:59,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:59,223 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:30:59,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:30:59,224 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:59,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash -710587507, now seen corresponding path program 1 times [2024-10-13 23:30:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:59,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390081644] [2024-10-13 23:30:59,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 743 proven. 19 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-10-13 23:31:00,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:31:00,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390081644] [2024-10-13 23:31:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390081644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:31:00,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123554149] [2024-10-13 23:31:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:00,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:31:00,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:31:00,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:31:00,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:31:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:01,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:31:01,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:31:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 762 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-10-13 23:31:01,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:31:01,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123554149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:31:01,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:31:01,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 23:31:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473284880] [2024-10-13 23:31:01,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:31:01,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:31:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:31:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:31:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:31:01,641 INFO L87 Difference]: Start difference. First operand 135183 states and 139299 transitions. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)