./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.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 d9bb0fb3fb89b50a98609e7d92154455ef985195351d080b4795952eedc79161 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:57:26,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:57:26,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:57:26,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:57:26,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:57:26,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:57:26,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:57:26,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:57:26,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:57:26,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:57:26,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:57:26,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:57:26,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:57:26,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:57:26,166 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:57:26,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:57:26,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:57:26,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:57:26,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:57:26,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:57:26,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:57:26,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:57:26,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:57:26,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:57:26,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:57:26,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:57:26,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:57:26,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:57:26,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:57:26,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:57:26,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:57:26,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:57:26,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:57:26,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:57:26,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:57:26,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:57:26,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:57:26,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:57:26,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:57:26,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:57:26,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:57:26,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:57:26,176 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 -> d9bb0fb3fb89b50a98609e7d92154455ef985195351d080b4795952eedc79161 [2024-11-10 00:57:26,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:57:26,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:57:26,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:57:26,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:57:26,497 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:57:26,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c [2024-11-10 00:57:27,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:57:28,345 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:57:28,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c [2024-11-10 00:57:28,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c290d6a/38ecca024ee6490785b0937541beb25e/FLAGc435a4ed8 [2024-11-10 00:57:28,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c290d6a/38ecca024ee6490785b0937541beb25e [2024-11-10 00:57:28,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:57:28,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:57:28,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:57:28,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:57:28,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:57:28,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:57:28" (1/1) ... [2024-11-10 00:57:28,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68384261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:28, skipping insertion in model container [2024-11-10 00:57:28,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:57:28" (1/1) ... [2024-11-10 00:57:28,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:57:29,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c[15482,15495] [2024-11-10 00:57:29,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c[17357,17370] [2024-11-10 00:57:29,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:57:29,924 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:57:29,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c[15482,15495] [2024-11-10 00:57:29,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c[17357,17370] [2024-11-10 00:57:30,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:57:30,396 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:57:30,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30 WrapperNode [2024-11-10 00:57:30,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:57:30,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:57:30,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:57:30,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:57:30,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:30,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:30,816 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5157 [2024-11-10 00:57:30,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:57:30,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:57:30,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:57:30,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:57:30,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:30,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:30,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:31,102 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:57:31,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:31,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:31,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:31,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:31,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:31,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:31,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:57:31,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:57:31,322 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:57:31,322 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:57:31,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (1/1) ... [2024-11-10 00:57:31,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:57:31,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:57:31,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:57:31,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:57:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:57:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:57:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:57:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:57:31,604 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:57:31,606 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:57:37,238 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3683: havoc calculate_output2_#t~ret43#1; [2024-11-10 00:57:37,238 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5173: havoc calculate_output3_#t~ret44#1; [2024-11-10 00:57:37,239 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2204: havoc calculate_output_#t~ret42#1; [2024-11-10 00:57:37,483 INFO L? ?]: Removed 2086 outVars from TransFormulas that were not future-live. [2024-11-10 00:57:37,483 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:57:37,529 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:57:37,530 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:57:37,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:57:37 BoogieIcfgContainer [2024-11-10 00:57:37,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:57:37,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:57:37,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:57:37,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:57:37,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:57:28" (1/3) ... [2024-11-10 00:57:37,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103b8088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:57:37, skipping insertion in model container [2024-11-10 00:57:37,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:30" (2/3) ... [2024-11-10 00:57:37,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103b8088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:57:37, skipping insertion in model container [2024-11-10 00:57:37,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:57:37" (3/3) ... [2024-11-10 00:57:37,539 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c [2024-11-10 00:57:37,555 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:57:37,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:57:37,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:57:37,653 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;@78288d2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:57:37,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:57:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 921 states, 918 states have (on average 2.6383442265795205) internal successors, (2422), 920 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 00:57:37,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:37,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:37,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:37,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash -454194647, now seen corresponding path program 1 times [2024-11-10 00:57:37,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:37,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024464009] [2024-11-10 00:57:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:37,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024464009] [2024-11-10 00:57:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024464009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:37,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:37,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:57:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875544941] [2024-11-10 00:57:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:38,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:38,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:38,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:38,026 INFO L87 Difference]: Start difference. First operand has 921 states, 918 states have (on average 2.6383442265795205) internal successors, (2422), 920 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:42,453 INFO L93 Difference]: Finished difference Result 2550 states and 6937 transitions. [2024-11-10 00:57:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-10 00:57:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:42,482 INFO L225 Difference]: With dead ends: 2550 [2024-11-10 00:57:42,482 INFO L226 Difference]: Without dead ends: 1605 [2024-11-10 00:57:42,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:42,495 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1731 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 4568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:42,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 331 Invalid, 4568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-10 00:57:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-11-10 00:57:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2024-11-10 00:57:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1603 states have (on average 2.686837180286962) internal successors, (4307), 1604 states have internal predecessors, (4307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 4307 transitions. [2024-11-10 00:57:42,622 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 4307 transitions. Word has length 18 [2024-11-10 00:57:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:42,622 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 4307 transitions. [2024-11-10 00:57:42,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 4307 transitions. [2024-11-10 00:57:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:57:42,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:42,624 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] [2024-11-10 00:57:42,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:57:42,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:42,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:42,627 INFO L85 PathProgramCache]: Analyzing trace with hash -75566065, now seen corresponding path program 1 times [2024-11-10 00:57:42,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:42,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520251893] [2024-11-10 00:57:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:42,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:42,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520251893] [2024-11-10 00:57:42,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520251893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:42,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:42,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:57:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299597875] [2024-11-10 00:57:42,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:42,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:57:42,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:42,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:57:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:57:42,844 INFO L87 Difference]: Start difference. First operand 1605 states and 4307 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:43,027 INFO L93 Difference]: Finished difference Result 1660 states and 4391 transitions. [2024-11-10 00:57:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:57:43,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 00:57:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:43,035 INFO L225 Difference]: With dead ends: 1660 [2024-11-10 00:57:43,036 INFO L226 Difference]: Without dead ends: 1605 [2024-11-10 00:57:43,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:57:43,038 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 0 mSDsluCounter, 6810 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9095 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:43,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9095 Invalid, 52 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-11-10 00:57:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2024-11-10 00:57:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1603 states have (on average 2.6618839675608235) internal successors, (4267), 1604 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 4267 transitions. [2024-11-10 00:57:43,084 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 4267 transitions. Word has length 28 [2024-11-10 00:57:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:43,085 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 4267 transitions. [2024-11-10 00:57:43,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 4267 transitions. [2024-11-10 00:57:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:57:43,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:43,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:43,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:57:43,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:43,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash 954186912, now seen corresponding path program 1 times [2024-11-10 00:57:43,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:43,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488143885] [2024-11-10 00:57:43,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:43,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:43,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488143885] [2024-11-10 00:57:43,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488143885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:43,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:43,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:57:43,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410044095] [2024-11-10 00:57:43,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:43,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:57:43,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:57:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:57:43,349 INFO L87 Difference]: Start difference. First operand 1605 states and 4267 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:43,705 INFO L93 Difference]: Finished difference Result 2217 states and 5227 transitions. [2024-11-10 00:57:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:57:43,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-10 00:57:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:43,718 INFO L225 Difference]: With dead ends: 2217 [2024-11-10 00:57:43,719 INFO L226 Difference]: Without dead ends: 2166 [2024-11-10 00:57:43,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:57:43,723 INFO L432 NwaCegarLoop]: 2243 mSDtfsCounter, 13829 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13829 SdHoareTripleChecker+Valid, 4341 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:43,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13829 Valid, 4341 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:57:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2024-11-10 00:57:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 1653. [2024-11-10 00:57:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1651 states have (on average 2.630526953361599) internal successors, (4343), 1652 states have internal predecessors, (4343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 4343 transitions. [2024-11-10 00:57:43,774 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 4343 transitions. Word has length 67 [2024-11-10 00:57:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:43,774 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 4343 transitions. [2024-11-10 00:57:43,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 4343 transitions. [2024-11-10 00:57:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:57:43,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:43,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:43,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:57:43,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash 139981634, now seen corresponding path program 1 times [2024-11-10 00:57:43,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:43,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096527231] [2024-11-10 00:57:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:43,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096527231] [2024-11-10 00:57:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096527231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:44,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:57:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643763483] [2024-11-10 00:57:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:44,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:57:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:44,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:57:44,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:57:44,128 INFO L87 Difference]: Start difference. First operand 1653 states and 4343 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:44,397 INFO L93 Difference]: Finished difference Result 1755 states and 4501 transitions. [2024-11-10 00:57:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:57:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-10 00:57:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:44,407 INFO L225 Difference]: With dead ends: 1755 [2024-11-10 00:57:44,407 INFO L226 Difference]: Without dead ends: 1656 [2024-11-10 00:57:44,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:57:44,411 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 4392 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4392 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:44,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4392 Valid, 2622 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:57:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-11-10 00:57:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1653. [2024-11-10 00:57:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1651 states have (on average 2.62992125984252) internal successors, (4342), 1652 states have internal predecessors, (4342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 4342 transitions. [2024-11-10 00:57:44,458 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 4342 transitions. Word has length 69 [2024-11-10 00:57:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:44,459 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 4342 transitions. [2024-11-10 00:57:44,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:44,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 4342 transitions. [2024-11-10 00:57:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 00:57:44,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:44,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:44,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:57:44,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1768282563, now seen corresponding path program 1 times [2024-11-10 00:57:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116579275] [2024-11-10 00:57:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:44,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:44,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116579275] [2024-11-10 00:57:44,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116579275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:44,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:44,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:44,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451205212] [2024-11-10 00:57:44,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:44,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:44,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:44,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:44,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:44,566 INFO L87 Difference]: Start difference. First operand 1653 states and 4342 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:44,615 INFO L93 Difference]: Finished difference Result 1839 states and 4632 transitions. [2024-11-10 00:57:44,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:44,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-10 00:57:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:44,625 INFO L225 Difference]: With dead ends: 1839 [2024-11-10 00:57:44,625 INFO L226 Difference]: Without dead ends: 1740 [2024-11-10 00:57:44,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:44,627 INFO L432 NwaCegarLoop]: 2253 mSDtfsCounter, 2174 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:44,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2328 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2024-11-10 00:57:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1737. [2024-11-10 00:57:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1735 states have (on average 2.577521613832853) internal successors, (4472), 1736 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 4472 transitions. [2024-11-10 00:57:44,674 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 4472 transitions. Word has length 70 [2024-11-10 00:57:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:44,674 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 4472 transitions. [2024-11-10 00:57:44,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 4472 transitions. [2024-11-10 00:57:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:57:44,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:44,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:44,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:57:44,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:44,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 195638852, now seen corresponding path program 1 times [2024-11-10 00:57:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:44,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179946726] [2024-11-10 00:57:44,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:44,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:44,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179946726] [2024-11-10 00:57:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179946726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:44,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:44,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:44,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639022428] [2024-11-10 00:57:44,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:44,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:44,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:44,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:44,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:44,749 INFO L87 Difference]: Start difference. First operand 1737 states and 4472 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:44,827 INFO L93 Difference]: Finished difference Result 1930 states and 4772 transitions. [2024-11-10 00:57:44,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:44,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:57:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:44,836 INFO L225 Difference]: With dead ends: 1930 [2024-11-10 00:57:44,837 INFO L226 Difference]: Without dead ends: 1831 [2024-11-10 00:57:44,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:44,838 INFO L432 NwaCegarLoop]: 2311 mSDtfsCounter, 2190 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:44,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2392 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-10 00:57:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1828. [2024-11-10 00:57:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1826 states have (on average 2.5257393209200436) internal successors, (4612), 1827 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 4612 transitions. [2024-11-10 00:57:44,890 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 4612 transitions. Word has length 71 [2024-11-10 00:57:44,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:44,891 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 4612 transitions. [2024-11-10 00:57:44,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 4612 transitions. [2024-11-10 00:57:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:57:44,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:44,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:44,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:57:44,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:44,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -576901948, now seen corresponding path program 1 times [2024-11-10 00:57:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758717790] [2024-11-10 00:57:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:44,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:44,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758717790] [2024-11-10 00:57:44,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758717790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:44,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176635006] [2024-11-10 00:57:44,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:44,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:44,992 INFO L87 Difference]: Start difference. First operand 1828 states and 4612 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:45,045 INFO L93 Difference]: Finished difference Result 2346 states and 5414 transitions. [2024-11-10 00:57:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:45,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:57:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:45,055 INFO L225 Difference]: With dead ends: 2346 [2024-11-10 00:57:45,055 INFO L226 Difference]: Without dead ends: 2075 [2024-11-10 00:57:45,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:45,056 INFO L432 NwaCegarLoop]: 2303 mSDtfsCounter, 2186 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2186 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:45,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2186 Valid, 2392 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2024-11-10 00:57:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2072. [2024-11-10 00:57:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 2070 states have (on average 2.407729468599034) internal successors, (4984), 2071 states have internal predecessors, (4984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 4984 transitions. [2024-11-10 00:57:45,118 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 4984 transitions. Word has length 71 [2024-11-10 00:57:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:45,119 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 4984 transitions. [2024-11-10 00:57:45,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 4984 transitions. [2024-11-10 00:57:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:57:45,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:45,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:45,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:57:45,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:45,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1578311676, now seen corresponding path program 1 times [2024-11-10 00:57:45,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:45,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000074826] [2024-11-10 00:57:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:45,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:45,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000074826] [2024-11-10 00:57:45,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000074826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:45,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:45,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:45,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531583774] [2024-11-10 00:57:45,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:45,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:45,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:45,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:45,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:45,200 INFO L87 Difference]: Start difference. First operand 2072 states and 4984 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:45,256 INFO L93 Difference]: Finished difference Result 3054 states and 6488 transitions. [2024-11-10 00:57:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:45,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:57:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:45,268 INFO L225 Difference]: With dead ends: 3054 [2024-11-10 00:57:45,268 INFO L226 Difference]: Without dead ends: 2539 [2024-11-10 00:57:45,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:45,271 INFO L432 NwaCegarLoop]: 2301 mSDtfsCounter, 2184 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:45,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 2394 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2024-11-10 00:57:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2536. [2024-11-10 00:57:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2534 states have (on average 2.2415153906866614) internal successors, (5680), 2535 states have internal predecessors, (5680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 5680 transitions. [2024-11-10 00:57:45,348 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 5680 transitions. Word has length 71 [2024-11-10 00:57:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:45,348 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 5680 transitions. [2024-11-10 00:57:45,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 5680 transitions. [2024-11-10 00:57:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:57:45,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:45,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:45,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:57:45,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:45,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1592761532, now seen corresponding path program 1 times [2024-11-10 00:57:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140301340] [2024-11-10 00:57:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140301340] [2024-11-10 00:57:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140301340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:45,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:45,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875874297] [2024-11-10 00:57:45,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:45,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:45,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:45,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:45,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:45,431 INFO L87 Difference]: Start difference. First operand 2536 states and 5680 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:45,505 INFO L93 Difference]: Finished difference Result 4398 states and 8492 transitions. [2024-11-10 00:57:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:45,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:57:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:45,527 INFO L225 Difference]: With dead ends: 4398 [2024-11-10 00:57:45,531 INFO L226 Difference]: Without dead ends: 3419 [2024-11-10 00:57:45,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:45,534 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 2182 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:45,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 2396 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2024-11-10 00:57:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3416. [2024-11-10 00:57:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3416 states, 3414 states have (on average 2.043350908025776) internal successors, (6976), 3415 states have internal predecessors, (6976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 6976 transitions. [2024-11-10 00:57:45,649 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 6976 transitions. Word has length 71 [2024-11-10 00:57:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:45,649 INFO L471 AbstractCegarLoop]: Abstraction has 3416 states and 6976 transitions. [2024-11-10 00:57:45,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 6976 transitions. [2024-11-10 00:57:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:57:45,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:45,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:45,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:57:45,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:45,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash 498841220, now seen corresponding path program 1 times [2024-11-10 00:57:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:45,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950073027] [2024-11-10 00:57:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:45,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950073027] [2024-11-10 00:57:45,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950073027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:45,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:45,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:45,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530492059] [2024-11-10 00:57:45,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:45,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:45,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:45,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:45,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:45,729 INFO L87 Difference]: Start difference. First operand 3416 states and 6976 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:45,839 INFO L93 Difference]: Finished difference Result 6942 states and 12212 transitions. [2024-11-10 00:57:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:45,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:57:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:45,861 INFO L225 Difference]: With dead ends: 6942 [2024-11-10 00:57:45,861 INFO L226 Difference]: Without dead ends: 5083 [2024-11-10 00:57:45,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:45,866 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 2180 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:45,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2398 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2024-11-10 00:57:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 5080. [2024-11-10 00:57:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 5078 states have (on average 1.8463962189838519) internal successors, (9376), 5079 states have internal predecessors, (9376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 9376 transitions. [2024-11-10 00:57:46,011 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 9376 transitions. Word has length 71 [2024-11-10 00:57:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:46,012 INFO L471 AbstractCegarLoop]: Abstraction has 5080 states and 9376 transitions. [2024-11-10 00:57:46,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 9376 transitions. [2024-11-10 00:57:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:57:46,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:46,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:46,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:57:46,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:46,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -25435835, now seen corresponding path program 1 times [2024-11-10 00:57:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:46,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216015103] [2024-11-10 00:57:46,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216015103] [2024-11-10 00:57:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216015103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:46,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:46,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:57:46,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36646112] [2024-11-10 00:57:46,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:46,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:57:46,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:46,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:57:46,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:57:46,271 INFO L87 Difference]: Start difference. First operand 5080 states and 9376 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:46,398 INFO L93 Difference]: Finished difference Result 5275 states and 9634 transitions. [2024-11-10 00:57:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:57:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:57:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:46,410 INFO L225 Difference]: With dead ends: 5275 [2024-11-10 00:57:46,410 INFO L226 Difference]: Without dead ends: 5272 [2024-11-10 00:57:46,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:57:46,413 INFO L432 NwaCegarLoop]: 2241 mSDtfsCounter, 0 mSDsluCounter, 13433 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15674 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:46,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15674 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2024-11-10 00:57:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 5272. [2024-11-10 00:57:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5272 states, 5270 states have (on average 1.8125237191650854) internal successors, (9552), 5271 states have internal predecessors, (9552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5272 states to 5272 states and 9552 transitions. [2024-11-10 00:57:46,621 INFO L78 Accepts]: Start accepts. Automaton has 5272 states and 9552 transitions. Word has length 71 [2024-11-10 00:57:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:46,621 INFO L471 AbstractCegarLoop]: Abstraction has 5272 states and 9552 transitions. [2024-11-10 00:57:46,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5272 states and 9552 transitions. [2024-11-10 00:57:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:57:46,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:46,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:57:46,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:57:46,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:46,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:46,623 INFO L85 PathProgramCache]: Analyzing trace with hash -294827644, now seen corresponding path program 1 times [2024-11-10 00:57:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:46,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739920463] [2024-11-10 00:57:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739920463] [2024-11-10 00:57:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739920463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:46,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342418161] [2024-11-10 00:57:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:46,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:46,681 INFO L87 Difference]: Start difference. First operand 5272 states and 9552 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:46,812 INFO L93 Difference]: Finished difference Result 12318 states and 19604 transitions. [2024-11-10 00:57:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:46,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:57:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:46,834 INFO L225 Difference]: With dead ends: 12318 [2024-11-10 00:57:46,834 INFO L226 Difference]: Without dead ends: 8603 [2024-11-10 00:57:46,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:46,843 INFO L432 NwaCegarLoop]: 2313 mSDtfsCounter, 2188 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:46,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 2398 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8603 states. [2024-11-10 00:57:47,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8603 to 8600. [2024-11-10 00:57:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8600 states, 8598 states have (on average 1.6450337287741335) internal successors, (14144), 8599 states have internal predecessors, (14144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8600 states to 8600 states and 14144 transitions. [2024-11-10 00:57:47,069 INFO L78 Accepts]: Start accepts. Automaton has 8600 states and 14144 transitions. Word has length 71 [2024-11-10 00:57:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:47,069 INFO L471 AbstractCegarLoop]: Abstraction has 8600 states and 14144 transitions. [2024-11-10 00:57:47,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 8600 states and 14144 transitions. [2024-11-10 00:57:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 00:57:47,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:47,071 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:57:47,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:57:47,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:47,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash -812528184, now seen corresponding path program 1 times [2024-11-10 00:57:47,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:47,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519601192] [2024-11-10 00:57:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:47,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519601192] [2024-11-10 00:57:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519601192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:47,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184945376] [2024-11-10 00:57:47,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:47,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:57:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:47,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:57:47,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:57:47,264 INFO L87 Difference]: Start difference. First operand 8600 states and 14144 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:54,272 INFO L93 Difference]: Finished difference Result 12363 states and 24440 transitions. [2024-11-10 00:57:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:57:54,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-10 00:57:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:54,293 INFO L225 Difference]: With dead ends: 12363 [2024-11-10 00:57:54,294 INFO L226 Difference]: Without dead ends: 10856 [2024-11-10 00:57:54,297 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-11-10 00:57:54,298 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 4469 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4469 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 9022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:54,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4469 Valid, 844 Invalid, 9022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-10 00:57:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10856 states. [2024-11-10 00:57:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10856 to 10856. [2024-11-10 00:57:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10856 states, 10854 states have (on average 1.7796204164363367) internal successors, (19316), 10855 states have internal predecessors, (19316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10856 states to 10856 states and 19316 transitions. [2024-11-10 00:57:54,560 INFO L78 Accepts]: Start accepts. Automaton has 10856 states and 19316 transitions. Word has length 88 [2024-11-10 00:57:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:54,560 INFO L471 AbstractCegarLoop]: Abstraction has 10856 states and 19316 transitions. [2024-11-10 00:57:54,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 10856 states and 19316 transitions. [2024-11-10 00:57:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 00:57:54,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:54,564 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:57:54,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:57:54,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:54,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash 970252654, now seen corresponding path program 1 times [2024-11-10 00:57:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:54,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569796302] [2024-11-10 00:57:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:54,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569796302] [2024-11-10 00:57:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569796302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:54,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:54,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846942449] [2024-11-10 00:57:54,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:54,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:54,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:54,649 INFO L87 Difference]: Start difference. First operand 10856 states and 19316 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:58,450 INFO L93 Difference]: Finished difference Result 17627 states and 36498 transitions. [2024-11-10 00:57:58,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:58,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-10 00:57:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:58,482 INFO L225 Difference]: With dead ends: 17627 [2024-11-10 00:57:58,482 INFO L226 Difference]: Without dead ends: 13864 [2024-11-10 00:57:58,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:58,491 INFO L432 NwaCegarLoop]: 1779 mSDtfsCounter, 1455 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:58,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 1915 Invalid, 4425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-10 00:57:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13864 states. [2024-11-10 00:57:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13864 to 13864. [2024-11-10 00:57:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13864 states, 13862 states have (on average 1.9131438464867985) internal successors, (26520), 13863 states have internal predecessors, (26520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13864 states to 13864 states and 26520 transitions. [2024-11-10 00:57:58,892 INFO L78 Accepts]: Start accepts. Automaton has 13864 states and 26520 transitions. Word has length 90 [2024-11-10 00:57:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:58,893 INFO L471 AbstractCegarLoop]: Abstraction has 13864 states and 26520 transitions. [2024-11-10 00:57:58,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 13864 states and 26520 transitions. [2024-11-10 00:57:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:57:58,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:58,897 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:57:58,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:57:58,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:58,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash 674170550, now seen corresponding path program 1 times [2024-11-10 00:57:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814164347] [2024-11-10 00:57:58,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:58,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:57:59,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:59,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814164347] [2024-11-10 00:57:59,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814164347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:59,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:59,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:57:59,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626447095] [2024-11-10 00:57:59,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:59,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:57:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:59,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:57:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:57:59,116 INFO L87 Difference]: Start difference. First operand 13864 states and 26520 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:00,003 INFO L93 Difference]: Finished difference Result 55581 states and 85414 transitions. [2024-11-10 00:58:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 94 [2024-11-10 00:58:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:00,094 INFO L225 Difference]: With dead ends: 55581 [2024-11-10 00:58:00,095 INFO L226 Difference]: Without dead ends: 50586 [2024-11-10 00:58:00,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:00,113 INFO L432 NwaCegarLoop]: 2324 mSDtfsCounter, 11459 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11459 SdHoareTripleChecker+Valid, 5357 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:00,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11459 Valid, 5357 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50586 states. [2024-11-10 00:58:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50586 to 19912. [2024-11-10 00:58:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19912 states, 19910 states have (on average 1.7563033651431441) internal successors, (34968), 19911 states have internal predecessors, (34968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19912 states to 19912 states and 34968 transitions. [2024-11-10 00:58:00,733 INFO L78 Accepts]: Start accepts. Automaton has 19912 states and 34968 transitions. Word has length 94 [2024-11-10 00:58:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:00,733 INFO L471 AbstractCegarLoop]: Abstraction has 19912 states and 34968 transitions. [2024-11-10 00:58:00,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 19912 states and 34968 transitions. [2024-11-10 00:58:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:00,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:00,738 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:58:00,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:58:00,738 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:00,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:00,739 INFO L85 PathProgramCache]: Analyzing trace with hash -98370250, now seen corresponding path program 1 times [2024-11-10 00:58:00,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:00,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528396278] [2024-11-10 00:58:00,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:00,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:58:00,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:00,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528396278] [2024-11-10 00:58:00,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528396278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:00,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:00,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206273593] [2024-11-10 00:58:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:00,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:00,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:00,938 INFO L87 Difference]: Start difference. First operand 19912 states and 34968 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:01,893 INFO L93 Difference]: Finished difference Result 62621 states and 95302 transitions. [2024-11-10 00:58:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:01,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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 94 [2024-11-10 00:58:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:01,977 INFO L225 Difference]: With dead ends: 62621 [2024-11-10 00:58:01,978 INFO L226 Difference]: Without dead ends: 55578 [2024-11-10 00:58:02,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:02,009 INFO L432 NwaCegarLoop]: 2326 mSDtfsCounter, 11515 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11515 SdHoareTripleChecker+Valid, 5394 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:02,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11515 Valid, 5394 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55578 states. [2024-11-10 00:58:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55578 to 29448. [2024-11-10 00:58:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29448 states, 29446 states have (on average 1.6396114922230525) internal successors, (48280), 29447 states have internal predecessors, (48280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29448 states to 29448 states and 48280 transitions. [2024-11-10 00:58:02,847 INFO L78 Accepts]: Start accepts. Automaton has 29448 states and 48280 transitions. Word has length 94 [2024-11-10 00:58:02,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:02,848 INFO L471 AbstractCegarLoop]: Abstraction has 29448 states and 48280 transitions. [2024-11-10 00:58:02,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29448 states and 48280 transitions. [2024-11-10 00:58:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:02,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:02,853 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:58:02,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:58:02,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:02,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:02,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1099779978, now seen corresponding path program 1 times [2024-11-10 00:58:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:02,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540587356] [2024-11-10 00:58:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:58:03,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:03,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540587356] [2024-11-10 00:58:03,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540587356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:03,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:03,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:03,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552262579] [2024-11-10 00:58:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:03,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:03,052 INFO L87 Difference]: Start difference. First operand 29448 states and 48280 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:04,275 INFO L93 Difference]: Finished difference Result 69661 states and 105158 transitions. [2024-11-10 00:58:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:04,355 INFO L225 Difference]: With dead ends: 69661 [2024-11-10 00:58:04,355 INFO L226 Difference]: Without dead ends: 62618 [2024-11-10 00:58:04,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:04,382 INFO L432 NwaCegarLoop]: 2323 mSDtfsCounter, 11563 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11563 SdHoareTripleChecker+Valid, 5320 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:04,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11563 Valid, 5320 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62618 states. [2024-11-10 00:58:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62618 to 36488. [2024-11-10 00:58:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36488 states, 36486 states have (on average 1.593378282080798) internal successors, (58136), 36487 states have internal predecessors, (58136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36488 states to 36488 states and 58136 transitions. [2024-11-10 00:58:05,422 INFO L78 Accepts]: Start accepts. Automaton has 36488 states and 58136 transitions. Word has length 94 [2024-11-10 00:58:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:05,423 INFO L471 AbstractCegarLoop]: Abstraction has 36488 states and 58136 transitions. [2024-11-10 00:58:05,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 36488 states and 58136 transitions. [2024-11-10 00:58:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:05,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:05,433 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:58:05,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:58:05,434 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:05,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1114229834, now seen corresponding path program 1 times [2024-11-10 00:58:05,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:05,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112663644] [2024-11-10 00:58:05,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:05,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:58:05,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112663644] [2024-11-10 00:58:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112663644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287553439] [2024-11-10 00:58:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:05,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:05,686 INFO L87 Difference]: Start difference. First operand 36488 states and 58136 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:06,843 INFO L93 Difference]: Finished difference Result 76701 states and 115014 transitions. [2024-11-10 00:58:06,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:06,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 94 [2024-11-10 00:58:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:06,932 INFO L225 Difference]: With dead ends: 76701 [2024-11-10 00:58:06,932 INFO L226 Difference]: Without dead ends: 69658 [2024-11-10 00:58:06,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:06,959 INFO L432 NwaCegarLoop]: 2320 mSDtfsCounter, 11610 mSDsluCounter, 3023 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11610 SdHoareTripleChecker+Valid, 5343 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:06,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11610 Valid, 5343 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69658 states. [2024-11-10 00:58:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69658 to 43528. [2024-11-10 00:58:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43528 states, 43526 states have (on average 1.562100813306989) internal successors, (67992), 43527 states have internal predecessors, (67992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 67992 transitions. [2024-11-10 00:58:08,089 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 67992 transitions. Word has length 94 [2024-11-10 00:58:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:08,090 INFO L471 AbstractCegarLoop]: Abstraction has 43528 states and 67992 transitions. [2024-11-10 00:58:08,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 67992 transitions. [2024-11-10 00:58:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:08,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:08,096 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:58:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:58:08,096 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:08,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 977372918, now seen corresponding path program 1 times [2024-11-10 00:58:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738095450] [2024-11-10 00:58:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 00:58:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738095450] [2024-11-10 00:58:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738095450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:08,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:08,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:08,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268987035] [2024-11-10 00:58:08,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:08,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:08,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:08,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:08,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:08,285 INFO L87 Difference]: Start difference. First operand 43528 states and 67992 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:10,362 INFO L93 Difference]: Finished difference Result 83741 states and 124870 transitions. [2024-11-10 00:58:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 94 [2024-11-10 00:58:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:10,445 INFO L225 Difference]: With dead ends: 83741 [2024-11-10 00:58:10,445 INFO L226 Difference]: Without dead ends: 76698 [2024-11-10 00:58:10,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:10,463 INFO L432 NwaCegarLoop]: 2320 mSDtfsCounter, 11522 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11522 SdHoareTripleChecker+Valid, 5423 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:10,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11522 Valid, 5423 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76698 states. [2024-11-10 00:58:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76698 to 50568. [2024-11-10 00:58:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50568 states, 50566 states have (on average 1.539532492188427) internal successors, (77848), 50567 states have internal predecessors, (77848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50568 states to 50568 states and 77848 transitions. [2024-11-10 00:58:11,783 INFO L78 Accepts]: Start accepts. Automaton has 50568 states and 77848 transitions. Word has length 94 [2024-11-10 00:58:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:11,783 INFO L471 AbstractCegarLoop]: Abstraction has 50568 states and 77848 transitions. [2024-11-10 00:58:11,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 50568 states and 77848 transitions. [2024-11-10 00:58:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:11,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:11,790 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:58:11,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:58:11,790 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:11,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 183704054, now seen corresponding path program 1 times [2024-11-10 00:58:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857760433] [2024-11-10 00:58:11,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:58:11,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:11,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857760433] [2024-11-10 00:58:11,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857760433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:11,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:11,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:11,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449453488] [2024-11-10 00:58:11,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:11,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:11,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:11,962 INFO L87 Difference]: Start difference. First operand 50568 states and 77848 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:13,846 INFO L93 Difference]: Finished difference Result 90781 states and 134726 transitions. [2024-11-10 00:58:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:13,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 94 [2024-11-10 00:58:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:13,962 INFO L225 Difference]: With dead ends: 90781 [2024-11-10 00:58:13,962 INFO L226 Difference]: Without dead ends: 83738 [2024-11-10 00:58:13,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:13,988 INFO L432 NwaCegarLoop]: 2321 mSDtfsCounter, 11460 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11460 SdHoareTripleChecker+Valid, 5582 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:13,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11460 Valid, 5582 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83738 states. [2024-11-10 00:58:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83738 to 57608. [2024-11-10 00:58:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57608 states, 57606 states have (on average 1.5224802971912648) internal successors, (87704), 57607 states have internal predecessors, (87704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57608 states to 57608 states and 87704 transitions. [2024-11-10 00:58:16,011 INFO L78 Accepts]: Start accepts. Automaton has 57608 states and 87704 transitions. Word has length 94 [2024-11-10 00:58:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:16,011 INFO L471 AbstractCegarLoop]: Abstraction has 57608 states and 87704 transitions. [2024-11-10 00:58:16,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 57608 states and 87704 transitions. [2024-11-10 00:58:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:58:16,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:16,018 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:58:16,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:58:16,018 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:16,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1627197400, now seen corresponding path program 1 times [2024-11-10 00:58:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:16,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468646943] [2024-11-10 00:58:16,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:16,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:16,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468646943] [2024-11-10 00:58:16,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468646943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:16,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:16,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:16,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282629025] [2024-11-10 00:58:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:16,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:16,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:16,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:16,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:16,134 INFO L87 Difference]: Start difference. First operand 57608 states and 87704 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:17,798 INFO L93 Difference]: Finished difference Result 108398 states and 158844 transitions. [2024-11-10 00:58:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-10 00:58:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:17,881 INFO L225 Difference]: With dead ends: 108398 [2024-11-10 00:58:17,881 INFO L226 Difference]: Without dead ends: 57611 [2024-11-10 00:58:17,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:17,920 INFO L432 NwaCegarLoop]: 2291 mSDtfsCounter, 52 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4526 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:17,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4526 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57611 states. [2024-11-10 00:58:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57611 to 57608. [2024-11-10 00:58:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57608 states, 57606 states have (on average 1.5105370968301912) internal successors, (87016), 57607 states have internal predecessors, (87016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57608 states to 57608 states and 87016 transitions. [2024-11-10 00:58:19,468 INFO L78 Accepts]: Start accepts. Automaton has 57608 states and 87016 transitions. Word has length 96 [2024-11-10 00:58:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:19,468 INFO L471 AbstractCegarLoop]: Abstraction has 57608 states and 87016 transitions. [2024-11-10 00:58:19,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 57608 states and 87016 transitions. [2024-11-10 00:58:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:58:19,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:19,472 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:58:19,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:58:19,472 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:19,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1559669992, now seen corresponding path program 1 times [2024-11-10 00:58:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753657574] [2024-11-10 00:58:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:19,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:19,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753657574] [2024-11-10 00:58:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753657574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:19,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847338388] [2024-11-10 00:58:19,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:19,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:19,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:19,586 INFO L87 Difference]: Start difference. First operand 57608 states and 87016 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:20,509 INFO L93 Difference]: Finished difference Result 76357 states and 113204 transitions. [2024-11-10 00:58:20,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:20,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-10 00:58:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:20,565 INFO L225 Difference]: With dead ends: 76357 [2024-11-10 00:58:20,565 INFO L226 Difference]: Without dead ends: 25570 [2024-11-10 00:58:20,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:20,603 INFO L432 NwaCegarLoop]: 2289 mSDtfsCounter, 48 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4523 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:20,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4523 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25570 states. [2024-11-10 00:58:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25570 to 25560. [2024-11-10 00:58:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25560 states, 25558 states have (on average 1.663040926520072) internal successors, (42504), 25559 states have internal predecessors, (42504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25560 states to 25560 states and 42504 transitions. [2024-11-10 00:58:21,393 INFO L78 Accepts]: Start accepts. Automaton has 25560 states and 42504 transitions. Word has length 96 [2024-11-10 00:58:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:21,394 INFO L471 AbstractCegarLoop]: Abstraction has 25560 states and 42504 transitions. [2024-11-10 00:58:21,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 25560 states and 42504 transitions. [2024-11-10 00:58:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:58:21,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:21,396 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:58:21,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:58:21,396 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:21,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:21,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1304586086, now seen corresponding path program 1 times [2024-11-10 00:58:21,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:21,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927001578] [2024-11-10 00:58:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:21,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:21,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:21,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927001578] [2024-11-10 00:58:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927001578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:21,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:21,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922439815] [2024-11-10 00:58:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:21,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:21,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:21,506 INFO L87 Difference]: Start difference. First operand 25560 states and 42504 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:21,740 INFO L93 Difference]: Finished difference Result 34926 states and 55468 transitions. [2024-11-10 00:58:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-10 00:58:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:21,761 INFO L225 Difference]: With dead ends: 34926 [2024-11-10 00:58:21,761 INFO L226 Difference]: Without dead ends: 16203 [2024-11-10 00:58:21,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:21,776 INFO L432 NwaCegarLoop]: 2283 mSDtfsCounter, 46 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 4502 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:21,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 4502 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16203 states. [2024-11-10 00:58:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16203 to 16200. [2024-11-10 00:58:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16200 states, 16198 states have (on average 1.8165205580935917) internal successors, (29424), 16199 states have internal predecessors, (29424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 29424 transitions. [2024-11-10 00:58:22,180 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 29424 transitions. Word has length 98 [2024-11-10 00:58:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:22,181 INFO L471 AbstractCegarLoop]: Abstraction has 16200 states and 29424 transitions. [2024-11-10 00:58:22,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 29424 transitions. [2024-11-10 00:58:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:58:22,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:22,183 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:58:22,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:58:22,183 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:22,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash 687095265, now seen corresponding path program 1 times [2024-11-10 00:58:22,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:22,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808982376] [2024-11-10 00:58:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:22,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:22,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:22,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808982376] [2024-11-10 00:58:22,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808982376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:22,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:22,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:22,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103803197] [2024-11-10 00:58:22,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:22,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:22,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:22,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:22,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:22,280 INFO L87 Difference]: Start difference. First operand 16200 states and 29424 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:22,439 INFO L93 Difference]: Finished difference Result 20886 states and 35848 transitions. [2024-11-10 00:58:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:22,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-10 00:58:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:22,457 INFO L225 Difference]: With dead ends: 20886 [2024-11-10 00:58:22,457 INFO L226 Difference]: Without dead ends: 11523 [2024-11-10 00:58:22,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:22,467 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 43 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4487 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:22,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4487 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11523 states. [2024-11-10 00:58:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11523 to 11520. [2024-11-10 00:58:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 11518 states have (on average 1.9920125021705157) internal successors, (22944), 11519 states have internal predecessors, (22944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 22944 transitions. [2024-11-10 00:58:22,818 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 22944 transitions. Word has length 100 [2024-11-10 00:58:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:22,819 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 22944 transitions. [2024-11-10 00:58:22,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 22944 transitions. [2024-11-10 00:58:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:58:22,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:22,821 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:58:22,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:58:22,821 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:22,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:22,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1321194568, now seen corresponding path program 1 times [2024-11-10 00:58:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126134056] [2024-11-10 00:58:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:22,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126134056] [2024-11-10 00:58:22,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126134056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:22,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310389454] [2024-11-10 00:58:22,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:22,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:22,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:22,947 INFO L87 Difference]: Start difference. First operand 11520 states and 22944 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:23,080 INFO L93 Difference]: Finished difference Result 13866 states and 26128 transitions. [2024-11-10 00:58:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-10 00:58:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:23,095 INFO L225 Difference]: With dead ends: 13866 [2024-11-10 00:58:23,095 INFO L226 Difference]: Without dead ends: 9183 [2024-11-10 00:58:23,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:23,102 INFO L432 NwaCegarLoop]: 2269 mSDtfsCounter, 40 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4472 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:23,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4472 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9183 states. [2024-11-10 00:58:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9183 to 9180. [2024-11-10 00:58:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9180 states, 9178 states have (on average 2.15014164305949) internal successors, (19734), 9179 states have internal predecessors, (19734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9180 states to 9180 states and 19734 transitions. [2024-11-10 00:58:23,284 INFO L78 Accepts]: Start accepts. Automaton has 9180 states and 19734 transitions. Word has length 102 [2024-11-10 00:58:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:23,284 INFO L471 AbstractCegarLoop]: Abstraction has 9180 states and 19734 transitions. [2024-11-10 00:58:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states and 19734 transitions. [2024-11-10 00:58:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 00:58:23,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:23,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:23,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:58:23,286 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 503630799, now seen corresponding path program 1 times [2024-11-10 00:58:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451958233] [2024-11-10 00:58:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:23,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451958233] [2024-11-10 00:58:23,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451958233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:23,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:23,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:23,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041672904] [2024-11-10 00:58:23,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:23,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:23,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:23,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:23,444 INFO L87 Difference]: Start difference. First operand 9180 states and 19734 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:23,615 INFO L93 Difference]: Finished difference Result 10356 states and 21313 transitions. [2024-11-10 00:58:23,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:23,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-10 00:58:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:23,632 INFO L225 Difference]: With dead ends: 10356 [2024-11-10 00:58:23,632 INFO L226 Difference]: Without dead ends: 8013 [2024-11-10 00:58:23,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:23,636 INFO L432 NwaCegarLoop]: 2262 mSDtfsCounter, 37 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4457 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:23,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4457 Invalid, 5 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8013 states. [2024-11-10 00:58:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8013 to 8010. [2024-11-10 00:58:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8010 states, 8008 states have (on average 2.265734265734266) internal successors, (18144), 8009 states have internal predecessors, (18144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8010 states to 8010 states and 18144 transitions. [2024-11-10 00:58:23,746 INFO L78 Accepts]: Start accepts. Automaton has 8010 states and 18144 transitions. Word has length 104 [2024-11-10 00:58:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:23,746 INFO L471 AbstractCegarLoop]: Abstraction has 8010 states and 18144 transitions. [2024-11-10 00:58:23,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states and 18144 transitions. [2024-11-10 00:58:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 00:58:23,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:23,747 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:58:23,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 00:58:23,748 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:23,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1015442314, now seen corresponding path program 1 times [2024-11-10 00:58:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:23,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010126715] [2024-11-10 00:58:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:24,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:24,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010126715] [2024-11-10 00:58:24,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010126715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:58:24,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761973132] [2024-11-10 00:58:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:24,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:58:24,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:24,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:58:24,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:58:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:24,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:58:24,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:58:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:24,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:58:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:26,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761973132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:58:26,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:58:26,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:58:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196401281] [2024-11-10 00:58:26,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:58:26,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:58:26,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:58:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:58:26,330 INFO L87 Difference]: Start difference. First operand 8010 states and 18144 transitions. Second operand has 25 states, 25 states have (on average 12.0) internal successors, (300), 24 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:27,733 INFO L93 Difference]: Finished difference Result 13011 states and 24818 transitions. [2024-11-10 00:58:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:58:27,734 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 12.0) internal successors, (300), 24 states have internal predecessors, (300), 0 states have call successors, (0), 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 106 [2024-11-10 00:58:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:27,749 INFO L225 Difference]: With dead ends: 13011 [2024-11-10 00:58:27,749 INFO L226 Difference]: Without dead ends: 11838 [2024-11-10 00:58:27,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=611, Invalid=2469, Unknown=0, NotChecked=0, Total=3080 [2024-11-10 00:58:27,755 INFO L432 NwaCegarLoop]: 2197 mSDtfsCounter, 32313 mSDsluCounter, 9269 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32313 SdHoareTripleChecker+Valid, 11466 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:27,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32313 Valid, 11466 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:58:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2024-11-10 00:58:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 11760. [2024-11-10 00:58:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11760 states, 11758 states have (on average 1.9564551794522878) internal successors, (23004), 11759 states have internal predecessors, (23004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11760 states to 11760 states and 23004 transitions. [2024-11-10 00:58:28,133 INFO L78 Accepts]: Start accepts. Automaton has 11760 states and 23004 transitions. Word has length 106 [2024-11-10 00:58:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:28,133 INFO L471 AbstractCegarLoop]: Abstraction has 11760 states and 23004 transitions. [2024-11-10 00:58:28,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.0) internal successors, (300), 24 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 11760 states and 23004 transitions. [2024-11-10 00:58:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 00:58:28,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:28,135 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:58:28,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:58:28,336 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,SelfDestructingSolverStorable26 [2024-11-10 00:58:28,336 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:28,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash 924635062, now seen corresponding path program 1 times [2024-11-10 00:58:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:28,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82510688] [2024-11-10 00:58:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:29,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:29,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82510688] [2024-11-10 00:58:29,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82510688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:58:29,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272621853] [2024-11-10 00:58:29,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:29,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:58:29,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:29,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:58:29,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:58:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:29,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:58:29,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:58:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:30,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:58:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272621853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:58:31,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:58:31,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-11-10 00:58:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540882105] [2024-11-10 00:58:31,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:58:31,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:58:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:58:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:58:31,070 INFO L87 Difference]: Start difference. First operand 11760 states and 23004 transitions. Second operand has 29 states, 29 states have (on average 9.517241379310345) internal successors, (276), 28 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:34,481 INFO L93 Difference]: Finished difference Result 35781 states and 54638 transitions. [2024-11-10 00:58:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-10 00:58:34,482 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.517241379310345) internal successors, (276), 28 states have internal predecessors, (276), 0 states have call successors, (0), 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 106 [2024-11-10 00:58:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:34,519 INFO L225 Difference]: With dead ends: 35781 [2024-11-10 00:58:34,519 INFO L226 Difference]: Without dead ends: 30858 [2024-11-10 00:58:34,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1012, Invalid=4244, Unknown=0, NotChecked=0, Total=5256 [2024-11-10 00:58:34,533 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 34513 mSDsluCounter, 9708 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34513 SdHoareTripleChecker+Valid, 11931 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:34,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34513 Valid, 11931 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 00:58:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30858 states. [2024-11-10 00:58:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30858 to 30360. [2024-11-10 00:58:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30360 states, 30358 states have (on average 1.5463469266750116) internal successors, (46944), 30359 states have internal predecessors, (46944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30360 states to 30360 states and 46944 transitions. [2024-11-10 00:58:35,274 INFO L78 Accepts]: Start accepts. Automaton has 30360 states and 46944 transitions. Word has length 106 [2024-11-10 00:58:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:35,274 INFO L471 AbstractCegarLoop]: Abstraction has 30360 states and 46944 transitions. [2024-11-10 00:58:35,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.517241379310345) internal successors, (276), 28 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:58:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 30360 states and 46944 transitions. [2024-11-10 00:58:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:58:35,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:35,278 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:58:35,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:58:35,478 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,SelfDestructingSolverStorable27 [2024-11-10 00:58:35,479 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:35,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1292101041, now seen corresponding path program 1 times [2024-11-10 00:58:35,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:35,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006174802] [2024-11-10 00:58:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:35,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:35,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006174802] [2024-11-10 00:58:35,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006174802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:58:35,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671907641] [2024-11-10 00:58:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:35,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:58:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:35,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:58:35,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:58:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:36,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:58:36,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:58:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:36,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:58:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:37,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671907641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:58:37,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:58:37,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-10 00:58:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959683444] [2024-11-10 00:58:37,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:58:37,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 00:58:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:37,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 00:58:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-11-10 00:58:37,514 INFO L87 Difference]: Start difference. First operand 30360 states and 46944 transitions. Second operand has 26 states, 26 states have (on average 11.384615384615385) internal successors, (296), 25 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)